[17] Yoav Freund and Robert E Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29(1-2):79-103, 1999.
[18] Gauthier Gidel, Tony Jebara, and Simon Lacoste-Julien. Frank-wolfe algorithms for saddle point problems. In Artificial Intelligence and Statistics, pages 362-371. PMLR, 2017.
[19] Andrew Gilpin, Javier Peña, and Thomas Sandholm. First-order algorithm with  $o(\ln(1/\varepsilon))$  convergence for  $\varepsilon$ -equilibrium in two-person zero-sum games. In Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI'08, pages 75-82, 2008.
[20] Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, and Asuman Ozdaglar. Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems, 2020.
[21] Sergiu Hart and Noam Nisan. The query complexity of correlated equilibria. Games and Economic Behavior, 108:401-410, 2018.
[22] Elad Hazan and Tomer Koren. The computational power of optimization in online learning. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 128-141, 2016.
[23] Yu-Guan Hsieh, Kimon Antonakopoulos, and P. Mertikopoulos. Adaptive learning in continuous games: Optimal regret bounds and convergence to Nash equilibrium. In Annual Conference Computational Learning Theory, 2021.
[24] Adam Ibrahim, Waiss Azizian, Gauthier Gidel, and Ioannis Mitliagkas. Linear lower bounds and conditioning of differentiable games. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, volume 119, pages 4583-4593. PMLR, 2020.
[25] Albert Xin Jiang and Kevin Leyton-Brown. Polynomial-time computation of exact correlated equilibrium in compact games. In Proceedings of the 12th ACM conference on Electronic commerce, pages 119-126, 2011.
[26] Galina M Korpelevich. The extragradient method for finding saddle points and other problems. Matecon, 12:747-756, 1976.
[27] Tianyi Lin, Chi Jin, and Michael I. Jordan. Near-optimal algorithms for minimax optimization. In Annual Conference Computational Learning Theory, 2020.
[28] Aryan Mokhtari, Asuman E Ozdaglar, and Sarath Pattathil. Convergence rate of  $\mathrm{o}(1 / \mathrm{k})$  for optimistic gradient and extragradient methods in smooth convex-concave saddle point problems. SIAM Journal on Optimization, 30(4):3230-3251, 2020.
[29] Arkadi S Nemirovsky. On optimality of Krylov's information when solving linear operator equations. Journal of Complexity, 7(2):121-130, 1991.
[30] Arkadi S Nemirovsky. Information-based complexity of linear operator equations. Journal of Complexity, 8(2):153-175, 1992.
[31] Yurii Nesterov. Introductory lectures on convex optimization - a basic course. In Applied Optimization, 2014.
[32] Francesco Orabona and David Pál. Scale-free online learning. Theoretical Computer Science, 716:50-69, 2018. Special Issue on ALT 2015.
[33] Yuyuan Ouyang and Yangyang Xu. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Mathematical Programming, 185(1):1-35, 2021.
[34] Christos H Papadimitriou and Tim Roughgarden. Computing correlated equilibria in multiplayer games. Journal of the ACM (JACM), 55(3):1-29, 2008.
[35] Georgios Piliouras, Ryann Sim, and Stratis Skoulakis. Beyond time-average convergence: Near-optimal uncoupled online learning via clairvoyant multiplicative weights update. Advances in Neural Information Processing Systems, 35:22258-22269, 2022.