Best choice;
Optimal stopping time;
Secretary problem;
D O I:
10.1080/03610926.2011.654040
中图分类号:
O21 [概率论与数理统计];
C8 [统计学];
学科分类号:
020208 ;
070103 ;
0714 ;
摘要:
We consider a secretary type problem where an administrator who has only one on-line choice in m consecutive searches has to choose the best candidate in one of them.