[52] Y. Hsieh, F. Iutzeler, J. Malick, and P. Mertikopoulos. On the convergence of single-call stochastic extra-gradient methods. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), pages 6936-6946, 2019.
[53] A. Jadbabaie, A. Rakhlin, S. Shahrampour, and K. Sridharan. Online Optimization: Competing with Dynamic Comparators. In Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, pages 398-406, 2015.
[54] D. S. Kalhan, A. S. Bedi, A. Koppel, K. Rajawat, H. Hassani, A. K. Gupta, and A. Banerjee. Dynamic online learning via frank-wolfe algorithm. IEEE Trans. Signal Process., 69:932-947, 2021.
[55] T. Lykouris, V. Syrgkanis, and É. Tardos. Learning and efficiency in games with dynamic population. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 120-129. SIAM, 2016.
[56] O. Mangoubi and N. K. Vishnoi. Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization. In Proceedings of the Annual Symposium on Theory of Computing (STOC), pages 896-909. ACM, 2021.
[57] E. Mazumdar, L. J. Ratliff, and S. S. Sastry. On gradient-based learning in continuous games. SIAM J. Math. Data Sci., pages 103-131, 2020.
[58] I. Menache and A. E. Ozdaglar. Network Games: Theory, Models, and Dynamics. Synthesis Lectures on Communication Networks. Morgan & Claypool Publishers, 2011.
[59] P. Mertikopoulos and M. Staudigl. Equilibrium tracking and convergence in dynamic games. In 2021 60th IEEE Conference on Decision and Control (CDC), pages 930–935. IEEE, 2021.
[60] P. Mertikopoulos, C. H. Papadimitriou, and G. Piliouras. Cycles in adversarial regularized learning. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2703-2717. SIAM, 2018.
[61] P. Mertikopoulos, B. Lecouat, H. Zenati, C. Foo, V. Chandrasekhar, and G. Piliouras. Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile. In 7th International Conference on Learning Representations, ICLR. OpenReview.net, 2019.
[62] A. Mokhtari, S. Shahrampour, A. Jabbabaie, and A. Ribeiro. Online optimization in dynamic environments: Improved regret rates for strongly convex problems. In 55th IEEE Conference on Decision and Control, CDC 2016, pages 7195-7201. IEEE, 2016.
[63] H. Moulin and J.-P. Vial. Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon. International Journal of Game Theory, 7(3-4): 201-221, 1978.
[64] J. Nash. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36:48-49, 1950.
[65] A. Nemirovski. Prox-method with rate of convergence  $\mathrm{O}(1 / t)$  for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM Journal on Optimization, 15(1), 2004.
[66] M. Nouiehed, M. Sanjabi, T. Huang, J. D. Lee, and M. Razaviyayn. Solving a class of nonconvex min-max games using iterative first order methods. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), pages 14905-14916, 2019.
[67] C. H. Papadimitriou, G. Pierrakos, A. Psomas, and A. Rubinstein. On the complexity of dynamic mechanism design. Games and Economic Behavior, 134:399-427, 2022.
[68] G. Piliouras, R. Sim, and S. Skoulakis. Beyond time-average convergence: Near-optimal uncoupled online learning via clairvoyant multiplicative weights update. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2022.