Skip to content

Similar papers

#artificial intelligence Preprint Sep 2026

Safety of Latent Communication in Multi-Agent Systems

Latent communication enables multi-agent systems to exchange information directly in internal representation space, reducing the token, computation, and latency overhead of text-based communication. To this end, lightweight trainable links are introduced to map the sender's representations into the receiver's input spa...

M. Huzaifa, Sina Mavali, Thorsten Eisenhofer · 0 citations
#artificial intelligence Preprint Oct 2026

MASBench: Benchmarking LLM-based Multi-Agent Collaboration under Partial Observability

Large language models (LLMs) have progressively evolved into the core of autonomous agents. Building on this progress, LLM-based multi-agent systems (MAS) coordinate multiple agents into a synergistic team to accomplish complex tasks that exceed the capabilities of individual agents. The effectiveness of such systems d...

Qi-Zhi Chu, Ze-Kai Yu, Si-Jie Wen et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SoK: When Safe Agents Fail Together: The Security of Multi Agent LLM Systems

This work systematizes MAS security through an execution-centered analysis of 197 works, introducing an A-I-R framework that organizes attacks by adversary position, interaction interface, and resulting system-level risk, unifying otherwise fragmented attack mechanisms across MAS.

Rui Yang, Jun-Jie Xu, Zheng-Yu Liu et al. · 3 citations
#artificial intelligence Preprint Oct 2026

Token-Efficient Multi-Agent Collaboration via System One-Guided Computational Division of Labor

Large language model (LLM)-based multi-agent systems (MAS) have become a promising paradigm for complex information-seeking and reasoning tasks by enabling collaborative problem solving among specialized agents. However, existing MAS frameworks tightly couple task reasoning with coordination operations, including task...

Zi-Han Zhou, Xin-Zhe Hu, Han-Xu Yang et al. · 1 citation
#artificial intelligence Preprint Sep 2026

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

It is found that a simple random-without-replacement routing policy, which lets each agent debate with two distinct and newly sampled peers at every round, provides a surprisingly strong baseline and consistently improves the accuracy-cost trade-off of sparse MAD.

Bo-Xuan Wang, Zhuo-Yun Li, Xiao-Wei Huang et al. · 0 citations
Preprint Sep 2026

Certifying cooperation: a novel approach to cooperative multi-agent task generation

This framework exposes the gap between rewarded partial completion and realized cooperation by certifying what cooperation successful completion requires and using temporal cooperation graphs to reveal what policies exhibit.

Yannick Molinghen, Hugo Charels, Tom Lenaerts · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.