Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-06T05:24:18.916Z Has data issue: false hasContentIssue false
  • English
  • Français

A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank

Part of: Stochastic processes

Published online by Cambridge University Press:  14 July 2016

F. Thomas Bruss  and
Yvik C. Swan
F. Thomas Bruss*
Affiliation:
Université Libre de Bruxelles
Yvik C. Swan*
Affiliation:
Université Libre de Bruxelles
*
∗Postal address: Département de Mathématique, Faculté des Sciences, Université Libre de Bruxelles, Campus Plaine, CP 210. B-1050 Brussels, Belgium.
∗Postal address: Département de Mathématique, Faculté des Sciences, Université Libre de Bruxelles, Campus Plaine, CP 210. B-1050 Brussels, Belgium.
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.

Let X1, X2, …, Xn be independent random variables uniformly distributed on [0,1]. We observe these sequentially and have to stop on exactly one of them. No recall of preceding observations is permitted. What stopping rule minimizes the expected rank of the selected observation? What is the value of the expected rank (as a function of n) and what is the limit of this value when n goes to ∞? This full-information expected selected-rank problem is known as Robbins' problem of minimizing the expected rank, and its general solution is unknown. In this paper we provide an alternative approach to Robbins' problem. Our model is similar to that of Gnedin (2007). For this, we consider a continuous-time version of the problem in which the observations follow a Poisson arrival process on ℝ+ × [0,1] of homogeneous rate 1. Translating the previous optimal selection problem in this setting, we prove that, under reasonable assumptions, the corresponding value function w(t) is bounded and Lipschitz continuous. Our main result is that the limiting value of the Poisson embedded problem exists and is equal to that of Robbins' problem. We prove that w(t) is differentiable and also derive a differential equation for this function. Although we have not succeeded in using this equation to improve on bounds on the optimal limiting value, we argue that it has this potential.

Keywords

Optimal stoppingsecretary problemRobbins' problemPoisson embedding

MSC classification

Secondary: 60G40: Stopping times; optimal stopping problems; gambling theory
Type
Research Article
Information
Journal of Applied Probability , Volume 46 , Issue 1 , March 2009 , pp. 1 - 18
Copyright
Copyright © Applied Probability Trust 2009 

Footnotes

Research supported in part by a mandate of charg- de recherches du F.R.S.-FNRS, Belgium.

References

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
Bruss, F. T. (2005). What is known about Robbins' problem? J. Appl. Prob. 42, 108–120.Google Scholar
Bruss, F. T. and Ferguson, T. S. (1993). Minimizing the expected rank with full information. J. Appl. Prob. 30, 616–626.Google Scholar
Bruss, F. T. and Ferguson, T. S. (1996). Half-prophets and Robbins' problem of minimizing the expected rank. In Athens Conf. Appl. Prob. Time Ser. Anal. (Lecture Notes Statist. 114), Vol. 1, Springer, New York, pp. 1–17.Google Scholar
Chow, Y. S., Moriguti, S., Robbins, H. and Samuels, S. M. (1964). Optimal selection based on relative ranks. Israel J. Math. 2, 81–90.CrossRefGoogle Scholar
Feller, W. (1950). An Introduction to Probability and its Applications, Vol. 1, 3rd edn. John Wiley, New York.Google Scholar
Gnedin, A. V. (2007). Optimal stopping with rank-dependent loss. J. Appl. Prob. 44, 996–1011.Google Scholar
Kühne, R. and Rüschendorf, L. (2000). Approximation of optimal stopping problems. Stoch. Process. Appl. 90, 301–325.CrossRefGoogle Scholar
Moser, L. (1956). On a problem of Cayley. Scripta Math. 22, 289–292.Google Scholar