Universally Expressive Communication In Multi-agent Reinforcement Learning

Abstract

Allowing agents to share information through communication is crucial for solving complex tasks in multi-agent reinforcement learning. In this work, we consider the question of whether a given communication protocol can express an arbitrary policy. By observing that many existing protocols can be viewed as instances of graph neural networks (GNNs), we demonstrate the equivalence of joint action selection to node labelling. With standard GNN approaches provably limited in their expressive capacity, we draw from existing GNN literature and consider augmenting agent observations with: (1) unique agent IDs and (2) random noise. We provide a theoretical analysis as to how these approaches yield universally expressive communication, and also prove them capable of targeting arbitrary sets of actions for identical agents. Empirically, these augmentations are found to improve performance on tasks where expressive communication is required, whilst, in general, the optimal communication protocol

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymorris2022universally

Related papers

• A Survey Of Multi-agent Deep Reinforcement Learning With Graph Neural Network-based Communication (2026)0.00
• Specializing Inter-agent Communication In Heterogeneous Multi-agent Reinforcement Learning Using Agent Class Information (2020)0.00
• Counterfactual Multi-agent Reinforcement Learning With Graph Convolution Communication (2020)0.00
• Learning Practical Communication Strategies In Cooperative Multi-agent Reinforcement Learning (2022)0.00
• Minimizing Communication While Maximizing Performance In Multi-agent Reinforcement Learning (2021)0.00
• Cooperative Policy Learning With Pre-trained Heterogeneous Observation Representations (2020)0.00
• On The Role Of Emergent Communication For Social Learning In Multi-agent Reinforcement Learning (2023)0.00
• Multi-agent Reinforcement Learning With Communication-constrained Priors (2025)0.00