Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-23T05:40:03.359Z Has data issue: false hasContentIssue false

Recognizing the maximum of a random sequence based on relative rank with backward solicitation

Published online by Cambridge University Press:  14 July 2016

Mark C. K. Yang*
Affiliation:
University of Florida, Gainesville

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.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1974 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Chow, Y. S., Moriguti, S., Robbins, H. and Samuels, S. M. (1964) Optimum selection based on relative rank (the ‘Secretary Problem’). Israel J. Math. 2, 8190.CrossRefGoogle Scholar
Gilbert, J. P. and Mosteller, F. (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 3573.Google Scholar
Gusein-Zade, S. M. (1966) The problem of choice and optimum stopping rule for a sequence of independent trials. Theor. Probability Appl. 11, 472476.Google Scholar
Lindley, D. V. (1961) Dynamic programming and decision theory. Appl. Statist. 10, 3951.Google Scholar
Mucci, A. G. (1973) Differential equations and optimal choice problems Ann. Statist. 1, 104113.CrossRefGoogle Scholar