Hierarchical Message-Passing Policies for Multi-Agent Reinforcement Learning
Tommaso Marzi, Cesare Alippi, Andrea Cini

TL;DR
This paper introduces a hierarchical message-passing approach for multi-agent reinforcement learning that combines hierarchical graph structures with a novel reward assignment method, improving coordination and scalability in complex environments.
Contribution
It presents a new hierarchical message-passing framework for multi-agent RL, integrating feudal HRL with a reward assignment strategy to enhance coordination and performance.
Findings
Outperforms state-of-the-art methods on benchmark tasks.
Effective hierarchical coordination among agents demonstrated.
Improves scalability and handling of partial observability.
Abstract
Decentralized Multi-Agent Reinforcement Learning (MARL) methods allow for learning scalable multi-agent policies, but suffer from partial observability and induced non-stationarity. These challenges can be addressed by introducing mechanisms that facilitate coordination and high-level planning. Specifically, coordination and temporal abstraction can be achieved through communication (e.g., message passing) and Hierarchical Reinforcement Learning (HRL) approaches to decision-making. However, optimization issues limit the applicability of hierarchical policies to multi-agent systems. As such, the combination of these approaches has not been fully explored. To fill this void, we propose a novel and effective methodology for learning multi-agent hierarchies of message-passing policies. We adopt the feudal HRL framework and rely on a hierarchical graph structure for planning and coordination…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Opinion Dynamics and Social Influence
