Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-23T05:32:30.071Z Has data issue: false hasContentIssue false
  • English
  • Français

The secretary problem with an unknown number of candidates

Published online by Cambridge University Press:  14 July 2016

A. R. Abdel-hamid ,
J. A. Bather  and
G. B. Trustrum
A. R. Abdel-hamid*
Affiliation:
University of Sussex
J. A. Bather*
Affiliation:
University of Sussex
G. B. Trustrum*
Affiliation:
University of Sussex
*
∗Postal address: School of Mathematical and Physical Sciences, The University of Sussex, Falmer, Brighton BN1 9QH, U.K.
∗Postal address: School of Mathematical and Physical Sciences, The University of Sussex, Falmer, Brighton BN1 9QH, U.K.
∗Postal address: School of Mathematical and Physical Sciences, The University of Sussex, Falmer, Brighton BN1 9QH, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

When the number of candidates is unknown, the problem of selecting the best during a sequence of interviews has many reasonable solutions. A simple condition for admissibility is established and it is shown that the class of Bayes solutions obtained by treating the number of candidates as a random variable is by no means complete. On the other hand, there is a single improper prior distribution for which the extended Bayes solutions constitute the whole family of admissible procedures.

Keywords

SECRETARY PROBLEMMARRIAGE PROBLEMOPTIMAL STOPPINGADMISSIBILITYSTATISTICAL DECISION THEORY
Type
Research Papers
Information
Journal of Applied Probability , Volume 19 , Issue 3 , September 1982 , pp. 619 - 630
Copyright
Copyright © Applied Probability Trust 1982 

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) Optimal selection based on relative rank. Israel J. Math. 2, 81–90.CrossRefGoogle Scholar
Dynkin, E. B. (1963) The optimal choice of stopping moment for a Markov process. Dokl. Akad. Nauk SSSR 150, 238–240.Google Scholar
Ferguson, T. S. (1967) Mathematical Statistics: A Decision Theoretic Approach. Academic Press, New York.Google Scholar
Gilbert, J. and Mosteller, F. (1966) Recognising the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.CrossRefGoogle Scholar
Lecam, L. (1955) An extension of Wald's theory of statistical decision functions. Ann. Math. Statist. 26, 69–81.CrossRefGoogle Scholar
Lindley, D. V. (1961) Dynamic programming and decision theory. Appl. Statist. 10, 39–52.CrossRefGoogle Scholar
Presman, E. L. and Sonin, I. M. (1972) The best choice problem for a random number of objects. Theory Prob. Appl. 17, 657–668.Google Scholar