Wireless Communication Enhanced Value Decomposition for Multi-Agent Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Cooperation in multi-agent reinforcement learning (MARL) benefits from inter-agent communication, yet most approaches assume idealized channels and existing value decomposition methods ignore who successfully shared information with whom. We propose CLOVER, a cooperative MARL framework whose centralized value mixer is conditioned on the communication graph realized under a realistic wireless channel. This graph introduces a relational inductive bias into value decomposition, constraining how individual utilities are mixed based on the realized communication structure. The mixer is a GNN with node-specific weights generated by a Permutation-Equivariant Hypernetwork: multi-hop propagation along communication edges reshapes credit assignment so that different topologies induce different mixing. We prove this mixer is permutation invariant, monotonic (preserving the IGM condition), and strictly more expressive than QMIX-style mixers. To handle realistic channels, we formulate an augmented MDP isolating stochastic channel effects from the agent computation graph, and employ a stochastic receptive field encoder for variable-size message sets, enabling end-to-end differentiable training. On Predator-Prey and Lumberjacks benchmarks under p-CSMA wireless channels, CLOVER consistently improves convergence speed and final performance over VDN, QMIX, TarMAC+VDN, and TarMAC+QMIX. Behavioral analysis confirms agents learn adaptive signaling and listening strategies, and ablations isolate the communication-graph inductive bias as the key source of improvement.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 39 of its 57 references that are in the map. First posted on arXiv 9 Apr 2026.
Builds on
39 of 57 references.
References · 39
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
- 2016HyperNetworkscited by 1,003
- 2018QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 697
- 2019The StarCraft Multi-Agent Challengecited by 589
- 2016Learning to Communicate with Deep Multi-Agent Reinforcement Learningcited by 561
- 2017Value-Decomposition Networks For Cooperative Multi-Agent Learningcited by 490
- 2020Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 475
- 2019QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learningcited by 372
- 2016Learning Multiagent Communication with Backpropagationcited by 355
- 2020QPLEX: Duplex Dueling Multi-Agent Q-Learningcited by 267
27 more
- 2018TarMAC: Targeted Multi-Agent Communicationcited by 201
- 2020Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 197
- 2018Graph Convolutional Reinforcement Learningcited by 148
- 2020RODE: Learning Roles to Decompose Multi-Agent Taskscited by 125
- 2022A Survey of Multi-Agent Deep Reinforcement Learning with Communicationcited by 103
- 2019Deep Coordination Graphscited by 96
- 2021Celebrating Diversity in Shared Multi-Agent Reinforcement Learningcited by 96
- 2019Learning to Schedule Communication in Multi-agent Reinforcement Learningcited by 89
- 2019Learning Nearly Decomposable Value Functions Via Communication Minimizationcited by 85
- 2021Rethinking the Implementation Tricks and Monotonicity Constraint in Cooperative Multi-Agent Reinforcement Learningcited by 68
- 2019On the Pitfalls of Measuring Emergent Communicationcited by 66
- 2020Deep Implicit Coordination Graphs for Multi-agent Reinforcement Learningcited by 58
- 2020Learning Individually Inferred Communication for Multi-Agent Cooperationcited by 55
- 2019Efficient Communication in Multi-Agent Reinforcement Learning via Variance Based Controlcited by 46
- 2015A Game-Theoretic Model and Best-Response Learning Method for Ad Hoc Coordination in Multiagent Systemscited by 41
- 2021Learning to Ground Multi-Agent Communication with Autoencoderscited by 37
- 2020R-MADDPG for Partially Observable Environments and Limited Communicationcited by 36
- 2025A Comprehensive Survey on Multi-Agent Cooperative Decision-Making: Scenarios, Approaches, Challenges and Perspectivescited by 27
- 2024HyperMARL: Adaptive Hypernetworks for Multi-Agent RLcited by 10
- 2023Stochastic Graph Neural Network-based Value Decomposition for MARL in Internet of Vehiclescited by 7
- 2022Breaking the Curse of Dimensionality in Multiagent State Space: A Unified Agent Permutation Frameworkcited by 6
- 2025Deep Meta Coordination Graphs for Multi-agent Reinforcement Learningcited by 6
- 2020Collaborative Multi-Robot Systems for Search and Rescue: Coordination and Perceptioncited by 4
- 2025Multi-Agent Reinforcement Learning with Communication-Constrained Priorscited by 3
- 2024Dynamic Deep Factor Graph for Multi-Agent Reinforcement Learningcited by 2
- 2025Robust and Efficient Communication in Multi-Agent Reinforcement Learningcited by 2
- 2022Learning Practical Communication Strategies in Cooperative Multi-Agent Reinforcement Learningcited by 1
Built on by
Not cited yet.