Author:
Bruss F. Thomas,Ferguson Thomas S.
Abstract
The full-information secretary problem in which the objective is to minimize the expected rank is seen to have a value smaller than 7/3 for all n (the number of options). This can be achieved by a simple memoryless threshold rule. The asymptotically optimal value for the class of such rules is about 2.3266. For a large finite number of options, the optimal stopping rule depends on the whole sequence of observations and seems to be intractable. This raises the question whether the influence of the history of all observations may asymptotically fade. We have not solved this problem, but we show that the values for finite n are non-decreasing in n and exhibit a sequence of lower bounds that converges to the asymptotic value which is not smaller than 1.908.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference6 articles.
1. Assaf D. and Samuel-Cahn E. (1991) The secretary problem: minimizing the expected rank with i.i.d. random variables.
2. On a problem of Cayley;Moser;Scripta Math,1956
3. Limit theorems for threshold-stopped random variables with applications to optimal stopping
4. Dynamic Programming and Decision Theory
5. Recognizing the Maximum of a Sequence
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献