Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T04:50:06.228Z Has data issue: false hasContentIssue false

OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

Published online by Cambridge University Press:  10 April 2019

Yi-Shen Lin
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei 115 Taiwan, R.O.C E-mail: yslin@stat.sinica.edu.tw
Shoou-Ren Hsiau
Affiliation:
Department of Mathematics, National Changhua University of Education, No. 1, Jin-De Rd., Changhua 500 Taiwan, R.O.C. E-mail: srhsiau@cc.ncue.edu.tw
Yi-Ching Yao
Affiliation:
Institute of Statistical Science, Academia Sinica, Taipei 115 Taiwan, R.O.C. E-mail: yao@stat.sinica.edu.tw
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of n candidates when their relative ranks are observed sequentially. This problem has been extended to optimally selecting the kth best candidate for k ≥ 2. While the optimal stopping rule for k=1,2 (and all n ≥ 2) is known to be of threshold type (involving one threshold), we solve the case k=3 (and all n ≥ 3) by deriving an explicit optimal stopping rule that involves two thresholds. We also prove several inequalities for p(k, n), the maximum probability of selecting the k-th best of n candidates. It is shown that (i) p(1, n) = p(n, n) > p(k, n) for 1<k<n, (ii) p(k, n) ≥ p(k, n + 1), (iii) p(k, n) ≥ p(k + 1, n + 1) and (iv) p(k, ∞): = lim n→∞p(k, n) is decreasing in k.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2019