How to Choose the Best Twins

We consider a version of the secretary problem where each candidate has an identical twin. The aim, as in the classical problem, is to choose with the largest possible probability a top candidate, i.e., one of the best twins. We find an optimal stopping time for such a choice, the probability of success the optimal stopping time yields, and their asymptotic behavior.