Hostname: page-component-cb9f654ff-rkzlw Total loading time: 0 Render date: 2025-08-23T07:20:13.418Z Has data issue: false hasContentIssue false
  • English
  • Français

A secretary problem with backward solicitation and uncertain employment

Published online by Cambridge University Press:  14 July 2016

K. I. Choe  and
D. S. Bai
K. I. Choe*
Affiliation:
Ulsan Institute of Technology
D. S. Bai*
Affiliation:
Korea Advanced Institute of Science and Technology
*
∗ Postal Address: Department of Industrial Engineering, Ulsan Institute of Technology, Ulsan, Kyungnam, Korea.
∗∗ Postal Address: Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, P.O. Box 150, Chongyangni, Seoul, Korea.
Get access Rights & Permissions [Opens in a new window]

Abstract

A secretary problem which allows the applicant to refuse an offer of employment with a fixed probability and admits backward solicitations of previous interviewees with known probability of successful solicitation is considered. The optimal strategy that maximizes the probability of employing the best applicant is derived. Two types of probability of successful solicitation, constant and geometric, are discussed in detail.

Keywords

OPTIMAL STOPPINGRELATIVE RANKS

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 20 , Issue 4 , December 1983 , pp. 891 - 896
Copyright
Copyright © Applied Probability Trust 1983 

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

Footnotes

Work done while this author was at Korea Advanced Institute of Science and Technology.

An earlier draft of the paper was presented at the Annual Meeting of the Korean Statistical Society held in Taegu, Korea, on May 16–17, 1981.

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.CrossRefGoogle Scholar
Gilbert, J. P. and Mosteller, F. (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.CrossRefGoogle Scholar
Lorenzen, T. J. (1981) Optimal stopping with sampling cost; the secretary problem. Ann. Prob. 9, 167–172.CrossRefGoogle Scholar
Smith, M. H. (1975) A secretary problem with uncertain employment. J. Appl. Prob. 12, 620–624.CrossRefGoogle Scholar
Yang, M. C. K. (1974) Recognizing the maximum of a random sequence based on relative rank with backward solicitation. J. Appl. Prob. 11, 504–512.CrossRefGoogle Scholar