[75] U. Nadav and T. Roughgarden. The limits of smoothness: A primal-dual framework for price of anarchy bounds. In International Workshop On Internet And Network Economics (WINE), volume 6484 of Lecture Notes in Computer Science, pages 319-326. Springer, 2010.
[76] J. Nash. Equilibrium points in n-person games. National Academy of Sciences, 36:48-49, 1950.
[77] 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.
[78] K. T. Nguyen. Game efficiency through linear programming duality. In A. Blum, editor, Innovations in Theoretical Computer Science Conference (ITCS), volume 124 of LIPIcs, pages 66:1-66:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[79] C. H. Papadimitriou and T. Roughgarden. Computing correlated equilibria in multi-player games. Journal of the ACM, 55(3):14:1-14:29, 2008.
[80] J. Pérolat, S. Perrin, R. Elie, M. Laurière, G. Piliouras, M. Geist, K. Tuyls, and O. Pietquin. Scaling mean field games by online mirror descent. In Autonomous Agents and Multi-Agent Systems, pages 1028-1037. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022.
[81] J. Perolat, B. D. Vylder, D. Hennes, E. Tarassov, F. Strub, V. de Boer, P. Muller, J. T. Connor, N. Burch, T. Anthony, S. McAleer, R. Elie, S. H. Cen, Z. Wang, A. Gruslys, A. Malysheva, M. Khan, S. Ozair, F. Timbers, T. Pohlen, T. Eccles, M. Rowland, M. Lanctot, J.-B. Lespiau, B. Piot, S. Omidshafiei, E. Lockhart, L. Sifre, N. Beauguerlange, R. Munos, D. Silver, S. Singh, D. Hassabis, and K. Tuyls. Mastering the game of Stratego with model-free multiagent reinforcement learning. Science, 378(6623):990–996, 2022.
[82] S. Perrin, M. Laurière, J. Pérolat, R. Élie, M. Geist, and O. Pietquin. Generalization in mean field games by learning master policies. In AAAI Conference on Artificial Intelligence (AAAI), pages 9413–9421. AAAI Press, 2022.
[83] W. Pesendorfer and J. M. Swinkels. The loser's curse and information aggregation in common value auctions. *Econometrica*, 65(6):1247–1281, 1997.
[84] T. Pethick, P. Latafat, P. Patrinos, O. Fercoq, and V. Cevher. Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. CoRR, abs/2302.09831, 2023.
[85] G. Piliouras, R. Sim, and S. Skoulakis. Beyond time-average convergence: Near-optimal uncoupled online learning via clairvoyant multiplicative weights update. In Conference on Neural Information Processing Systems (NeurIPS), 2022.
[86] A. Rakhlin and K. Sridharan. Online learning with predictable sequences. In Conference on Learning Theory, pages 993–1019, 2013.
[87] S. Rakhlin and K. Sridharan. Optimization, learning, and games with predictable sequences. In Advances in Neural Information Processing Systems, pages 3066-3074, 2013.
[88] J. B. Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33(3):520-534, 1965.
[89] T. Roughgarden. Barriers to near-optimal equilibria. In Annual Symposium on Foundations of Computer Science (FOCS), pages 71-80. IEEE Computer Society, 2014.
[90] T. Roughgarden. Intrinsic robustness of the price of anarchy. Journal of the ACM, 62(5): 32:1-32:42, 2015.
[91] T. Roughgarden. The price of anarchy in games of incomplete information. ACM Trans. Economics and Comput., 3(1):6:1-6:20, 2015.