Answer to an open question concerning the $1/e$-strategy for best choice under no information
F. Thomas Bruss, L. C. G. Rogers

TL;DR
This paper investigates the $1/e$-strategy in the best choice problem with no information about total options, proving it is not optimal through precise distributional analysis of proportional-increment processes.
Contribution
It provides a rigorous analysis showing the $1/e$-strategy is suboptimal in the no-information setting, resolving a long-standing open question from 1983.
Findings
The $1/e$-strategy is not optimal under no information.
Proportional-increment processes are time-changed pure birth processes.
Precise distributional calculations support the main conclusion.
Abstract
This paper answers a long-standing open question concerning the -strategy for the problem of best choice. candidates for a job arrive at times independently uniformly distributed in . The interviewer knows how each candidate ranks relative to all others seen so far, and must immediately appoint or reject each candidate as they arrive. The aim is to choose the best overall. The strategy is to follow the rule: `Do nothing until time , then appoint the first candidate thereafter who is best so far (if any).' The question, first discussed with Larry Shepp in 1983, was to know whether the -strategy is optimal if one has `no information about the total number of options'. Quite what this might mean is open to various interpretations, but we shall take the proportional-increment process formulation of \cite{BY}. Such processes are shown to have a very rigid…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Auction Theory and Applications · Optimization and Packing Problems
