THE D-CHOICE SECRETARY PROBLEM
Published Date: February 1, 1981
This paper discusses a generalized Secretary problem, where 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.
