Hostname: page-component-5b777bbd6c-f9nfp Total loading time: 0 Render date: 2025-06-21T04:38:27.039Z Has data issue: false hasContentIssue false
  • English
  • Français

Best-choice problems involving uncertainty of selection and recall of observations

Published online by Cambridge University Press:  14 July 2016

Joseph D. Petruccelli
Joseph D. Petruccelli*
Affiliation:
Worcester Polytechnic Institute
*
∗Postal address: Department of Mathematical Sciences, Worcester Polytechnic Institute, Worcester, MA 01609, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper explores best choice problems which allow both recall of applicants and uncertainty of a current applicant accepting an offer of employment. Properties of optimal selection procedures are derived for the general case. Optimal procedures and the associated probabilities of obtaining the best applicant are found in two special cases. The results unify and extend those of Yang (1974) and Smith (1975).

Keywords

OPTIMAL STOPPINGSECRETARY PROBLEMRELATIVE RANKS
Type
Research Papers
Information
Journal of Applied Probability , Volume 18 , Issue 2 , June 1981 , pp. 415 - 425
Copyright
Copyright © Applied Probability Trust 

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.)

Article purchase

Temporarily unavailable

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
Dwass, M. (1964) Extremal processes. Ann. Math. Statist. 35, 381–391.Google Scholar
Gilbert, J. P. and Mosteller, F. (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.Google Scholar
Karni, E. and Schwartz, A. (1977) Two theorems on optimal stopping with backward solicitation. J. Appl. Prob. 14, 869–875.Google Scholar
Samuels, S. M. (1981) Minimax stopping rules when the underlying distribution is uniform. J. Amer. Statist. Assoc. 76.Google Scholar
Smith, M. H. (1975) A secretary problem with uncertain employment. J. Appl. Prob. 12, 620–624.Google Scholar
Smith, M. H. and Deely, J. J. (1975) A secretary problem with finite memory. J. Amer. Statist. Assoc. 70, 357–361.Google Scholar
Yang, M. C. K. (1974) Recognizing the maximum of a sequence based on relative rank with backward solicitation. J. Appl. Prob. 11, 504–512.Google Scholar