Recognizing the maximum of a random sequence based on relative rank with backward solicitation
- 1 September 1974
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 11 (03) , 504-512
- https://doi.org/10.1017/s0021900200096285
Abstract
The classical secretary problem is generalized to admit stochastically successful procurement of previous interviewees, but each has a certain probability of refusing the offer. A general formula for solving this problem is obtained. Two special cases: constant probability of refusing and geometric probability of refusing are discussed in detail. The optimal stopping rules in these two cases turn out to be simple.Keywords
This publication has 5 references indexed in Scilit:
- Differential Equations and Optimal Choice ProblemsThe Annals of Statistics, 1973
- Recognizing the Maximum of a SequenceJournal of the American Statistical Association, 1966
- The Problem of Choice and the Sptimal Stopping Rule for a Sequence of Independent TrialsTheory of Probability and Its Applications, 1966
- Optimal selection based on relative rank (the “secretary problem”)Israel Journal of Mathematics, 1964
- Dynamic Programming and Decision TheoryJournal of the Royal Statistical Society Series C: Applied Statistics, 1961