Inter-Agent Relative Representations for Multi-Agent Option Discovery
Not on the map. Why?
Abstract (arXiv)
Temporally extended actions improve the ability to explore and plan in single-agent settings. In multi-agent settings, the exponential growth of the joint state space with the number of agents makes coordinated behaviours even more valuable. Yet, this same exponential growth renders the design of multi-agent options particularly challenging. Existing multi-agent option discovery methods often sacrifice coordination by producing loosely coupled or fully independent behaviours. Toward addressing these limitations, we describe a novel approach for multi-agent option discovery. Specifically, we propose a joint-state abstraction that compresses the state space while preserving the information necessary to discover strongly coordinated behaviours. Our approach builds on the inductive bias that synchronisation over agent states provides a natural foundation for coordination in the absence of explicit objectives. We first approximate a fictitious state of maximal alignment with the team, the textitFermat state, and use it to define a measure of textitspreadness, capturing team-level misalignment on each individual state dimension. Building on this representation, we then employ a neural graph Laplacian estimator to derive options that capture state synchronisation patterns between agents. We evaluate the resulting options across multiple scenarios in two simulated multi-agent domains, showing that they yield stronger downstream coordination capabilities compared to alternative option discovery methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 31 of its 55 references that are in the map. First posted on arXiv 31 Dec 2025.
Builds on
31 of 55 references.
References · 31
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 942
- 2018Machine Theory of Mindcited by 226
- 2020Benchmarking Multi-Agent Deep Reinforcement Learning Algorithms in Cooperative Taskscited by 212
- 2018Graph Convolutional Reinforcement Learningcited by 152
- 2017A Laplacian Framework for Option Discovery in Reinforcement Learningcited by 110
- 2018The Laplacian in RL: Learning Representations with Efficient Approximationscited by 86
- 2023METRA: Scalable Unsupervised RL with Metric-Aware Abstractioncited by 86
- 2019Multi-Agent Game Abstraction via Graph Attention Neural Networkcited by 82
- 2019Dynamical Distance Learning for Semi-Supervised and Unsupervised Skill Discoverycited by 68
- 2023JaxMARL: Multi-Agent RL Environments and Algorithms in JAXcited by 63
- 2024Learning Temporal Distances: Contrastive Successor Features Can Provide a Metric Structure for Decision-Makingcited by 56
19 more
- 2021Temporal Abstraction in Reinforcement Learning with the Successor Representationcited by 54
- 2021Towards Robust Bisimulation Metric Learningcited by 49
- 2021Adversarial Intrinsic Motivation for Reinforcement Learningcited by 40
- 2022Scalable Multi-Agent Reinforcement Learning through Intelligent Information Aggregationcited by 36
- 2019Discovering Options for Exploration by Minimizing Cover Timecited by 31
- 2023Conditional Mutual Information for Disentangled Representations in Reinforcement Learningcited by 27
- 2021Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawingcited by 23
- 2019Self-supervised Learning of Distance Functions for Goal-Conditioned Reinforcement Learningcited by 18
- 2020Macro-Action-Based Deep Multi-Agent Reinforcement Learningcited by 18
- 2021Semantic Tracklets: An Object-Centric Representation for Visual Multi-Agent Reinforcement Learningcited by 18
- 2022Asynchronous Actor-Critic for Multi-Agent Reinforcement Learningcited by 18
- 2024TLDR: Unsupervised Goal-Conditioned RL via Temporal Distance-Aware Representationscited by 17
- 2025Episodic Novelty Through Temporal Distancecited by 16
- 2022Metric Residual Networks for Sample Efficient Goal-Conditioned Reinforcement Learningcited by 13
- 2014Policy Iteration for Decentralized Control of Markov Decision Processescited by 11
- 2024The Overcooked Generalisation Challenge: Evaluating Cooperation with Novel Partners in Unknown Environments Using Unsupervised Environment Designcited by 11
- 2023Scalable Multi-agent Covering Option Discovery based on Kronecker Graphscited by 9
- 2024State Chrono Representation for Enhancing Generalization in Reinforcement Learningcited by 3
- 2024Investigating Relational State Abstraction in Collaborative MARLcited by 1
Built on by
Not cited yet.