TY - JOUR
T1 - Approximate results for a generalized secretary problem
AU - Dietz, C.
AU - van der Laan, D.A.
AU - Ridder, A.A.N.
PY - 2011
Y1 - 2011
N2 - A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. © 2011 Cambridge University Press.
AB - A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. © 2011 Cambridge University Press.
UR - https://www.scopus.com/pages/publications/82455219265
UR - https://www.scopus.com/inward/citedby.url?scp=82455219265&partnerID=8YFLogxK
U2 - 10.1017/S026996481000032X
DO - 10.1017/S026996481000032X
M3 - Article
SN - 0269-9648
VL - 25
SP - 157
EP - 169
JO - Probability in the Engineering and Informational Sciences
JF - Probability in the Engineering and Informational Sciences
IS - 2
ER -
