Summary
Let X 1, X 2,…X n be i.i.d. random variables with a known continuous distribution function. Robbins’ problem is to find a sequential stopping rule without recall which minimizes the expected rank of the selected observation. An upper bound (obtained by memoryless threshold rules) and a procedure to obtain lower bounds of the value are known, but the difficulty is that the optimal strategy depends for all n > 2 in an intractable way on the whole history of preceding observations. The goal of this article is to understand better the structure of both optimal memoryless threshold rules and the (overall) optimal rule. We prove that the optimal rule is a “stepwise” monotone increasing threshold-function rule and then study its property of, what we call, full history-dependence. For each n, we describe a tractable statistic of preceding observations which is sufficient for optimal decisions of decision makers with half-prophetical abilities who can do generally better than we. It is shown that their advice can always be used to improve strictly on memoryless rules, and we determine such an improved rule for all n sufficiently large. We do not know, however, whether one can construct, as n → ∞ asymptotically relevant improvements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Assaf D. & E. Samuel-Cahn. (1992) The secretary problem: minimizing the expected rank with full information. Preprint, The Hebrew University of Jerusalem.
Bruss, F. Thomas & Thomas S. Ferguson (1993) Minimizing the expected rank with full information. J. Appl. Prob., Vol. 30, pp 616–626.
Chow, Y.S., S. Moriguti, H. Robbins & S.M. Samuels (1964) Optimal selection based on relative ranks Israel Journal of Mathematics, Vol. 2, pp 81–90.
Gnedin, A.V. (1995) personal communication.
Kennedy, D.P. & R.P. Kertz (1990) Limit Theorems for threshold-stopped random variables with applications to optimal stopping. Adv. Appl. Prob., Vol. 22, pp 396–411.
Rényi, A. (1962) Théorie des éléments saillants d’une suite d’observations. Proc. Colloq. Comb. Meth. in Prob. Theory (Aarhus Univ.), pp 104–115.
Robbins, H. (1990) personal communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this paper
Cite this paper
Bruss, F.T., Ferguson, T.S. (1996). Half-Prophets and Robbins’ Problem of Minimizing the Expected Rank. In: Heyde, C.C., Prohorov, Y.V., Pyke, R., Rachev, S.T. (eds) Athens Conference on Applied Probability and Time Series Analysis. Lecture Notes in Statistics, vol 114. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0749-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0749-8_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94788-4
Online ISBN: 978-1-4612-0749-8
eBook Packages: Springer Book Archive