cs.MASep 15, 2026

Decomposition Buys Integrity, Not Yield

Authors: Rong He

Abstract

Multi-agent systems split a task across a tree of agents and justify the split with folklore: smaller contexts, cleaner separation, parallelism. We ask what the split does to how much of what the leaves discover reaches the root. Model a decomposition as a tree in which an agent handed bb items keeps any one with probability r(b)r(b). If r(b)=1/br(b)=1/b, every tree delivers exactly one finding, for every task size and every shape; we verify this to 2.4×10152.4 \times 10^{-15} on 20,000 random irregular trees. If r(b)=Cbδr(b)=Cb^{-δ}, a depth-kk tree over NN findings yields CkN1δC^k N^{1-δ}: task size and architecture separate, and architecture contributes only C1C \le 1 per level, so flat is optimal for yield and no arrangement of agents escapes the exponent δδ. On 600 production deep-research traces δ=0.34δ= 0.34 [0.30, 0.38], by three identifications that do not share a failure mode. At a hop where item boundaries come from the tool rather than a text heuristic, and where b=1b=1 occurs 550 times, C=0.571C = 0.571 [0.527, 0.615] is observed rather than extrapolated, over 16,082 hops. A tier also costs alignment: on 1,012 annotated multi-agent traces one brief in sixteen goes off-target, giving μ=0.939μ= 0.939 and a per-tier penalty Cμ=0.536Cμ= 0.536. Depth is bought on two other axes. The root context is the only state that persists and the only one that cannot cheaply forget, and depth cuts its exposure from NN items to N1/kN^{1/k}. Depth is also cheaper: production flat agents bill as N1.39N^{1.39}, not the N2N^2 an append-only context predicts, and at equal spend two tiers overtake flat at 403 findings. Across every parameter we measured the model says 0.7% to 11.3% of production sessions are worth delegating, against 7.8% that do. A hazard model on 743,819 production tool calls finds that delegation does not respond to a filling context and is instead an opening move.

Explore similar work

Oct 14, 2025cs.MA

Benefits and Limitations of Communication in Multi-Agent Reasoning

Chain-of-thought prompting has popularized step-by-step reasoning in large language models, yet model performance still degrades as problem complexity and context length grow. By decomposing difficult tasks with long contexts into shorter, manageable ones, recent multi-agent paradigms offer a promising near-term solution to this problem. However, the fundamental capacities of such systems are poorly understood. In this work, we propose a theoretical framework to analyze the expressivity of multi-agent systems. We apply our framework to three algorithmic families: state tracking, recall, and kk-hop reasoning. We derive bounds on (i) the number of agents required to solve the task exactly, (ii) the quantity and structure of inter-agent communication, and (iii) the achievable speedups as problem size and context scale. Our results identify regimes where communication is provably beneficial, delineate tradeoffs between agent count and bandwidth, and expose intrinsic limitations when either resource is constrained. We complement our theoretical analysis with a set of experiments on pretrained LLMs using controlled synthetic benchmarks. Empirical outcomes confirm the tradeoffs between key quantities predicted by our theory. Collectively, our analysis offers principled guidance for designing scalable multi-agent reasoning systems.
Michael Rizvi-Martel, Satwik Bhattamishra, Neil Rathi +2
Apr 29, 2026cs.RO

Split over n resource sharing problem: Are fewer capable agents better than many simpler ones?

In multi-agent systems, should limited resources be concentrated into a few capable agents or distributed among many simpler ones? This work formulates the split over nn resource sharing problem where a group of nn agents equally shares a common resource (e.g., monetary budget, computational resources, physical size). We present a case study in multi-agent coverage where the area of the disk-shaped footprint of agents scales as 1/n1/n. A formal analysis reveals that the initial coverage rate grows with nn. However, if the speed of agents decreases proportionally with their radii, groups of all sizes perform equally well, whereas if it decreases proportionally with their footprints, a single agent performs best. We also present computer simulations in which resource splitting increases the failure rates of individual agents. The models and findings help identify optimal distributiveness levels and inform the design of multi-agent systems under resource constraints.
Karthik Soma, Mohamed S. Talamali, Genki Miyauchi +3
Jul 8, 2026cs.CL

Think Big, Search Small: Where Capacity Matters in Hierarchical Search Agents?

Large language model based search agents increasingly adopt multi-agent architectures in which a main agent decomposes a complex question into sub-queries and dispatches them to parallel sub-agents. However, existing systems instantiate all roles from a single model of identical scale, leaving open how model capacity should be distributed across roles. We factorize hierarchical search into three roles: a delegation role responsible for task decomposition, an execution role responsible for retrieval and evidence extraction, and an answer generation role held fixed as a confound control. We then conduct controlled capacity sweeps along the delegation and execution axes on five multi-hop QA benchmarks. The experiments yield three findings. First, role factorization consistently outperforms a single-agent baseline, improving exact match from 4.5 to 8.6 points across six model scales. Second, capacity sensitivity is asymmetric: scaling the delegation backbone improves EM by ~11 points, whereas scaling the execution sub-agent moves EM by only ~2.6 points, identifying decomposition as the capability bottleneck. Third, a 1.7B-parameter executor trained via quality-filtered trajectory distillation matches a frontier sub-agent in accuracy while consuming 37% fewer sub-agent tokens, advancing the Pareto frontier. These results suggest a concrete recipe for building hierarchical search agents: concentrate capacity at delegation and downsize execution without sacrificing accuracy. Our code is available at https://github.com/QinnanCai0115/role-factorized-search.
Qinnan Cai, Yibo Zhao, Xiang Li