机构:
Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, EnglandUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Garrod, Bryn
[1
]
Kubicki, Grzegorz
论文数: 0引用数: 0
h-index: 0
机构:
Univ Louisville, Dept Math, Louisville, KY 40292 USAUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Kubicki, Grzegorz
[2
]
Morayne, Michal
论文数: 0引用数: 0
h-index: 0
机构:
Univ Louisville, Dept Math, Louisville, KY 40292 USA
Wroclaw Univ Technol, Inst Math & Comp Sci, PL-50370 Wroclaw, PolandUniv Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
Morayne, Michal
[2
,3
]
机构:
[1] Univ Cambridge, Dept Pure Math & Math Stat, Ctr Math Sci, Cambridge CB3 0WB, England
[2] Univ Louisville, Dept Math, Louisville, KY 40292 USA
secretary problem;
best choice;
partial order;
BEST-CHOICE PROBLEM;
D O I:
10.1137/09076845X
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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.
机构:
Cardiovasc Associates Amer, Celebration, FL USA
Massachusetts Gen Hosp, Boston, MA USA
Harvard Med Sch, Boston, MA USACardiovasc Associates Amer, Celebration, FL USA
Blumenthal, Daniel M.
Jellinek, Mike
论文数: 0引用数: 0
h-index: 0
机构:
Massachusetts Gen Hosp, Boston, MA USA
Harvard Med Sch, Boston, MA USACardiovasc Associates Amer, Celebration, FL USA