J. Audibert and S. Bubeck, Minimax policies for adversarial and stochastic bandits, 22th annual conference on learning theory, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00834882

P. Auer, Y. Nicoì-o-cesa-bianchi, R. E. Freund, and . 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

J. Brenner and L. Cummings, The Hadamard Maximum Determinant Problem, The American Mathematical Monthly, vol.79, issue.6, pp.626-630, 1972.
DOI : 10.2307/2317092

S. Bubeck-andnicoì-o-cesa-bianchi, Regret analysis of stochastic and nonstochastic multi-armed bandit problems, Machine Learning, pp.1-122, 2012.

C. Chou, P. Chou, C. Lee, D. Lupien-saint-pierre, O. Teytaud et al., Strategic Choices: Small Budgets and Simple Regret, 2012 Conference on Technologies and Applications of Artificial Intelligence, p.6, 2012.
DOI : 10.1109/TAAI.2012.35
URL : https://hal.archives-ouvertes.fr/hal-00753145

G. Dantzig and M. Thapa, Linear Programming 2: Theory and Extensions, 2003.

M. Fey, R. D. Mckelvey, and T. R. Palfrey, An experimental study of constant-sum centipede games, International Journal of Game Theory, vol.57, issue.2, pp.269-287, 1996.
DOI : 10.1007/BF02425258

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

K. Gale and T. , Linear programming and the theory of games Activity Analysis of Production and Allocation, chapter XII, Koopmans, editor, 1951.

D. Michael, L. G. Grigoriadis, and . Khachiyan, A sublinear-time randomized approximation algorithm for matrix games, Operations Research Letters, vol.18, issue.2, pp.53-58, 1995.

J. Hadamard, Résolution d'une question relative aux déterminants, Bull. Sci. Math, vol.17, pp.240-246, 1893.

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

T. L. 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

J. Theodore, I. Lambert, M. A. Epelman, and R. L. Smith, A fictitious play approach to large-scale optimization, Oper. Res, vol.53, issue.3, pp.477-489, 2005.

R. Rosenthal, Games of perfect information, predatory pricing and the chain-store paradox, Journal of Economic Theory, vol.25, issue.1, pp.92-100, 1981.
DOI : 10.1016/0022-0531(81)90018-1