M. Bowling, Heads-up limit hold'em poker is solved, Science, vol.347, issue.6218, 2015.
DOI : 10.1126/science.1259433

N. Brown, S. Ganzfried, and T. Sandholm, Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent, 2015.

A. Chambolle and T. Pock, On the ergodic convergence rates of a first-order primal???dual algorithm, Mathematical Programming, vol.38, issue.3, 2015.
DOI : 10.1007/s10107-015-0957-3
URL : https://hal.archives-ouvertes.fr/hal-01151629

A. Gilpin, J. Peña, T. Sandholm, and . English, First-order algorithm with O(ln(1//)) convergence for -equilibrium in two-person zero-sum games, In: Math. Program, vol.133, 2012.

A. Gilpin and T. Sandholm, Lossless abstraction of imperfect information games, Journal of the ACM, vol.54, issue.5, 2007.
DOI : 10.1145/1284320.1284324

Y. He and R. D. Monteiro, Accelerating block-decomposition first-order methods for solving generalized saddle-point and Nash equilibrium problems, pp.Optimization-online preprint, 2013.

S. Hoda, Smoothing Techniques for Computing Nash Equilibria of Sequential Games, Mathematics of Operations Research, vol.35, issue.2, p.35, 2010.
DOI : 10.1287/moor.1100.0452

D. Koller and N. Megiddo, The complexity of two-person zero-sum games in extensive form, Games and Economic Behavior, vol.4, issue.4, 1992.
DOI : 10.1016/0899-8256(92)90035-Q

D. Koller, N. Megiddo, and B. V. Stengel, Fast algorithms for finding randomized strategies in game trees, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, 1994.
DOI : 10.1145/195058.195451

C. Kroer, Faster First-Order Methods for Extensive-Form Game Solving, Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15
DOI : 10.1145/2764468.2764476

H. W. Kuhn, 9. A SIMPLIFIED TWO-PERSON POKER, Annals of Math, 1950.
DOI : 10.1515/9781400881727-010
URL : https://hal.archives-ouvertes.fr/in2p3-00011574

M. Lanctot, Monte Carlo sampling for regret minimization in extensive games, 2009.

Y. Nesterov, Excessive Gap Technique in Nonsmooth Convex Minimization, SIAM Journal on Optimization, vol.16, issue.1, 2005.
DOI : 10.1137/S1052623403422285

Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming, vol.269, issue.1, 2005.
DOI : 10.1007/s10107-004-0552-5

B. O. Donoghue and E. Candes, Adaptive restart for accelerated gradient schemes, In: FOUND COMPUT MATH, vol.15, 2013.

T. Sandholm, Abstraction for solving large incomplete-information games, 2015.

O. Tammelin, Solving Large Imperfect Information Games Using CFR+, p.5042, 1407.

M. Zinkevich, Regret minimization in games with incomplete information, p.NIPS, 2008.