Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T03:02:10.546Z Has data issue: false hasContentIssue false
  • English
  • Français

Winning Rate in the Full-Information Best-Choice Problem

Part of:Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Alexander V. Gnedin and
Denis I. Miretskiy
Alexander V. Gnedin*
Affiliation:
Utrecht University
Denis I. Miretskiy*
Affiliation:
University of Twente
*
∗ Postal address: Department of Mathematics, Utrecht University, Postbus 80010, 3508 TA Utrecht, The Netherlands. Email address: gnedin@math.uu.nl
∗∗ Postal address: Department of Applied Mathematics, University of Twente, Postbus 217, 7500 AE Enschede, The Netherlands. Email address: d.miretskiy@math.utwente.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Following a long-standing suggestion by Gilbert and Mosteller, we derive an explicit formula for the asymptotic winning rate in the full-information best-choice problem.

Keywords

Best-choice problemPoisson embedding

MSC classification

Primary:60G40: Stopping times; optimal stopping problems; gambling theory
Secondary:60G70: Extreme value theory; extremal processes

Information

Type
Research Article
Information
Journal of Applied Probability , Volume 44 , Issue 2 , June 2007, pp. 560 - 565
Copyright
Copyright © Applied Probability Trust 2007 

References

Berezovsky, B. A. and Gnedin, A. V. (1984). The Best Choice Problem. Nauka, Moscow.Google Scholar
Bojdecki, T. (1977). On optimal stopping of independent random variables appearing to a renewal process with random time horizon. Bol. Soc. Mat. Mexicana 22, 35–40.Google Scholar
Gilbert, J. P. and Mosteller, F. (1966). Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.Google Scholar
Gnedin, A. V. (1996). On the full-information best-choice problem. J. Appl. Prob. 33, 678–687.Google Scholar
Gnedin, A. V. (2004). Best choice from the planar Poisson process. Stoch. Process. Appl. 111, 317–354.Google Scholar
Gnedin, A. V. (2005). Objectives in the best-choice problems. Sequential Anal. 24, 177–188.Google Scholar
Gnedin, A. V. (2007). Recognising the last record of a sequence. Stochastics 79, 199–209.Google Scholar
Gnedin, A. V. and Sakaguchi, M. (1992). On a best choice problem related to the Poisson process. Contemp. Math. 125, 59–64.Google Scholar
Hill, T. and Kennedy, D. (1992). Sharp inequalities for optimal stopping with rewards based on ranks. Ann. Appl. Prob. 2, 503–517.Google Scholar
Petruccelli, J. D. (1980). On a best choice problem with partial information. Ann. Statist. 8, 1171–1174.CrossRefGoogle Scholar
Porosiński, Z. (1987). The full-information best choice problem with a random number of observations. Stoch. Process. Appl. 24, 293–307.Google Scholar
Sakaguchi, M. (1976). Optimal stopping problems for randomly arriving offers. Math. Japon. 21, 210–217.Google Scholar
Samuel-Cahn, E. (1996). Optimal stopping with random horizon with application to the full-information best-choice problem with random freeze. J. Amer. Statist. Assoc. 91, 357–364.Google Scholar
Samuels, S. M. (1982). Exact solutions for the full information best choice problem. Mimeo Ser. 82-17, Department of Statistics, Purdue University.Google Scholar
Samuels, S. M. (1991). Secretary problems. In Handbook of Sequential Analysis, eds Ghosh, B. K. and Sen, P. K., Marcel Dekker, New York, pp. 381–405.Google Scholar
Samuels, S. M. (2004). Why do these quite different best-choice problems have the same solutions? Adv. Appl. Prob. 36, 398–416.CrossRefGoogle Scholar