The Secretary Problem of Minimizing Expected Rank: A Simple Suboptimal Approach with Generalizations
The secretary problem for selecting one item so as to minimize its expected rank, based on observing the relative ranks only, is revisited. A simple suboptimal rule, which performs almost as well as the optimal rule, is given. The rule stops with the smallest i such that Ri <= ic/(n + 1 - i) for a given constant c, where Ri is the relative rank of the ith observation, and n is the total number of items. This rule has added flexibility. i) A curtailed version thereof can be used to select an item with a given probability P, P < 1. ii) The rule can be used to select two or more items. The problem of selecting a fixed proportion, a, 0 < a < 1, of n, is also treated. Numerical results are included to illustrate the findings.
Year of publication: |
2009-01
|
---|---|
Authors: | Krieger, Abba M. ; Samuel-Cahn, Ester |
Institutions: | Center for the Study of Rationality, Hebrew University of Jerusalem |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Generalized Bomber and Fighter Problems: Offline optimal allocation of a discrete asset
Krieger, Abba M., (2012)
-
The Noisy Secretary Problem and Some Results on Extreme Concomitant Variables
Krieger, Abba M., (2012)
-
A generalized secretary problem
Krieger, Abba M., (2014)
- More ...