Skip to content

The Collaboration Tax: How Much LLM Multi-Agent Systems Pay to Coordinate

Aug 2026 · 1 citation · 40 references
Computer Science

TL;DR

The collaboration tax is formulated as the team-decentralisation loss of a two-player cooperative game with private information, with two propositions characterising its sign and its equivalence to a max-superadditivity violation.

Abstract

Multi-agent systems built from large language models are deployed widely, yet how much performance is lost when two LLMs must coordinate rather than act alone remains unclear. We formulate the collaboration tax as the team-decentralisation loss of a two-player cooperative game with private information, with two propositions characterising its sign and its equivalence to a max-superadditivity violation. We operationalise this definition on 32 solo-tractable tasks grouped by source of grounding friction and measure it on 11 models from 7 providers. The tax is structured along two no-exception axes: a category ordering across every model and a monotonic decrease with capability. The proximate mechanism is not a reasoning deficit but a four-stage conversational cascade in which agents make ungrounded claims, fail to query the partner, skip integrating both views, and accept the answer without re-derivation. The tax is mechanically predictable from conversation features and partly tractable: a prompt intervention targeting all four stages closes a substantial fraction of the gap, with the dominant bottleneck differing across categories. In heterogeneous pairs the tax is pulled toward the stronger partner rather than the additive midpoint, empirically realising the max-superadditivity violation predicted by our framework. Together these results recast collaboration in LLM systems as a measurable, predictable, and partly tractable cost.

View source

Similar papers

Jul 2026

When Do Multi-Agent Systems Help? An Information Bottleneck Perspective

This study shows that multi-agent design is fundamentally an information-bottleneck optimization problem, and explains when bounded inter-agent communication helps or hurts, and observes that MAS consistently helps when relays are near-sufficient, especially for weaker models.

Wendi Yu, Lianhao Zhou, Xiangjue Dong et al. · 0 citations
Jul 2026

Moral Hazard in Multi-Agent Language Models

CREDIT (Counterfactual Replay for Evidence-Driven Information Transfer), a mechanism-aligned multi-agent prompt-optimization algorithm that uses matched hidden-state twins and total-action replay to reward robust causal contribution rather than query frequency is introduced.

Dane Malenfant · 0 citations
#artificial intelligence Preprint Sep 2026

Bilevel Coordinated Reflection: A Game-Theoretic Approach to Multi-Agent LLM Systems

Stochastic Reflective Memory Ascent (SRMA), which accepts a candidate memory only after a grounded evaluation risk strictly decreases, is introduced and provides confidence gating for stochastic evaluation and re-anchoring guarantees for piecewise-stationary environments.

Yi-Hang Chen, Yu-Xiang Chen, Yuxuan Huang et al. · 0 citations
Preprint Aug 2026

The Interaction Tax: When Communication Erases Diversity in Multi-Agent Teams

The results suggest that multi-agent performance depends less on the number of agents than on the information they exchange, and interaction helps only when agents share the right information at the right time.

Summer Eunhyung Ann, Haokun Liu, Chen-Hao Tan · 3 citations
Preprint Aug 2026

Do LLMs Beat Nash? Testing Decentralized Coordination in Self-Play Multi-Agent Games

Large language model agents deployed without a central controller are often assumed to require communication to coordinate their actions. We ask what remains possible without it: when independent instances of the same model cannot communicate, can they still reason about their counterparts well enough to exceed the sta...

Deborah Sinishaw, Qi-Le Zhu, Edwin Meriaux et al. · 2 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

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