[69] J. I. Poveda, M. Krstic, and T. Basar. Fixed-time seeking and tracking of time-varying nash equilibria in noncooperative games. In American Control Conference, ACC 2022, Atlanta, GA, USA, June 8-10, 2022, pages 794-799. IEEE, 2022.
[70] J. Rahme, S. Jelassi, and S. M. Weinberg. Auction learning as a two-player game. In 9th International Conference on Learning Representations, ICLR, 2021.
[71] A. A. Raja and S. Grammatico. Payoff distribution in robust coalitional games on time-varying networks. IEEE Trans. Control. Netw. Syst., 9(1):511-520, 2022.
[72] A. Rakhlin and K. Sridharan. Optimization, learning, and games with predictable sequences. In Advances in Neural Information Processing Systems, pages 3066-3074, 2013.
[73] A. Rubinstein. Settling the complexity of computing approximate two-player nash equilibria. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pages 258-265. IEEE Computer Society, 2016.
[74] Y. Sato, E. Akiyama, and J. D. Farmer. Chaos in learning a simple two-person game. Proceedings of the National Academy of Sciences, 99(7):4748-4751, 2002.
[75] S. Shalev-Shwartz. Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4, 2012.
[76] C. Song, Z. Zhou, Y. Zhou, Y. Jiang, and Y. Ma. Optimistic dual extrapolation for coherent non-monotone variational inequalities. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2020.
[77] D. Sychrovsky, M. Sustr, E. Davoodi, M. Lanctot, and M. Schmid. Learning not to regret. CoRR, abs/2303.01074, 2023.
[78] V. Syrgkanis, A. Agarwal, H. Luo, and R. E. Schapire. Fast convergence of regularized learning in games. In Advances in Neural Information Processing Systems, pages 2989-2997, 2015.
[79] F. A. Taha, K. Rokade, and F. Parise. Gradient dynamics in linear quadratic network games with time-varying connectivity and population fluctuation. CoRR, abs/2309.07871, 2023.
[80] E. van Damme. Stability and perfection of Nash equilibria, volume 339. Springer, 1991.
[81] N. Van Long. A survey of dynamic games in economics, volume 1. World Scientific, 2010.
[82] X. Venel. Regularity of dynamic opinion games. Games and Economic Behavior, 126:305-334, 2021.
[83] E. Vlatakis-Gkaragkounis, L. Flokas, T. Lianeas, P. Mertikopoulos, and G. Piliouras. No-regret learning and mixed nash equilibria: They do not mix. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2020.
[84] B. Von Stengel. Game theory basics. Cambridge University Press, 2021.
[85] Z. Wang, Y. Shen, M. Zavlanos, and K. H. Johansson. No-regret learning in strongly monotone games converges to a nash equilibrium, 2022.
[86] Y. Yan, P. Zhao, and Z. Zhou. Fast rates in time-varying strongly monotone games. In International Conference on Machine Learning (ICML), volume 202 of Proceedings of Machine Learning Research, pages 39138-39164. PMLR, 2023.
[87] J. Yang, N. Kiyavash, and N. He. Global convergence and variance-reduced optimization for a class of nonconvex-nonconcave minimax problems. CoRR, abs/2002.09621, 2020.
[88] Y. Yang and C. Ma.  $O(T^{-1})$  convergence of optimistic-follow-the-regularized-leader in two-player zero-sum markov games. In The Eleventh International Conference on Learning Representations, ICLR. OpenReview.net, 2023.
[89] M. Ye and G. Hu. Distributed seeking of time-varying nash equilibrium for non-cooperative games. IEEE Trans. Autom. Control., 60(11):3000-3005, 2015.