Multi-agent failure modes

Confidence 0.80 · 5 sources · last confirmed 2026-09-01

Why systems of cooperating LLM agents underperform expectations — and the specific structures that fix it. The literature converges on an uncomfortable and useful conclusion: most multi-agent failure is organisational, not model-quality, so a better model does not repair it.

The deflation

2025-03-17-cemri-why-do-multi-agent-llm-systems-fail opens on it: “Despite enthusiasm for Multi-Agent LLM Systems (MAS), their performance gains on popular benchmarks are often minimal.”

2026-04-02-tran-kiela-single-agent-outperforms-multi-agent-under-equal-budgets explains why. The reported gains are confounded with test-time compute — multi-agent systems run more inference. Normalise the reasoning-token budget and the advantage largely disappears. The theoretical basis is the Data Processing Inequality: under a fixed budget with perfect context utilisation, a single agent is more information-efficient, because each agent in a chain conditions on a lossy summary rather than the source, and post-processing cannot add information. Tested across Qwen3, DeepSeek-R1-Distill-Llama and Gemini 2.5, single-agent systems consistently match or outperform on multi-hop reasoning at matched tokens.

The escape clause is the useful part, and it is a decision rule: multi-agent systems become competitive when a single agent’s effective context utilisation degrades — the problem no longer fits, the model handles long context poorly, or the context is polluted — or when you are simply willing to spend more compute. Reach for multiple agents when one context window stops being enough, and not before.

The taxonomy

2025-03-17-cemri-why-do-multi-agent-llm-systems-fail built MAST — the Multi-Agent System Failure Taxonomy — from 1,600+ annotated traces across 7 MAS frameworks, with the taxonomy derived from close analysis of 150 traces at inter-annotator agreement κ = 0.88. 14 failure modes in 3 categories:

CategoryWhat breaks
System design issuesThe architecture — role definitions, termination conditions, information flow
Inter-agent misalignmentAgents on divergent assumptions, talking past each other, undoing each other’s work
Task verificationNobody checks, or the check is inadequate — failures accepted as successes

Two of the three are coordination failures, which is why model upgrades do not fix them: they are properties of how work was divided. The third, task verification, is the seam every other part of this corpus runs into — SpecBench’s collapsed oversight surface, Merge Mommy’s verification-gap dimension, and the 46.41% of agent fixes rejected after the agent declared them done.

The prescription

2026-03-23-geng-neubig-caid-asynchronous-software-engineering-agents answers the taxonomy almost category-for-category, by porting coordination primitives human software teams already use:

CAID primitiveMAST category it closes
Centralized task delegation (dependency-aware plans from a central manager)System design
Isolated workspaces (one per subtask)Inter-agent misalignment / interference
Executable test-based verification at structured integrationTask verification

Result: +25.6% absolute over single-agent baselines on PaperBench, +14.7% on Commit0. (Frequently miscited as +26.7% / +14.3%.)

The two results are compatible, and the seam is Tran & Kiela’s own condition: reproducing a research paper or building a Python library from scratch will not fit one context window, so the degradation condition holds by construction. CAID measures inside the regime where multi-agent wins. Neither paper normalises against the other’s variable — CAID does not equalise compute, Tran & Kiela do not test context-exceeding tasks — so the honest summary is: multi-agent architecture is a response to a context-capacity constraint, and where that constraint does not bind, the extra agents are overhead.

What practitioners already do

Carson’s setup instantiates all three CAID primitives without naming them: a fresh VM per Devin session is an isolated workspace; the folder hierarchy plus paper priority list is a centralized delegation layer implemented in a human; the Land PR loop is structured integration with test-based verification. The three things worth building first are the three things CAID names.

ai-agents, agent-fleet-management, agent-harness, agent-development-lifecycle, agentic-engineering, reward-hacking.

Debates and supersession

  • CAID vs Tran & Kiela — reconciled above as a regime distinction, but the reconciliation is this wiki’s inference, not either paper’s claim. Open: a study that equalises compute and varies whether the task fits one context window.
  • Which CAID primitive carries the gain? No ablation was read. If isolation alone accounts for most of it, the prescription is far cheaper than full CAID. Open, and the highest-value question here.
  • MAST’s 14 modes are not enumerated in this wiki — only the three categories, from the abstract. Anyone building a checklist must read the paper.
  • Vintages: MAST studies GPT-4 / Claude 3 / Qwen2.5 / CodeLlama on the 2024–25 framework generation. Incidence rates will have moved; the taxonomy is the durable artifact.

A practitioner taxonomy alongside the empirical one (added 2026-09-01)

Google Cloud’s AI Builder Essentials offers a four-mode loop failure taxonomy derived from developer-support experience rather than from annotated traces. It carries no evidence, but the categories line up with MAST’s three better than the difference in rigour would predict:

Practitioner modeThe failureMAST category it maps to
Runaway loopsNo exit condition — and in 2026 the cost is tokens, not just a hung stackSystem design issues
Unverified autonomyAn agent reuses its own prior context and grades its own work — confirmation bias plus context pollutionTask verification
Vague or uncheckable goals”make this summary better” — no criterion the loop can terminate againstSystem design issues
Complexity overflowOne loop asked to do what needs an orchestration graphInter-agent misalignment, once you decompose

The fourth mode carries the operational decision this concept keeps returning to: move from loop engineering to graph engineering only when a single loop stops coping“you can put loop as part of the graph.” That is the vendor-side statement of the condition Tran & Kiela derive formally, and it is notable for being a vendor arguing against reaching for the more elaborate architecture by default.