[37] 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.
[38] T. Feddersen and W. Pesendorfer. Voting behavior and information aggregation in elections with private information. *Econometrica*, 65(5):1029–1058, 1997.
[39] M. Feldman, N. Immorlica, B. Lucier, T. Roughgarden, and V. Syrgkanis. The price of anarchy in large games. In Symposium on Theory of Computing (STOC), pages 963-976. ACM, 2016.
[40] M. Feldman, H. Fu, N. Gravin, and B. Lucier. Simultaneous auctions without complements are (almost) efficient. Games and Economic Behavior, 123:327-341, 2020.
[41] D. Fudenberg and D. K. Levine. Open-loop and closed-loop equilibria in dynamic games with many players. Journal of Economic Theory, 44(1):1-18, 1988.
[42] J. Gaitonde, Y. Li, B. Light, B. Lucier, and A. Slivkins. Budget pacing in repeated auctions: Regret and efficiency without convergence. In Innovations in Theoretical Computer Science Conference (ITCS), volume 251 of LIPIcs, pages 52:1-52:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[43] Y. Gao. New Optimization Models and Methods for Classical, Infinite-Dimensional, and Online Fisher Markets. Columbia University, 2022.
[44] I. Gilboa and E. Zemel. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1:80–93, 1989.
[45] P. W. Goldberg and M. J. Katzman. Lower bounds for the query complexity of equilibria in lipschitz games. Theoretical Comput. Sci., 962, 2023.
[46] N. Golowich, S. Pattathil, and C. Daskalakis. Tight last-iterate convergence rates for no-regret learning in multi-player games. In Conference on Neural Information Processing Systems (NeurIPS), 2020.
[47] D. A. Gomes and J. Saude. Mean field games models—a brief survey. Dynamic Games and Applications, 4:110–154, 2014.
[48] E. Gorbunov, N. Loizou, and G. 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.
[49] R. Gradwohl and E. Kalai. Large games: Robustness and stability. Annual Review of Economics, 13:39-56, 2021.
[50] R. Gradwohl and O. Reingold. Fault tolerance in large games. Games and Economic Behavior, 86:438-457, 2014.
[51] Y. Guan, M. Afshari, and P. Tsiotras. Zero-sum games between mean-field teams: A common information and reachability based analysis. CoRR, abs/2303.12243, 2023.
[52] J. C. Harsanyi, R. Selten, et al. A general theory of equilibrium selection in games. MIT Press Books, 1, 1988.
[53] J. D. Hartline, V. Syrgkanis, and É. Tardos. No-regret learning in bayesian games. In Conference on Neural Information Processing Systems (NeurIPS), pages 3061-3069, 2015.
[54] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
[55] Y. Jin and P. Lu. First price auction is  $1 - 1 / e^{2}$  efficient. In Annual Symposium on Foundations of Computer Science (FOCS), pages 179-187. IEEE, 2022.
[56] E. Kalai. Large robust games. Econometrica, 72(6):1631-1665, 2004.