[57] M. J. Kearns and Y. Mansour. Efficient nash computation in large population games with bounded influence. In Conference on Uncertainty in Artificial Intelligence (UAI), pages 259-266. Morgan Kaufmann, 2002.
[58] M. J. Kearns, M. M. Pai, A. Roth, and J. R. Ullman. Mechanism design in large games: incentives and privacy. In Innovations in Theoretical Computer Science (ITCS), pages 403-410. ACM, 2014.
[59] M. J. Kearns, M. M. Pai, R. M. Rogers, A. Roth, and J. R. Ullman. Robust mediators in large games. CoRR, abs/1512.02698, 2015.
[60] D. Kim, M. Riemer, M. Liu, J. N. Foerster, M. Everett, C. Sun, G. Tesauro, and J. P. How. Influencing long-term behavior in multiagent reinforcement learning. CoRR, abs/2203.03535, 2022.
[61] E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Symposium on Theoretical Aspects in Computer Science (STACS), 1999.
[62] J. Kulkarni and V. S. Mirrokni. Robust price of anarchy bounds via LP and fenchel duality. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1030-1049. SIAM, 2015.
[63] D. Lacker and K. Ramanan. Rare nash equilibria and the price of anarchy in large static games. Mathematics of Operations Research, 44(2):400-422, 2019.
[64] J.-M. Lasry and P.-L. Lions. Mean field games. Japanese journal of mathematics, 2(1): 229-260, 2007.
[65] M. Laurière, S. Perrin, S. Girgin, P. Muller, A. Jain, T. Cabannes, G. Piliouras, J. Pérolat, R. Elie, O. Pietquin, and M. Geist. Scalable deep reinforcement learning algorithms for mean field games. In International Conference on Machine Learning (ICML), volume 162 of Proceedings of Machine Learning Research, pages 12078-12095. PMLR, 2022.
[66] T. Lin, Z. Zhou, P. Mertikopoulos, and M. I. Jordan. Finite-time last-iterate convergence for multi-agent learning in games. In International Conference on Machine Learning (ICML), volume 119 of Proceedings of Machine Learning Research, pages 6161–6171. PMLR, 2020.
[67] B. Lucier, S. Pattathil, A. Slivkins, and M. Zhang. Autobidders with budget and ROI constraints: Efficiency, regret, and pacing dynamics. CoRR, abs/2301.13306, 2023.
[68] G. J. Mailath and A. Postlewaite. Asymmetric information bargaining problems with many agents. The Review of Economic Studies, 57(3):351-367, 1990.
[69] F. McSherry and K. Talwar. Mechanism design via differential privacy. In Annual Symposium on Foundations of Computer Science (FOCS), pages 94-103. IEEE Computer Society, 2007.
[70] P. Mertikopoulos, C. H. Papadimitriou, and G. Piliouras. Cycles in adversarial regularized learning. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2703-2717. SIAM, 2018.
[71] P. Mertikopoulos, B. Lecouat, H. Zenati, C. Foo, V. Chandrasekhar, and G. Piliouras. Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile. In International Conference on Learning Representations (ICLR). OpenReview.net, 2019.
[72] P. Milgrom and R. Weber. Distributional strategies for games with incomplete infomation. Mathematics of Operations Research, 10:619-632, 1985.
[73] J. Millionis, C. H. Papadimitriou, G. Piliouras, and K. Spendlove. Nash, conley, and computation: Impossibility and incompleteness in game dynamics. CoRR, abs/2203.14129, 2022.
[74] P. Muller, M. Rowland, R. Elie, G. Piliouras, J. Pérolat, M. Laurière, R. Marinier, O. Pietquin, and K. Tuyls. Learning equilibria in mean-field games: Introducing mean-field PSRO. In Autonomous Agents and Multi-Agent Systems, pages 926-934. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022.