THE CANDIDATE PROBLEM WITH UNKNOWN POPULATION SIZE
暂无分享,去创建一个
The familiar problem of maximizing the probability of choosing the best from a group of N candidates, where N is known, is extended to the case of N unknown. An a priori distribution is assumed for N, and the case of a uniform distribution is examined. Let VN denote the probability of choosing the best from a group of at most N candidates, then it is shown that lim VN = 2e-2
[1] S. M. Samuels,et al. Optimal selection based on relative rank (the “secretary problem”) , 1964 .
[2] David Siegmund,et al. Great expectations: The theory of optimal stopping , 1971 .
[3] W. T. Rasmussen. A generalized choice problem , 1975 .
[4] F. Mosteller,et al. Recognizing the Maximum of a Sequence , 1966 .