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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem in its series Discussion Paper Series with number
dp502.