| Abstract: | The probability of selecting the ath best out of n applicants in the secretary problem is evaluated by probabilistic arguments for monotone order k stopping rules. This leads to an explicit optimizing function for selecting (with payoffs) one of the k best applicants. This optimization problem can be solved directly both for a finite and for an unlimited number of applicants, yielding a variety of numerical results. Extensions are given for two choices with success if two applicants are selected from among the k best. |
