Journal article
Selecting satisfactory secretaries
Australian Journal of Statistics, Vol.36(2), pp.185-198
2008
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.
Details
- Title
- Selecting satisfactory secretaries
- Authors/Creators
- A.J. Yeo (Author/Creator) - Odense UniversityG.F. Yeo (Author/Creator) - Odense University
- Publication Details
- Australian Journal of Statistics, Vol.36(2), pp.185-198
- Publisher
- Blackwell Publishing Inc
- Identifiers
- 991005540846907891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
58 Record Views