Voir la notice de l'article provenant de la source Numdam
In Benaïm and Ben Arous (2003) is solved a multi-armed bandit problem arising in the theory of learning in games. We propose a short and elementary proof of this result based on a variant of the Kronecker lemma.
@article{PS_2005__9__277_0, author = {Pag\`es, Gilles}, title = {A two armed bandit type problem revisited}, journal = {ESAIM: Probability and Statistics}, pages = {277--282}, publisher = {EDP-Sciences}, volume = {9}, year = {2005}, doi = {10.1051/ps:2005017}, mrnumber = {2174870}, zbl = {1136.91327}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.1051/ps:2005017/} }
Pagès, Gilles. A two armed bandit type problem revisited. ESAIM: Probability and Statistics, Tome 9 (2005), pp. 277-282. doi : 10.1051/ps:2005017. http://geodesic.mathdoc.fr/articles/10.1051/ps:2005017/
[1] Dynamics of stochastic algorithms, in Séminaire de probabilités XXXIII, J. Azéma et al. Eds., Springer-Verlag, Berlin. Lect. Notes Math. 1708 (1999) 1-68. | Zbl | mathdoc-id
,[2] A two armed bandit type problem. Game Theory 32 (2003) 3-16. | Zbl
and ,Cité par Sources :