[34] Z. Duan, W. Huang, D. Zhang, Y. Du, J. Wang, Y. Yang, and X. Deng. Is nash equilibrium approximator learnable? In Autonomous Agents and Multi-Agent Systems, pages 233-241. ACM, 2023.
[35] B. Duvocelle, P. Mertikopoulos, M. Staudigl, and D. Vermeulen. Multiagent online learning in time-varying games. Mathematics of Operations Research, 2022.
[36] F. Facchinei and J.-S. Pang. Finite-dimensional variational inequalities and complementarity problems. Springer, 2003.
[37] G. Farina, C. Kroer, and T. Sandholm. Faster game solving via predictive Blackwell approachability: Connecting regret matching and mirror descent. In Proceedings of the AAAI Conference on Artificial Intelligence, 2021.
[38] G. Farina, I. Anagnostides, H. Luo, C. Lee, C. Kroer, and T. Sandholm. Near-optimal no-regret learning for general convex games. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2022.
[39] G. Farina, C. Kroer, C. Lee, and H. Luo. Clairvoyant regret minimization: Equivalence with nemirovski's conceptual prox method and extension to general convex games. CoRR, abs/2208.14891, 2022.
[40] Y. Feng, H. Fu, Q. Hu, P. Li, I. Panageas, B. Peng, and X. Wang. On the last-iterate convergence in time-varying zero-sum games: Extra gradient succeeds where optimism fails. CoRR, abs/2310.02604, 2023.
[41] T. Fiez, R. Sim, S. Skoulakis, G. Piliouras, and L. J. Ratliff. Online learning in periodic zero-sum games. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), pages 10313-10325, 2021.
[42] D. Foster and R. Vohra. Calibrated learning and correlated equilibrium. Games and Economic Behavior, 21:40-55, 1997.
[43] Y. Freund and R. Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79-103, 1999.
[44] D. F. Garrett. Dynamic mechanism design: Dynamic arrivals and changing values. Games and Economic Behavior, 104:595-612, 2017.
[45] A. Giannou, E. Vlatakis-Gkaragkounis, and P. Mertikopoulos. Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information. In Conference on Learning Theory (COLT), volume 134 of Proceedings of Machine Learning Research, pages 2147-2148. PMLR, 2021.
[46] N. Golowich, S. Pattathil, and C. Daskalakis. Tight last-iterate convergence rates for no-regret learning in multi-player games. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2020.
[47] E. Gorbunov, A. B. Taylor, and G. Gidel. Last-iterate convergence of optimistic gradient method for monotone variational inequalities. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2022.
[48] K. Harris, I. Anagnostides, G. Farina, M. Khodak, S. Wu, and T. Sandholm. Meta-learning in games. In The Eleventh International Conference on Learning Representations, ICLR. OpenReview.net, 2023.
[49] S. Hart and A. Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68:1127-1150, 2000.
[50] S. Hart and D. Schmeidler. Existence of correlated equilibria. Mathematics of Operations Research, 14(1):18-25, 1989.
[51] E. Hazan and C. Seshadhri. Efficient learning algorithms for changing environments. In International Conference on Machine Learning (ICML), page 393-400. Association for Computing Machinery, 2009.