Decentralized Deterministic Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
[Zhang, ICML 2018] provided the first decentralized actor-critic algorithm for multi-agent reinforcement learning (MARL) that offers convergence guarantees. In that work, policies are stochastic and are defined on finite action spaces. We extend those results to offer a provably-convergent decentralized actor-critic algorithm for learning deterministic policies on continuous action spaces. Deterministic policies are important in real-world settings. To handle the lack of exploration inherent in deterministic policies, we consider both off-policy and on-policy settings. We provide the expression of a local deterministic policy gradient, decentralized deterministic actor-critic algorithms and convergence guarantees for linearly-approximated value functions. This work will help enable decentralized MARL in high-dimensional action spaces and pave the way for more widespread use of MARL.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 28 references that are in the map. First posted on arXiv 19 Feb 2021.
Builds on
9 of 28 references.
References · 9
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2018Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agentscited by 189
- 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
- 2018Expected Policy Gradients for Reinforcement Learningcited by 28
- 2019A Multi-Agent Off-Policy Actor-Critic Algorithm for Distributed Reinforcement Learningcited by 21
- 2018Convergent Actor-Critic Algorithms Under Off-Policy Training and Function Approximationcited by 12
- 2019Distributed off-Policy Actor-Critic Reinforcement Learning with Policy Consensuscited by 11
Built on by
Citing papers per year: 2021: 2.
2 papers.