1. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning Journal 47, 235–256 (2002)
2. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The non-stochastic multi-armed bandit problem. SIAM Journal on Computing 32(1), 48–77 (2002)
3. Bubeck, S., Munos, R., Stoltz, G.: Pure exploration for multi-armed bandit problems. Technical report, HAL report hal-00257454 (2009),
http://hal.archives-ouvertes.fr/hal-00257454/en
4. Bubeck, S., Munos, R., Stoltz, G., Szepesvari, C.: Online optimization in
$\mathcal{X}$
–armed bandits. In: Advances in Neural Information Processing Systems, vol. 21 (2009)
5. Coquelin, P.-A., Munos, R.: Bandit algorithms for tree search. In: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (2007)