OPTIMAL SELECTION of the k-TH BEST CANDIDATE

Yi Shen Lin, Shoou Ren Hsiau, Yi Ching Yao

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)327-347
Number of pages21
JournalProbability in the Engineering and Informational Sciences
Volume33
Issue number3
DOIs
Publication statusPublished - 2019 Jul 1

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this