Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T18:09:39.253Z Has data issue: false hasContentIssue false
  • English
  • Français

A new strategy for Robbins’ problem of optimal stopping

Part of:Stochastic processes

Published online by Cambridge University Press:  04 April 2017

Martin Meier and
Leopold Sögner
Martin Meier*
Affiliation:
IHS Vienna
Leopold Sögner*
Affiliation:
IHS Vienna
*
* Postal address: Department of Economics and Finance, Institute for Advanced Studies, Josefstädter Straße 39, 1080 Vienna, Austria.
* Postal address: Department of Economics and Finance, Institute for Advanced Studies, Josefstädter Straße 39, 1080 Vienna, Austria.
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.

In this paper we study the expected rank problem under full information. Our approach uses the planar Poisson approach from Gnedin (2007) to derive the expected rank of a stopping rule that is one of the simplest nontrivial examples combining rank dependent rules with threshold rules. This rule attains an expected rank lower than the best upper bounds obtained in the literature so far, in particular, we obtain an expected rank of 2.326 14.

Keywords

Optimal stoppingRobbins’ problem

MSC classification

Primary:60G40: Stopping times; optimal stopping problems; gambling theory

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 54 , Issue 1 , March 2017, pp. 331 - 336
Copyright
Copyright © Applied Probability Trust 2017 

References

[1] Assaf, D. and Samuel-Cahn, E. (1996).The secretary problem: minimizing the expected rank with i.i.d. random variables.Adv. Appl. Prob. 28,828–852.Google Scholar
[2] Bruss, F. T. (2005).What is known about Robbins’ problem?.J. Appl. Prob. 42,108–120.Google Scholar
[3] Bruss, F. T. and Delbaen, F. (2001).Optimal rules for the sequential selection of monotone subsequences of maximum expected length.Stoch. Process. Appl. 96,313–342.Google Scholar
[4] Bruss, F. T. and Ferguson, T. S. (1993).Minimizing the expected rank with full information.J. Appl. Prob. 30,616–626.Google Scholar
[5] Bruss, F. T. and Ferguson, T. S. (1995).Half-prophets and Robbins’ problem of minimizing the expected rank. In Athens Conference on Applied Probability and Time Series Analysis, Vol. I (Lect. Notes Statist. 114, 1996).Springer,New York, pp.1–17.Google Scholar
[6] Bruss, F. T. and Swan, Y. C. (2009).A continuous-time approach to Robbins’ problem of minimizing the expected rank.J. Appl. Prob. 46,1–18.CrossRefGoogle Scholar
[7] Gnedin, A. V. (1996).On the full information best-choice problem.J. Appl. Prob. 33,678–687.Google Scholar
[8] Gnedin, A. V. (2004).Best choice from the planar Poisson process.Stoch. Process. Appl. 111,317–354.Google Scholar
[9] Gnedin, A. V. (2009).Optimal stopping with rank-dependent loss.J. Appl. Prob. 44,996–1011.Google Scholar
[10] Gnedin, A. and Iksanov, A. (2011).Moments of random sums and Robbins’ problem of optimal stopping.J. Appl. Prob. 48,1197–1199.Google Scholar
[11] Meier, M. and Sögner, L. (2016).A new strategy for Robbins’ problem of optimal stopping. Preprint. Available at http://arxiv.org/abs/1606.03348.Google Scholar
[12] Swan, Y. (2011).A contribution to the study of Robbins’ problem. Doctoral Thesis, Université de Liége.Google Scholar
[13] Tamaki, M. (2004).The PPP approach to Robbins’ problem of minimizing the expected rank.RIMS Kokyuroku 1383,130–139.Google Scholar