[18] N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
[19] V. Cevher, G. Piliouras, R. Sim, and S. Skoulakis. Min-max optimization made simple: Approximating the proximal point method via contraction maps. In Symposium on Simplicity in Algorithms (SOSA), pages 192-206. SIAM, 2023.
[20] X. Chen, X. Deng, and S.-H. Teng. Settling the complexity of computing two-player Nash equilibria. Journal of the ACM, 2009.
[21] Y. K. Cheung, S. Leonardos, and G. Piliouras. Learning in markets: Greed leads to chaos but following the price is right. In International Joint Conference on Artificial Intelligence (IJCAI), pages 111-117. ijcai.org, 2021.
[22] C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu. Online optimization with gradual variations. In Conference on Learning Theory (COLT), pages 6-1, 2012.
[23] R. Cole and Y. Tao. Large market games with near optimal efficiency. In ACM Conference on Economics and Computation (EC), pages 791-808. ACM, 2016.
[24] R. Colini-Baldeschi, R. Cominetti, P. Mertikopoulos, and M. Scarsini. The asymptotic behavior of the price of anarchy. In International Workshop On Internet And Network Economics (WINE), pages 133-145. Springer, 2017.
[25] R. Colini-Baldeschi, R. Cominetti, and M. Scarsini. Price of anarchy for highly congested routing games in parallel networks. Theory of Computing Systems, 63:90-113, 2019.
[26] R. Colini-Baldeschi, R. Cominetti, P. Mertikopoulos, and M. Scarsini. When is selfish routing bad? the price of anarchy in light and heavy traffic. Operations Research, 68(2):411-434, 2020.
[27] V. Conitzer and T. Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence, 170(6-7):607-619, 2006. Earlier version in IJCAI-03.
[28] V. Conitzer and T. Sandholm. New complexity results about Nash equilibria. Games and Economic Behavior, 63(2):621-641, 2008. Early version in IJCAI-03.
[29] K. Cui and H. Koeppl. Learning graphon mean field games and approximate nash equilibria. In International Conference on Learning Representations (ICLR). OpenReview.net, 2022.
[30] C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. In Symposium on Theory of Computing (STOC), 2006.
[31] J. Deb and E. Kalai. Stability in large bayesian games with heterogeneous players. Journal of Economic Theory, 157:1041-1055, 2015.
[32] X. Deng, X. Hu, T. Lin, and W. Zheng. Nash convergence of mean-based learning algorithms in first price auctions. In WWW '22: The ACM Web Conference, pages 141-150. ACM, 2022.
[33] J. Diakonikolas, C. Daskalakis, and M. I. Jordan. Efficient methods for structured nonconvex-nonconcave min-max optimization. In International Conference on Artificial Intelligence and Statistics (AISTATS), volume 130 of Proceedings of Machine Learning Research, pages 2746-2754. PMLR, 2021.
[34] S. Dobzinski, N. Nisan, and M. Schapira. Approximation algorithms for combinatorial auctions with complement-free bidders. Mathematics of Operation Research, 35(1):1-13, 2010.
[35] K. Etessami and M. Yannakakis. On the complexity of Nash equilibria and other fixed points (extended abstract). In Annual Symposium on Foundations of Computer Science (FOCS), pages 113-123, 2007.
[36] F. Facchinei and J.-S. Pang. Finite-dimensional variational inequalities and complementarity problems. Springer, 2003.