The d choice secretary problem
Kenneth S. Glasser, Richard Holzsager Austin Barron · Sequential Analysis · 1983
In the classical Secretary Problem, the player tries to choose the best object of a sequentially ordered set of size N. The value of each object is given by its rank only. At any stage, the player knows the rank of the current object relative to those already seen. Once rejected, an object cannot be chosen later. In this paper, a generalized Secretary Problem is discussed. The player is given d choices to choose all of the d best objects. The optimal procedure is found by converting the d choice Secretary Problem into a "walk" in a two-dimensional grid. A'simple approximation to the optimal strategy rule is also presented.