Abstract
The classical secretary problem involves sequentially interviewing a pool of n applicants with the aim of hiring exactly the best one in the pool—nothing less is good enough. The optimal decision strategy is easy to describe and the probability of success is 1/e. In this paper, we consider a minor variant of this classical problem. We wish to pick not the best but the second-best (the best is going to Harvard). In this case, an explicit solution can be given both for the optimal strategy and the associated optimal success probability. As n goes to infinity, the probability of success tends to 1/4. Apparently, it is easier to pick the best than the second best.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
