Geodesic
Dynamic Threshold Strategy for Universal Best Choice Problem
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2010_special_258_a3,
     author = {Kozik, Jakub},
     title = {Dynamic {Threshold} {Strategy} for {Universal} {Best} {Choice} {Problem}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2767},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2767/}
}
TY  - JOUR
AU  - Kozik, Jakub
TI  - Dynamic Threshold Strategy for Universal Best Choice Problem
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2767/
DO  - 10.46298/dmtcs.2767
LA  - en
ID  - DMTCS_2010_special_258_a3
ER  - 
%0 Journal Article
%A Kozik, Jakub
%T Dynamic Threshold Strategy for Universal Best Choice Problem
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2767/
%R 10.46298/dmtcs.2767
%G en
%F DMTCS_2010_special_258_a3
Kozik, Jakub. Dynamic Threshold Strategy for Universal Best Choice Problem. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2767. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2767/

Cité par Sources :