Skip to Main content Skip to Navigation
Conference papers

Dynamic Threshold Strategy for Universal Best Choice Problem

Abstract : 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.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185565
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 4:32:01 PM
Last modification on : Tuesday, March 7, 2017 - 3:07:14 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:04:07 AM

File

dmAM0131.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185565, version 1

Collections

Citation

Jakub Kozik. Dynamic Threshold Strategy for Universal Best Choice Problem. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.439-452. ⟨hal-01185565⟩

Share

Metrics

Record views

89

Files downloads

696