[30] Gabriele Farina, Chun Kai Ling, Fei Fang, and Tuomas Sandholm. Correlation in extensive-form games: Saddle-point formulation and benchmarks. In Conference on Neural Information Processing Systems (NeurIPS), 2019.
[31] Gabriele Farina, Tommaso Bianchi, and Tuomas Sandholm. Coarse correlation in extensive-form games. In AAAI Conference on Artificial Intelligence, 2020.
[32] Gabriele Farina, Christian Kroer, and Tuomas Sandholm. Better regularization for sequential decision spaces: Fast convergence rates for nash, correlated, and team equilibria. In ACM Conference on Economics and Computation (EC), page 432, 2021.
[33] Gabriele Farina, Christian Kroer, and Tuomas Sandholm. Faster game solving via predictive Blackwell approachability: Connecting regret matching and mirror descent. In AAAI Conference on Artificial Intelligence (AAAI), 2021.
[34] Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, and Tuomas Sandholm. Near-optimal no-regret learning dynamics for general convex games. In Conference on Neural Information Processing Systems (NeurIPS), 2022.
[35] Tanner Fiez, Benjamin Chasnov, and Lillian J. Ratliff. Convergence of learning dynamics in stackelberg games. CoRR, abs/1906.01217, 2019.
[36] Francoise Forges. An approach to communication equilibria. *Econometrica: Journal of the Econometric Society*, pages 1375–1385, 1986.
[37] Françoise Forges and Frédéric Koessler. Communication equilibria with partially verifiable types. Journal of Mathematical Economics, 41(7):793-811, 2005.
[38] Yoav Freund and Robert Schapire. Adaptive game playing using multiplicative weights. Games and Economic Behavior, 29:79-103, 1999.
[39] Drew Fudenberg and David Levine. The Theory of Learning in Games. MIT Press, 1998.
[40] Kaito Fujii. Bayes correlated equilibria and no-regret dynamics. CoRR, abs/2304.05005, 2023.
[41] Itzhak Gilboa and Eitan Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1:80-93, 1989.
[42] Denizalp Goktas, David C. Parkes, Ian Gemp, Luke Marris, Georgios Piliouras, Romuald Elie, Guy Lever, and Andrea Tacchetti. Generative adversarial equilibrium solvers. CoRR, abs/2302.06607, 2023.
[43] Noah Golowich, Sarath Pattathil, and Constantinos Daskalakis. Tight last-iterate convergence rates for no-regret learning in multi-player games. In Conference on Neural Information Processing Systems (NeurIPS), 2020.
[44] Eduard Gorbunov, Hugo Berard, Gauthier Gidel, and Nicolas Loizou. Stochastic extragradient: General analysis and improved rates. In International Conference on Artificial Intelligence and Statistics (AISTATS), volume 151 of Proceedings of Machine Learning Research, pages 7865-7901. PMLR, 2022.
[45] Eduard Gorbunov, Nicolas Loizou, and Gauthier Gidel. Extragradient method:  $O(1 / K)$  last-iterate convergence for monotone variational inequalities and connections with cocoercivity. In International Conference on Artificial Intelligence and Statistics (AISTATS), volume 151 of Proceedings of Machine Learning Research, pages 366-402. PMLR, 2022.
[46] J Green and J-J Laffont. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. *Econometrica*, 45:427-438, 1977.
[47] Amy Greenwald and Keith Hall. Correlated Q-learning. In International Conference on Machine Learning (ICML), pages 242-249, Washington, DC, USA, 2003.
[48] Sergiu Hart and Yishay Mansour. How long to equilibrium? the communication complexity of uncoupled equilibrium procedures. Games and Economic Behavior, 69(1):107-126, 2010.