Uniformly bounded regret in the multi-secretary problem

  title={Uniformly bounded regret in the multi-secretary problem},
  author={Alessandro Arlotto and Itay Gurvich},
In the secretary problem of Cayley (1875) and Moser (1956), n non-negative, independent, random variables with common distribution are sequentially presented to a decision maker who decides when to stop and collect the most recent realization. The goal is to maximize the expected value of the collected element. In the k-choice variant, the decision maker is allowed to make k ¤ n selections to maximize the expected total value of the selected elements. Assuming that the values are drawn from a… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 8 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-5 of 5 references

On a problem of Cayley

2016. L. Moser
Scripta Mathematica, • 1956
View 3 Excerpts
Highly Influenced

Secretary problem”)

T. S. Ferguson
Israel J. Math., • 1964

Similar Papers

Loading similar papers…