Dynamic Threshold Strategy for Universal Best Choice Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2010

Dynamic Threshold Strategy for Universal Best Choice Problem

Résumé

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.
Fichier principal
Vignette du fichier
dmAM0131.pdf (295.39 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01185565 , version 1 (20-08-2015)

Identifiants

Citer

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, ⟨10.46298/dmtcs.2767⟩. ⟨hal-01185565⟩

Collections

TDS-MACS
50 Consultations
641 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More