P. Auer, P. Nicoì-o-cesa-bianchi, and . Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

D. A. Berry, R. W. Chen, A. Zame, D. C. Heath, and L. A. Shepp, Bandit problems with infinitely many arms, The Annals of Statistics, vol.25, issue.5, pp.2103-2116, 1997.
DOI : 10.1214/aos/1069362389

O. Cappé, A. Garivier, O. Maillard, R. Munos, and G. Stoltz, Kullback???Leibler upper confidence bounds for optimal sequential allocation, The Annals of Statistics, vol.41, issue.3, 2013.
DOI : 10.1214/13-AOS1119SUPP

Y. Kung, C. Chen, and . Lin, A note on strategies for bandit problems with infinitely many arms, Metrika, vol.59, issue.2, pp.193-203, 2004.

Y. Kung, C. Chen, and . Lin, A note on infinite-armed bernoulli bandit problems with generalized beta prior distributions, Statistical Papers, vol.46, issue.1, pp.129-140, 2005.

J. Stephen, E. Herschkorn, . Pekoez, M. Sheldon, and . Ross, Policies without memory for the infinite-armed bernoulli bandit under the average-reward criterion, Probability in the Engineering and Informational Sciences, pp.21-28, 1996.

Y. Hung, Optimal Bayesian strategies for the infinite-armed Bernoulli bandit, Journal of Statistical Planning and Inference, vol.142, issue.1, pp.86-94, 2012.
DOI : 10.1016/j.jspi.2011.06.026

E. Kaufmann, N. Korda, and R. Munos, Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis, Algorithmic Learning Theory, pp.199-213, 2012.
DOI : 10.1007/978-3-642-34106-9_18
URL : https://hal.archives-ouvertes.fr/hal-00830033

L. Tze, H. Lai, and . Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.

C. Lin and C. Shiau, Some Optimal Strategies for Bandit Problems with Beta Prior Distributions, Annals of the Institute of Statistical Mathematics, vol.52, issue.2, pp.397-405, 2000.
DOI : 10.1023/A:1004130209258

C. Mallows and H. Robbins, Some problems of optimal sampling strategy, Journal of Mathematical Analysis and Applications, vol.8, issue.1, pp.90-103, 1964.
DOI : 10.1016/0022-247X(64)90087-3

O. Teytaud, S. Gelly, and M. Sebag, Anytime many-armed bandits, CAP07, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00173263

Y. Wang, J. Audibert, and R. Munos, Algorithms for infinitely many-armed bandits, NIPS, 2008.