[82] Constantinos Daskalakis and Christos H Papadimitriou. On a network generalization of the minmax theorem. In International Colloquium on Automata, Languages, and Programming, pages 423-434. Springer, 2009.
[83] Stefanos Leonardos, Georgios Piliouras, and Kelly Spendlove. Exploration-exploitation in multi-agent competition: convergence with bounded rationality. NeurIPS, 2021.
[84] Kaiqing Zhang, Zhuoran Yang, Han Liu, Tong Zhang, and Tamer Bašar. Fully decentralized multi-agent reinforcement learning with networked agents. ICML, 2018.
[85] Kaiqing Zhang, Zhuoran Yang, and Tamer Basar. Networked multi-agent reinforcement learning in continuous spaces. CDC, 2018.
[86] Guannan Qu, Adam Wierman, and Na Li. Scalable reinforcement learning for multiagent networked systems. Operations Research, 2022.
[87] Xin Liu, Honghao Wei, and Lei Ying. Scalable and sample efficient distributed policy gradient algorithms in multi-agent networked systems. arXiv preprint arXiv:2212.06357, 2022.
[88] Yizhou Zhang, Guannan Qu, Pan Xu, Yiheng Lin, Zaiwei Chen, and Adam Wierman. Global convergence of localized policy iteration in networked multi-agent reinforcement learning. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 7(1):1-51, 2023.
[89] Zhaoyi Zhou, Zaiwei Chen, Yiheng Lin, and Adam Wierman. Convergence rates for localized actor-critic in networked markov potential games. UAI, 2023.
[90] Georgios Piliouras, Lillian Ratliff, Ryann Sim, and Stratis Skoulakis. Fast convergence of optimistic gradient ascent in network zero-sum extensive form games. SAGT, 2022.
[91] Ronald J Williams and Jing Peng. Function optimization using connectionist reinforcement learning algorithms. Connection Science, 3(3):241-268, 1991.
[92] Jan Peters, Katharina Mulling, and Yasemin Altun. Relative entropy policy search. 2010.
[93] Gergely Neu, Anders Jonsson, and Vicenç Gomez. A unified view of entropy-regularized Markov decision processes. NeurIPS, 2017.
[94] Tuomas Haarnoja, Haoran Tang, Pieter Abbeel, and Sergey Levine. Reinforcement learning with deep energy-based policies. ICML, 2017.
[95] Jincheng Mei, Chenjun Xiao, Csaba Szepesvari, and Dale Schuurmans. On the global convergence rates of softmax policy gradient methods. ICML, 2020.
[96] Shicong Cen, Chen Cheng, Yuxin Chen, Yuting Wei, and Yuejie Chi. Fast global convergence of natural policy gradient methods with entropy regularization. Operations Research, 70(4):2563-2578, 2022.
[97] Mingyang Liu, Asuman E. Ozdaglar, Tiancheng Yu, and Kaiqing Zhang. The power of regularization in solving extensive-form games. *ICLR*, 2023.
[98] Samuel Sokota, Ryan D'Orazio, J Zico Kolter, Nicolas Loizou, Marc Lanctot, Ioannis Mitliagkas, Noam Brown, and Christian Kroer. A unified approach to reinforcement learning, quantal response equilibria, and two-player zero-sum games. *ICLR*, 2023.
[99] Lloyd Shapley. Some topics in two-person games. Advances in game theory, 52:1-29, 1964.
[100] Muhammed O Sayin. On the global convergence of stochastic fictitious play in stochastic games with turn-based controllers. CDC, 2022.
[101] Asuman Ozdaglar, Muhammed O Sayin, and Kaiqing Zhang. Independent learning in stochastic games. International Congress of Mathematicians, 2022.
[102] Fivos Kalogiannis and Ioannis Panageas. Zero-sum polymatrix Markov games: Equilibrium collapse and efficient computation of Nash equilibria. NeurIPS, 2023.