Learning Implicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
We present a multi-agent actor-critic method that aims to implicitly address the credit assignment problem under fully cooperative settings. Our key motivation is that credit assignment among agents may not require an explicit formulation as long as (1) the policy gradients derived from a centralized critic carry sufficient information for the decentralized agents to maximize their joint action value through optimal cooperation and (2) a sustained level of exploration is enforced throughout training. Under the centralized training with decentralized execution (CTDE) paradigm, we achieve the former by formulating the centralized critic as a hypernetwork such that a latent state representation is integrated into the policy gradients through its multiplicative association with the stochastic policies; to achieve the latter, we derive a simple technique called adaptive entropy regularization where magnitudes of the entropy gradients are dynamically rescaled based on the current policy stochasticity to encourage consistent levels of exploration. Our algorithm, referred to as LICA, is evaluated on several benchmarks including the multi-agent particle environments and a set of challenging StarCraft II micromanagement tasks, and we show that LICA significantly outperforms previous methods.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 0; 2023: 1; 2024: 0; 2025: 1; 2026: 1.
10 papers.
- 2021Rethinking the Implementation Tricks and Monotonicity Constraint in Cooperative Multi-Agent Reinforcement Learningcited by 68
- 2021UPDeT: Universal Multi-agent Reinforcement Learning via Policy Decoupling with Transformerscited by 39
- 2021Shapley Counterfactual Credits for Multi-Agent Reinforcement Learningcited by 37
- 2021SHAQ: Incorporating Shapley Value Theory into Multi-Agent Q-Learningcited by 26
- 2023VDFD: Multi-Agent Value Decomposition Framework with Disentangled World Modelcited by 3
- 2025URB -- Urban Routing Benchmark for RL-equipped Connected Autonomous Vehiclescited by 3
- 2021Credit Assignment with Meta-Policy Gradient for Multi-Agent Reinforcement Learningcited by 2
- 2021Greedy UnMixing for Q-Learning in Multi-Agent Reinforcement Learningcited by 1
- 2021Regularize! Don't Mix: Multi-Agent Reinforcement Learning without Explicit Centralized Structurescited by 0
- 2026Multi-Agent Model-Based Reinforcement Learning with Joint State-Action Learned Embeddingscited by 0
- 2026Multi-Agent Model-Based Reinforcement Learning with Joint State-Action Learned Embeddings13 Feb 2026
- 2025URB -- Urban Routing Benchmark for RL-equipped Connected Autonomous Vehicles23 May 2025
- 2023VDFD: Multi-Agent Value Decomposition Framework with Disentangled World Model8 Sep 2023
- 2021Regularize! Don't Mix: Multi-Agent Reinforcement Learning without Explicit Centralized Structures19 Sep 2021
- 2021Greedy UnMixing for Q-Learning in Multi-Agent Reinforcement Learning19 Sep 2021
- 2021Shapley Counterfactual Credits for Multi-Agent Reinforcement Learning1 Jun 2021
- 2021SHAQ: Incorporating Shapley Value Theory into Multi-Agent Q-Learning31 May 2021
- 2021Credit Assignment with Meta-Policy Gradient for Multi-Agent Reinforcement Learning24 Feb 2021
- 2021Rethinking the Implementation Tricks and Monotonicity Constraint in Cooperative Multi-Agent Reinforcement Learning6 Feb 2021
- 2021UPDeT: Universal Multi-agent Reinforcement Learning via Policy Decoupling with Transformers20 Jan 2021