On a universal best choice algorithm for partially ordered sets
暂无分享,去创建一个
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lower bound of its chance of success from the hitherto known constant 1/8 to 1/4. We also show that this result is the best possible for this algorithm, i.e., the 1/4 bound cannot be further improved.
[1] J. Preater. The best-choice problem for partially ordered objects , 1999, Oper. Res. Lett..
[2] Michal Morayne. Partial-order analogue of the secretary problem the binary tree case , 1998, Discret. Math..
[3] David Lindley,et al. Dynamic Programming and Decision Theory , 1961 .
[4] Wolfgang Stadje,et al. Efficient stopping of a random series of partially ordered points , 1980 .
[5] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .