Dynamic Threshold Strategy for Universal Best Choice Problem
Jakub Kozik · Discrete Mathematics & Theoretical Computer Science · 2010
We propose a new strategy for universal best choice problem for partially ordered sets. We present its partial analysis which is sufficient to prove that the probability of success with this strategy is asymptotically strictly greater than 1/4, which is the value of the best universal strategy known so far.