| Issue |
ESAIM: PS
Volume 9, June 2005
|
|
|---|---|---|
| Page(s) | 277 - 282 | |
| DOI | https://doi.org/10.1051/ps:2005017 | |
| Published online | 15 November 2005 | |
A two armed bandit type problem revisited
Laboratoire de Probabilités et Modèles Aléatoires,
UMR 7599, Université Paris 6, case 188, 4,
place Jussieu, 75252 Paris Cedex 5, France; gpa@ccr.jussieu.fr
Received:
10
December
2004
Revised:
29
April
2005
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.
Mathematics Subject Classification: 91A20 / 91A12 / 60F99
Key words: Two-armed bandit problem / Kronecker lemma / learning theory / stochastic fictitious play.
© EDP Sciences, SMAI, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.