{"total":22,"rows":[{"id":"2102.04540","title":"Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games","created":"2021-02-08","cited_by_count":69,"area":null},{"id":"2106.02748","title":"Decentralized Q-Learning in Zero-sum Markov Games","created":"2021-06-04","cited_by_count":58,"area":null},{"id":"2303.02738","title":"Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback","created":"2023-03-05","cited_by_count":30,"area":null},{"id":"2105.08158","title":"The Confluence of Networks, Games and Learning","created":"2021-05-17","cited_by_count":26,"area":null},{"id":"2111.11743","title":"Independent Learning in Stochastic Games","created":"2021-11-23","cited_by_count":22,"area":null},{"id":"2205.14590","title":"Independent and Decentralized Learning in Markov Potential Games","created":"2022-05-29","cited_by_count":22,"area":null},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18,"area":null},{"id":"2210.08857","title":"On the convergence of policy gradient methods to Nash equilibria in general stochastic games","created":"2022-10-17","cited_by_count":16,"area":null},{"id":"2303.03100","title":"A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"area":null},{"id":"2110.04638","title":"Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games","created":"2021-10-09","cited_by_count":9,"area":null},{"id":"2201.12224","title":"Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains","created":"2022-01-28","cited_by_count":7,"area":null},{"id":"2208.02204","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","created":"2022-08-03","cited_by_count":7,"area":null},{"id":"2506.16736","title":"Optimism Without Regularization: Constant Regret in Zero-Sum Games","created":"2025-06-20","cited_by_count":2,"area":null},{"id":"2302.09806","title":"Logit-Q Dynamics for Efficient Learning in Stochastic Teams","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2312.01587","title":"Scalable and Independent Learning of Nash Equilibrium Policies in $n$-Player Stochastic Games with Unknown Independent Chains","created":"2023-12-04","cited_by_count":1,"area":null},{"id":"2301.05630","title":"Decentralized model-free reinforcement learning in stochastic games with average-reward objective","created":"2023-01-13","cited_by_count":0,"area":null},{"id":"2410.15156","title":"Simulation-Based Optimistic Policy Iteration For Multi-Agent MDPs with Kullback-Leibler Control Cost","created":"2024-10-19","cited_by_count":0,"area":null},{"id":"2506.19038","title":"Online Learning for Dynamic Vickrey-Clarke-Groves Mechanism in Unknown Environments","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2508.19371","title":"Aggregate Fictitious Play for Learning in Anonymous Polymatrix Games (Extended Version)","created":"2025-08-26","cited_by_count":0,"area":null},{"id":"2602.00606","title":"Actor-Dual-Critic Dynamics for Zero-sum and Identical-Interest Stochastic Games","created":"2026-01-31","cited_by_count":0,"area":null},{"id":"2610.01181","title":"Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}