Catalog Home Page

Selecting satisfactory secretaries

Yeo, A.J. and Yeo, G.F. (2008) Selecting satisfactory secretaries. Australian Journal of Statistics, 36 (2). pp. 185-198.

Link to Published Version:
*Subscription may be required


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.

Item Type: Journal Article
Publisher: Blackwell Publishing Inc
Item Control Page Item Control Page