[1] Antonakopoulos, K., Belmega, E. V., and Mertikopoulos, P. An adaptive mirror-prox algorithm for variational inequalities with singular operators. In NeurIPS '19: Proceedings of the 33rd International Conference on Neural Information Processing Systems, 2019.
[2] Arthur, W. B. Complexity in economic and financial markets. Complexity, 1(1):20-25, 1995.
[3] Auslender, A. and Teboulle, M. Interior projection-like methods for monotone variational inequalities. Mathematical Programming, 104:39-68, 2005.
[4] Bakhtin, A., Wu, D. J., Lerer, A., Gray, J., Jacob, A. P., Farina, G., Miller, A. H., and Brown, N. Mastering the game of no-press diplomacy via human-regularized reinforcement learning and planning. arXiv preprint arXiv:2210.05492, 2022.
[5] Beltratti, A., Margarita, S., Terna, P., et al. Neural networks for economic and financial modelling. International Thomson Computer Press London, UK, 1996.
[6] Bichler, M., Fichtl, M., Heidekrüger, S., Kohring, N., and Sutterer, P. Learning equilibria in symmetric auction games using artificial neural networks. Nat. Mach. Intell., 3(8):687-695, 2021. doi: 10.1038/s42256-021-00365-4. URL https://doi.org/10.1038/s42256-021-00365-4.
[7] Bravo, M., Leslie, D. S., and Mertikopoulos, P. Bandit learning in concave  $N$ -person games. In NeurIPS '18: Proceedings of the 32nd International Conference of Neural Information Processing Systems, 2018.
[8] Chung, K.-L. On a stochastic approximation method. The Annals of Mathematical Statistics, 25(3): 463-483, 1954.
[9] Daskalakis, C., Goldberg, P. W., and Papadimitriou, C. H. The complexity of computing a Nash equilibrium. Communications of the ACM, 52(2):89-97, 2009.
[10] Daskalakis, C., Skoulakis, S., and Zampetakis, M. The complexity of constrained min-max optimization. In STOC '21: Proceedings of the 53rd annual ACM SIGACT symposium on the Theory of Computing, 2021.
[11] Duvocelle, B., Mertikopoulos, P., Staudigl, M., and Vermeulen, D. Multi-agent online learning in time-varying games. Mathematics of Operations Research, 48(2):914-941, May 2023.
[12] Facchinei, F. and Pang, J.-S. Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research. Springer, 2003.
[13] Gidel, G., Balduzzi, D., Czarnecki, W. M., Garnelo, M., and Bachrach, Y. Minimax theorem for latent games or: How i learned to stop worrying about mixed-nash and love neural nets. AISTATS, 2021.
[14] Goodfellow, I. J., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. Generative adversarial nets. In NIPS '14: Proceedings of the 28th International Conference on Neural Information Processing Systems, 2014.
[15] Hart, S. and Mas-Colell, A. Uncoupled dynamics do not lead to Nash equilibrium. American Economic Review, 93(5):1830-1836, 2003.
[16] Hart, S. and Mas-Colell, A. Stochastic uncoupled dynamics and Nash equilibrium. Games and Economic Behavior, 57:286-303, 2006.
[17] Hazan, E. A survey: The convex optimization approach to regret minimization. In Sra, S., Nowozin, S., and Wright, S. J. (eds.), Optimization for Machine Learning, pp. 287-304. MIT Press, 2012.
[18] Hsieh, Y.-G., Iutzeler, F., Malick, J., and Mertikopoulos, P. On the convergence of single-call stochastic extra-gradient methods. In NeurIPS '19: Proceedings of the 33rd International Conference on Neural Information Processing Systems, pp. 6936-6946, 2019.