Asynchronous Credit Assignment for Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Credit assignment is a critical problem in multi-agent reinforcement learning (MARL), aiming to identify agents' marginal contributions for optimizing cooperative policies. Current credit assignment methods typically assume synchronous decision-making among agents. However, many real-world scenarios require agents to act asynchronously without waiting for others. This asynchrony introduces conditional dependencies between actions, which pose great challenges to current methods. To address this issue, we propose an asynchronous credit assignment framework, incorporating a Virtual Synchrony Proxy (VSP) mechanism and a Multiplicative Value Decomposition (MVD) algorithm. VSP enables physically asynchronous actions to be virtually synchronized during credit assignment. We theoretically prove that VSP preserves both task equilibrium and algorithm convergence. Furthermore, MVD leverages multiplicative interactions to effectively model dependencies among asynchronous actions, offering theoretical advantages in handling asynchronous tasks. Extensive experiments show that our framework consistently outperforms state-of-the-art MARL methods on challenging tasks while providing improved interpretability for asynchronous cooperation.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Aug 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Joint Optimization of Multi-agent Memory Systemcited by 1
- 2026Dual-Gated Epistemic Time-Dilation: Autonomous Compute Modulation in Asynchronous MARLcited by 0
- 2026Decoupled Multi-Agent Orchestrationcited by 0
- 2026Decoupled Multi-Agent Orchestration6 Oct 2026
- 2026Dual-Gated Epistemic Time-Dilation: Autonomous Compute Modulation in Asynchronous MARL24 Mar 2026
- 2026Joint Optimization of Multi-agent Memory System13 Mar 2026