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.

• Type: Journal
• Year: 2008
• Where: RSA
• Authors: Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec
• Keywords: Lower Bound, Partially Ordered Sets, RSA 2008, Unknown Order