Abstract
We consider a version of the secretary problem in which each candidate has an identical twin. As in the classical secretary problem, the aim is to choose a top candidate, i.e., one of the best twins, with the highest possible probability. We find an optimal stopping rule for such a choice, the probability of success, and its asymptotic behavior. We use a novel technique that allows the problem to be solved exactly in linear time and obtain the asymptotic values by solving differential equations. Furthermore, the proposed technique may be used to study the variants of the same problem and in other optimal stopping problems.
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.
