Two measures of efficiency for the secretary problem with multiple items at each rank

Abstract

Listen

Translate article

For 2≤k∈N, consider the following adaptation of the classical secretary problem. There are k items at each of n linearly ordered ranks. The kn items are revealed, one item at a time, in a uniformly random order, to an observer whose objective is to select an item of highest rank. At each stage the observer only knows the relative ranks of the items that have arrived thus far, and must either select the current item, in which case the process terminates, or reject it and continue to the next item. For M∈{0,1,⋯,kn−1}, let S(n,k;M) denote the strategy whereby one allows the first M items to pass, and then selects the first later arriving item whose rank is either equal to or greater than the highest rank of the first M items (if such an item exists). Let WS(n,k;M) denote the event that one selects an item of highest rank using strategy S(n,k;M) and let Pn,k(WS(n,k;M)) denote the corresponding probability. We obtain a formula for Pn,k(WS(n,k;M)), and for limn→∞⁡Pn,k(WS(n,k;Mn)), when Mn∼ckn, with c∈(0,1). In the classical secretary problem (k=1), the asymptotic probability of success using an optimal strategy is 1e≈0.368. For k=2, the asymptotic probability of success using an optimal strategy from the above class is about 0.701. For k=7, that probability already exceeds 0.99. In the problem with multiple items at each rank, there is an additional measure of efficiency of a strategy besides the probability of selecting an item of highest rank; namely how quickly one selects an item of highest rank. We give a rather complete picture of this efficiency.