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 suc...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on discrete mathematics 2012-01, Vol.26 (1), p.384-398
Main Authors: Garrod, Bryn, Kubicki, Grzegorz, Morayne, Michał
Format: Article
Language:English
Subjects:
Applied mathematics
Random variables
Success
Twins
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0895-4801
1095-7146
DOI:10.1137/09076845X