Context-Aware Bayesian Network Actor-Critic Methods for Cooperative Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Executing actions in a correlated manner is a common strategy for human coordination that often leads to better cooperation, which is also potentially beneficial for cooperative multi-agent reinforcement learning (MARL). However, the recent success of MARL relies heavily on the convenient paradigm of purely decentralized execution, where there is no action correlation among agents for scalability considerations. In this work, we introduce a Bayesian network to inaugurate correlations between agents' action selections in their joint policy. Theoretically, we establish a theoretical justification for why action dependencies are beneficial by deriving the multi-agent policy gradient formula under such a Bayesian network joint policy and proving its global convergence to Nash equilibria under tabular softmax policy parameterization in cooperative Markov games. Further, by equipping existing MARL algorithms with a recent method of differentiable directed acyclic graphs (DAGs), we develop practical algorithms to learn the context-aware Bayesian network policies in scenarios with partial observability and various difficulty. We also dynamically decrease the sparsity of the learned DAG throughout the training process, which leads to weakly or even purely independent policies for decentralized execution. Empirical results on a range of MARL benchmarks show the benefits of our approach.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 26 references that are in the map. First posted on arXiv 2 Jun 2023.
Builds on
17 of 26 references.
References · 17
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 903
- 2019The StarCraft Multi-Agent Challengecited by 589
- 2019Emergent Tool Use From Multi-Agent Autocurriculacited by 308
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 172
- 2019Multi-Agent Deep Reinforcement Learning for Large-scale Traffic Signal Controlcited by 159
- 2019Deep Coordination Graphscited by 96
- 2021Global Convergence of Multi-Agent Policy Gradient in Markov Potential Gamescited by 89
- 2019On the Pitfalls of Measuring Emergent Communicationcited by 66
- 2022Differentiable DAG Samplingcited by 46
- 2021Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomizationcited by 35
5 more
- 2021Independent Natural Policy Gradient Always Converges in Markov Potential Gamescited by 34
- 2022Revisiting Some Common Practices in Cooperative Multi-Agent Reinforcement Learningcited by 32
- 2021Context-Aware Sparse Deep Coordination Graphscited by 27
- 2022GCS: Graph-based Coordination Strategy for Multi-Agent Reinforcement Learningcited by 20
- 2022Convergence and Price of Anarchy Guarantees of the Softmax Policy Gradient in Markov Potential Gamescited by 6
Built on by
Citing papers per year: 2025: 2.
2 papers.