S. Bubeck, R. Munos, and G. Stoltz, Pure Exploration in Multi-armed Bandits Problems, ALT, pp.23-37, 2009.
DOI : 10.1090/S0002-9904-1952-09620-8

A. Bourki, M. Coulm, P. Rolet, O. Teytaud, and P. Vayssì-ere, Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing, ICINCO2010, p.10, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00467796

T. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.
DOI : 10.1016/0196-8858(85)90002-8
URL : http://doi.org/10.1016/0196-8858(85)90002-8

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite time analysis of the multiarmed bandit problem, Machine Learning, pp.235-256, 2002.

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.322-331, 1995.
DOI : 10.1109/SFCS.1995.492488

V. Mnih, C. Szepesvári, and J. Audibert, Empirical Bernstein stopping, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.672-679, 2008.
DOI : 10.1145/1390156.1390241
URL : https://hal.archives-ouvertes.fr/hal-00834983

J. Audibert and S. Bubeck, Best Arm Identification in Multi-Armed Bandits, COLT 2010 -Proceedings, p.13, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00654404

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, 15th European Conference on Machine Learning (ECML), pp.282-293, 2006.
DOI : 10.1007/11871842_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296

S. Flory and O. Teytaud, Upper confidence trees with short term partial information, Procedings of EvoGames, p.p. accepted, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00585475

D. Auger, S. Ruette, and O. Teytaud, Sparse bandit algorithms, 2012.

B. Bouzy and M. Métivier, Multi-agent learning experiments on repeated matrix games, pp.119-126, 2010.

D. Auger, C. D. Chio, S. Cagnoni, C. Cotta, M. Ebner et al., Multiple Tree for Partially Observable Monte-Carlo Tree Search, EvoApplications (1), ser. Lecture Notes in Computer Science, pp.53-62, 2011.
DOI : 10.1007/978-3-642-20525-5_6
URL : https://hal.archives-ouvertes.fr/hal-00563480