OPTIMAL SELECTION of the k-TH BEST CANDIDATE

Yi Shen Lin, Shoou Ren Hsiau, Yi Ching Yao

研究成果: Article

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)327-347
頁數21
期刊Probability in the Engineering and Informational Sciences
33
發行號3
DOIs
出版狀態Published - 2019 七月 1

All Science Journal Classification (ASJC) codes

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

指紋 深入研究「OPTIMAL SELECTION of the k-TH BEST CANDIDATE」主題。共同形成了獨特的指紋。

  • 引用此