arXiv:math/0510568 [math.PR]AbstractReferencesReviewsResources
Winning rate in the full-information best choice problem
Alexander Gnedin, Denis Miretskiy
Published 2005-10-26, updated 2005-11-19Version 3
Following a long-standing suggestion by Gilbert and Mosteller, we derive an explicit formula for the asymptotic winning rate in the full-information problem of the best choice.
Related articles: Most relevant | Search more
arXiv:1401.7197 [math.PR] (Published 2014-01-28)
On the Bellman function of Nazarov, Treil and Volberg
arXiv:math/0511652 [math.PR] (Published 2005-11-27)
The Probability of a Run
arXiv:math/0602278 [math.PR] (Published 2006-02-13)
Recognising the Last Record of a Sequence