Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T15:28:20.332Z Has data issue: false hasContentIssue false
  • English
  • Français

A secretary problem with uncertain employment

Published online by Cambridge University Press:  14 July 2016

M. H. Smith
M. H. Smith*
Affiliation:
University of Canterbury, Christchurch, New Zealand
Get access Rights & Permissions [Opens in a new window]

Abstract

A ‘Secretary Problem’ with no recall but which allows the applicant to refuse an offer of employment with a fixed probability 1 – p, (0 < p < 1), is considered. The optimal stopping rule and the maximum probability of employing the best applicant are derived.

Keywords

SEQUENTIAL DECISION THEORYOPTIMAL STOPPING RULESSECRETARY PROBLEMS
Type
Short Communications
Information
Journal of Applied Probability , Volume 12 , Issue 3 , September 1975 , pp. 620 - 624
Copyright
Copyright © Applied Probability Trust 1975 

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, 81–90.Google Scholar
Fox, J. H. and Marnie, L. G. (1960) In Martin Gardner's column: Mathematical games. Scientific American 202 No. 2, 150 and 153.Google Scholar
Gilbert, J. P. and Mosteller, F. (1966) Recognising the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.Google Scholar
Gusein-Zade, S. M. (1966) The problem of choice and the optimal stopping rule for a sequence of independent trials. Theor. Probability Appl. 11, 472–476.CrossRefGoogle Scholar
Lindley, D. V. (1961) Dynamic programming and decision theory. Appl. Statist. 10, 39–51.Google Scholar
Mucci, A. G. (1973a) Differential equations and optimal choice problems. Ann. Statist. 1, 104–113.Google Scholar
Mucci, A. G. (1973b) On a class of Secretary Problems. Ann. Prob. 1, 417–427.CrossRefGoogle Scholar
Yang, M. C. K. (1974) Recognising the maximum of a random sequence based on relative rank with backward solicitation. J. Appl. Prob. 11, 504–512.Google Scholar