SYNTHESIS NOTE
Agentic Systems and Tool Use

Why do multi-agent systems fail to coordinate at scale?

Explores how LLM agents struggle to synchronize strategy timing and validate information when coordinating across larger networks, revealing fundamental limits in distributed reasoning.

Synthesis note · 2026-02-23 · sourced from Agents Multi Architecture

AgentsNet is a benchmark that applies classical distributed computing problems (graph coloring, leader election) to LLM multi-agent systems. The setup uses the LOCAL model: synchronous rounds, each agent communicates only with immediate neighbors, decisions based exclusively on locally aggregated information. This is the most fundamental distributed coordination setting.

Three findings reveal how LLM agents behave as distributed systems:

Finding 1: Strategy coordination is the essential challenge. Agents fail to coordinate in two distinct ways: (a) they agree on a common strategy too late during message-passing, leaving insufficient rounds for implementation, and (b) they assume a strategy in their initial chain-of-thought and follow it throughout without informing neighbors — private reasoning that never becomes shared coordination.

Finding 2: Agents generally accept neighbor information uncritically. When neighbors share information about the network, proposed strategies, or candidate solutions, agents accept it without verification. This enables effective coordination when information is correct, but propagates errors when agents share incorrect assumptions about network topology or ineffective strategies.

Finding 3: Agents can detect and resolve inter-neighbor inconsistencies. Despite uncritical acceptance, agents demonstrate capability to detect conflicting solutions (e.g., conflicting color assignments) between neighbors and assist in resolving them. This reactive error detection contrasts with the proactive error propagation in Finding 2.

Frontier LLMs demonstrate strong performance for small networks but fall off as network size scales. The benchmark supports up to 100 agents and is practically unlimited in size, designed to scale with future model generations.

The connection to Why do multi-agent LLM systems converge without genuine deliberation? is direct: uncritical acceptance of neighbor information is the distributed-systems manifestation of silent agreement. Agents converge on shared solutions without genuine deliberation, whether through accepting neighbor assertions (AgentsNet) or through premature convergence in debate rounds (silent agreement).

Inquiring lines that use this note as a source 154

This note is a source for these synthesized inquiries. Follow a line forward into its question, or open it to trace back to all of its sources.

Related concepts in this collection 5

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
14 direct connections · 96 in 2-hop network ·medium cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

distributed multi-agent coordination degrades predictably with network scale — agents fail to coordinate strategy timing and uncritically accept erroneous neighbor information