← Back to all news
arXiv AI By Wei Duan, Junyu Xuan, En Yu, Xiaoyu Yang, Jie Lu

Heterogeneous Information-Bottleneck Coordination Graphs for Multi-Agent Reinforcement Learning

Read the original on arXiv AI →

arXiv:2605. 17393v2 Announce Type: replace Abstract: Coordination graphs are a central abstraction in cooperative multi-agent reinforcement learning (MARL), yet existing sparse-graph learners lack a theoretically grounded mechanism to decide which edges should exist and how much information each edge should carry.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Jun 2

Coordination Graphs for Constrained Multi-Agent Reinforcement Learning

arXiv:2606. 02337v1 Announce Type: new Abstract: Constrained Multi-agent reinforcement learning (CMARL) faces two intertwined challenges: the joint action space grows exponentially with the number of agents, and additional requirements couple agents in ways that reward structure alone does not capture.

By Santiago Amaya-Corredor, Miguel Calvo-Fullana, Anders Jonsson
agentsreinforcement-learning
More like this →
arXiv AI
Sep 24

Do We Need Complex Topology Control? Distinct-Peer Random Routing Improves Cost-Efficiency in Sparse Multi-Agent Debate

The paper investigates whether complex communication topologies are necessary for effective multi‑agent debate (MAD) among large language models. It demonstrates that a simple random-without-replacement routing policy—where each agent debates with two newly sampled peers each round—consistently improves the accuracy‑cost trade‑off in sparse MAD setups. Additionally, the study shows that lightweight deliberation stopping can further reduce inference costs without sacrificing accuracy.

By Boxuan Wang, Zhuoyun Li, Xiaowei Huang, Yi Dong
llmsagents
More like this →