Prophet Secretary: Surpassing the 1-1/e Barrier

@inproceedings{Azar2018ProphetSS,
  title={Prophet Secretary: Surpassing the 1-1/e Barrier},
  author={Yossi Azar and Ashish Chiplunkar and Haim Kaplan},
  booktitle={EC},
  year={2018}
}
In the Prophet Secretary problem, samples from a known set of probability distributions arrive one by one in a uniformly random order, and an algorithm must irrevocably pick one of the samples as soon as it arrives. The goal is to maximize the expected value of the sample picked relative to the expected maximum of the distributions. This is one of the most simple and fundamental problems in online decision making that models the process selling one item to a sequence of costumers. For a closely… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 6 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.

References

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

On semiamarts, amarts, and processes with finite value

  • Ulrich Krengel, Louis Sucheston
  • Adv. in Prob. Related Topics
  • 1978
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…