A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Threshold Strategy for Universal Best Choice Problem
2010
Discrete Mathematics & Theoretical Computer Science
International audience 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.
doi:10.46298/dmtcs.2767
fatcat:k3qbvlwcgbe6zn2xkfvyhas3ki