High-order Interactions Modeling for Interpretable Multi-Agent Q-Learning
Not on the map. Why?
Abstract (arXiv)
The ability to model interactions among agents is crucial for effective coordination and understanding their cooperation mechanisms in multi-agent reinforcement learning (MARL). However, previous efforts to model high-order interactions have been primarily hindered by the combinatorial explosion or the opaque nature of their black-box network structures. In this paper, we propose a novel value decomposition framework, called Continued Fraction Q-Learning (QCoFr), which can flexibly capture arbitrary-order agent interactions with only linear complexity Oleft(nright) in the number of agents, thus avoiding the combinatorial explosion when modeling rich cooperation. Furthermore, we introduce the variational information bottleneck to extract latent information for estimating credits. This latent information helps agents filter out noisy interactions, thereby significantly enhancing both cooperation and interpretability. Extensive experiments demonstrate that QCoFr not only consistently achieves better performance but also provides interpretability that aligns with our theoretical analysis.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 23 Oct 2025.
Builds on
28 of 49 references.
References · 28
- 2016Deep Variational Information Bottleneckcited by 915
- 2018QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 697
- 2019The StarCraft Multi-Agent Challengecited by 589
- 2019QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learningcited by 372
- 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 318
- 2020QPLEX: Duplex Dueling Multi-Agent Q-Learningcited by 267
- 2018Actor-Attention-Critic for Multi-Agent Reinforcement Learningcited by 259
- 2020Benchmarking Multi-Agent Deep Reinforcement Learning Algorithms in Cooperative Taskscited by 207
- 2018Mean Field Multi-Agent Reinforcement Learningcited by 202
- 2020Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learningcited by 197
- 2019A Review of Cooperative Multi-Agent Deep Reinforcement Learningcited by 147
- 2022SMACv2: An Improved Benchmark for Cooperative Multi-Agent Reinforcement Learningcited by 118
16 more
- 2020Shared Experience Actor-Critic for Multi-Agent Reinforcement Learningcited by 114
- 2021Celebrating Diversity in Shared Multi-Agent Reinforcement Learningcited by 96
- 2019Shapley Q-value: A Local Reward Approach to Solve Global Reward Gamescited by 71
- 2019Hierarchical Cooperative Multi-Agent Reinforcement Learning with Skill Discoverycited by 42
- 2022Scalable Multi-Agent Reinforcement Learning for Warehouse Logistics with Robotic and Human Co-Workerscited by 28
- 2021SHAQ: Incorporating Shapley Value Theory into Multi-Agent Q-Learningcited by 26
- 2019Action Semantics Network: Considering the Effects of Actions in Multiagent Systemscited by 19
- 2023Multi-Robot Cooperative Socially-Aware Navigation Using Multi-Agent Reinforcement Learningcited by 15
- 2023NA2Q: Neural Attention Additive Model for Interpretable Multi-Agent Q-Learningcited by 14
- 2019AI for Explaining Decisions in Multi-Agent Environmentscited by 12
- 2022MAVIPER: Learning Decision Tree Policies for Interpretable Multi-Agent Reinforcement Learningcited by 12
- 2022Spatial-Temporal-Aware Safe Multi-Agent Reinforcement Learning of Connected Autonomous Vehicles in Challenging Scenarioscited by 12
- 2022Stable and Efficient Shapley Value-Based Reward Reallocation for Multi-Agent Reinforcement Learning of Autonomous Vehiclescited by 11
- 2022MIXRTs: Toward Interpretable Multi-Agent Reinforcement Learning via Mixing Recurrent Soft Decision Treescited by 10
- 2024Optimizing Interpretable Decision Tree Policies for Reinforcement Learningcited by 4
- 2025CoFrNets: Interpretable Neural Architecture Inspired by Continued Fractionscited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.