A SECRETARY PROBLEM WITH A RANDOM NUMBER OF CHOICES
Published Date: June 1, 1979
In this paper, the best-choice Secretary Problem is modified to allow the player to make more than one choice. The probability of selecting the best object is computed. The optimal starting time is characterized, and expressions are derived for the expected number of objects chosen and the expected number of objects sampled by this procedure. Asymptotic results are also derived.
