Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
Not on the map. Why?
Abstract (arXiv)
We study policy optimization algorithms for computing correlated equilibria in multi-player general-sum Markov Games. Previous results achieve O(T-1/2) convergence rate to a correlated equilibrium and an accelerated O(T-3/4) convergence rate to the weaker notion of coarse correlated equilibrium. In this paper, we improve both results significantly by providing an uncoupled policy optimization algorithm that attains a near-optimal tildeO(T-1) convergence rate for computing a correlated equilibrium. Our algorithm is constructed by combining two main elements (i) smooth value updates and (ii) the optimistic-follow-the-regularized-leader algorithm with the log barrier regularizer.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 26 Jan 2024.
Builds on
21 of 47 references.
References · 21
- 2019The Hanabi Challenge: A New Frontier for AI Researchcited by 194
- 2013Optimization, Learning, and Games with Predictable Sequencescited by 187
- 2015Fast Convergence of Regularized Learning in Gamescited by 149
- 2021V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RLcited by 111
- 2020Near-Optimal Reinforcement Learning with Self-Playcited by 108
- 2021Global Convergence of Multi-Agent Policy Gradient in Markov Potential Gamescited by 89
- 2021Near-Optimal No-Regret Learning in General Gamescited by 85
- 2021Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Gamescited by 66
- 2020Hedging in games: Faster convergence of external and swap regretscited by 57
- 2022Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergencecited by 54
- 2021Decentralized Q-Learning in Zero-sum Markov Gamescited by 53
- 2021Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Gamescited by 43
9 more
- 2021Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Gamescited by 42
- 2022Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Gamescited by 35
- 2023Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximationcited by 29
- 2023Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximationcited by 26
- 2022Regret Minimization and Convergence to Equilibria in General-sum Markov Gamescited by 22
- 2022Policy Optimization for Markov Games: Unified Framework and Faster Convergencecited by 16
- 2021Decentralized Cooperative Reinforcement Learning with Hierarchical Information Structurecited by 14
- 2022O(T-1) Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Gamescited by 11
- 2023Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Gamescited by 9
Built on by
Citing papers per year: 2024: 3; 2025: 6; 2026: 2.
11 papers.
- 2025From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applicationscited by 6
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractabilitycited by 3
- 2024Learning to Steer Markovian Agents under Model Uncertaintycited by 2
- 2026Optimal Alternating Regret for Online Learning and Gamescited by 2
- 2025Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Gamescited by 1
- 2025Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Gamescited by 1
- 2026Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibriacited by 1
- 2024widetildeO(T-1) Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Gamescited by 0
- 2024Computational Lower Bounds for Regret Minimization in Normal-Form Gamescited by 0
- 2025Playing Markov Games Without Observing Payoffscited by 0
- 2025Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Gamescited by 0
- 2026Optimal Alternating Regret for Online Learning and Games25 Aug 2026
- 2026Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria12 Feb 2026
- 2025Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games4 Nov 2025
- 2025Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games3 Nov 2025
- 2025Playing Markov Games Without Observing Payoffs29 Aug 2025
- 2025From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications4 Jun 2025
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractability25 Feb 2025
- 2025Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games13 Feb 2025
- 2024Computational Lower Bounds for Regret Minimization in Normal-Form Games4 Nov 2024
- 2024Learning to Steer Markovian Agents under Model Uncertainty14 Jul 2024
- 2024widetildeO(T-1) Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Games2 Feb 2024