When Agents Disagree: The Selection Bottleneck in Multi-Agent LLM Pipelines
Authors: Artem Maryanskyy, Dmitry Budnikov, Alibek T. Kaliyev
Organizations: Uber Technologies, Sunnyvale, CA 94085, USA · Laboratories of Electrical, Thermal Technologies and Energy Saving, Federal Scientific Agroengineering Center VIM, 109428 Moscow, Russia · Department of Computer Science, University of Texas at Austin, Austin, TX 78712, USA
Multi-agent LLM pipelines produce contradictory evidence on whether team diversity improves output quality: heterogeneous Mixture-of-Agents teams outperform single models, yet homogeneous Self-MoA teams consistently win under synthesis-based aggregation. We propose a resolution by identifying the selection bottleneck -- a crossover threshold in aggregation quality that determines whether diversity helps or hurts. Under this model, we obtain a closed-form crossover threshold s∗ (Proposition 1) that separates the regimes where diversity helps and hurts. In a targeted experiment spanning 42 tasks across 7 categories (N=210), a diverse team with judge-based selection achieves a win rate of 0.810 against a single-model baseline, while a homogeneous team scores 0.512 -- near chance (Glass's Δ=2.07). Judge-based selection outperforms MoA-style synthesis by ΔWR=+0.631 -- the synthesis approach is preferred over the baseline in zero of 42 tasks by the judge panel. A decoupled evaluation with independent judges confirms all directional findings (Spearman ρ=0.90). Exploratory evidence suggests that including a weaker model improves performance while reducing cost (p<10−4, not pre-registered). Our results suggest that selector quality may be a more impactful design lever than generator diversity in single-round generate-then-select pipelines.
Figures & tables
Figure 1: The selection bottleneck. (a) Theoretical output quality Q(T,s) as a function of selector quality s . The diverse team (blue) crosses the homogeneous baseline (gray) at the crossover threshold s∗ (dashed vertical). Below s∗ , diversity hurts; above it, diversity helps. (b) Empirical operating regimes from V4 data. Judge-based selection operates well above s∗ (WR = 0.810), majority vote sits near s∗ (WR = 0.496), and MoA-style synthesis falls far below it (WR = 0.179). The homogeneous baseline (WR = 0.512, dotted) is shown for reference.
Cell
Agents
Selector
Tests
div_strong+judge
Opus + GPT-5.4 + Gem.-Pro
Judge panel
Reference
homo_opus+judge
Opus ×3
Judge panel
Diversity effect
div_mixed+judge
Opus + Gem.-Pro + Haiku
Judge panel
Weak-model effect
div_strong+vote
Opus + GPT-5.4 + Gem.-Pro
Majority vote
Judge vs. vote
div_strong+synth
Opus + GPT-5.4 + Gem.-Pro
MoA synthesis
Selection vs. synthesis
Table 1: Experimental design. Five cells test specific hypotheses by varying one factor relative to the reference cell. Each cell is evaluated on all 42 tasks ( N=42 per cell, N=210 total).
Cell
Original WR
Decoupled WR (2J)
Decoupled WR (3J)
div_mixed+judge
0.929
0.726
0.722
div_strong+judge
0.810
0.611
0.500
div_strong+vote
0.496
0.506
0.389
homo_opus+judge
0.512
0.500 †
0.000 †
div_strong+synth
0.179
0.312
0.119
† All pairwise verdicts are ties; independent judges cannot distinguish homogeneous outputs.
Table 2: Original vs. decoupled win rates. Decoupled WR uses an independent 2-judge panel (Gemini 2.0 Flash + GLM-5); 3-judge panel values (including degenerate GPT-4o-mini, 99.6% tie rate) shown for completeness. All directional contrasts survive; Spearman ρ=0.90 (2-judge panel).
Figure 2: BT-corrected consensus win rates for all five experimental cells, averaged over 42 tasks. High performance appears only when diversity and judge-based selection are combined. The synthesis cell (MoA) performs worst, falling well below the single-model baseline.
Cell
Sonnet
GPT-5m
DeepSeek
Mean
κˉ
div_strong+judge
0.958
0.756
0.595
0.770
0.095
homo_opus+judge
0.500
0.518
0.619
0.546
0.667
div_mixed+judge
0.994
0.893
0.631
0.839
0.175
div_strong+vote
0.492
0.496
0.512
0.500
0.236
div_strong+synth
0.234
0.131
0.345
0.237
0.263
Table 3: Per-judge win rates by cell. κˉ is the mean pairwise Cohen’s κ measuring inter-rater agreement.
Figure 3: Per-task diversity advantage ( Δ WR = diverse_strong+judge minus homo_opus+judge ) across all 42 tasks. Positive values favor diversity. 38 of 42 tasks show a positive effect (4 ties, 0 negative; Clopper–Pearson 95% CI: [0.774, 0.973]). Error bars are approximate 95% CIs.
OLS (HC3)
MixedLM
Intercept ( homo_opus+judge )
0.512∗∗∗ (0.008)
0.512∗∗∗ (0.024)
diverse_strong+judge
+0.298∗∗∗ (0.024)
+0.298∗∗∗ (0.035)
diverse_mixed+judge
+0.417∗∗∗ (0.022)
+0.417∗∗∗ (0.035)
diverse_strong+synth
−0.333∗∗∗ (0.029)
−0.333∗∗∗ (0.035)
diverse_strong+vote
−0.016 (0.037)
−0.016 (0.035)
Task var. ( σ^2 )
—
≈0
Table 4: Regression results. Reference category: homo_opus+judge (intercept). All effects stable across specifications; task variance ≈0 . ∗∗∗p<0.001 .
Configuration
Rel. Cost
BT-WR
95% CI
div_mixed+judge †
1.0×
0.929
[0.887, 0.964]
div_strong+judge
2.5×
0.810
[0.768, 0.851]
homo_opus+judge
2.0×
0.512
[0.500, 0.530]
div_strong+vote
1.9×
0.496
[0.425, 0.563]
div_strong+synth
1.9×
0.179
[0.127, 0.234]
Table 5: Relative cost vs. quality across experimental cells ( 1.0× = cheapest cell). diverse_mixed+judge is both the best-performing and cheapest configuration. † Exploratory (not pre-registered).
Does multi-agent LLM interaction help or hurt? Some work reports gains from debate (Du et al., 2024), critique loops (Chen et al., 2025), and mixture-of-agents synthesis (Wang et al., 2025), while other work finds that interaction adds cost without improving quality under equal budgets (Tran & Kiela, 2026; Xu et al., 2026; Jarrett et al., 2025), or that independent sampling already captures multi-agent gains (Li et al., 2024). We argue this contradiction partly reflects a missing distinction, because not all multi-agent communication is equal. Different model families find structurally different solutions, but when agents read each other's complete outputs, their proposals converge within one round, erasing the diversity that motivates using multiple models. We call this the interaction tax. We test 11 verifier-scored optimization tasks under matched budgets and find that full-solution interaction is a weak default. Independent proposal generation avoids this collapse. Full-solution interaction mainly makes agents stay close to the first solution they see instead of trying different approaches, and critique helps only if the violated rule is easy for the LLM to find and fix. These 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, Chenhao Tan
Department of Computer Science, University of Chicago, Chicago, IL, USA.
The performance ceiling of an LLM team is constrained not only by individual model capabilities, but also by inter-member error resonance and predictive differences. Although heterogeneous teaming is often observed to be effective in practice, existing approaches lack complementarity metrics that are computable, interpretable, and optimizable, leaving team composition to rely on heuristics. We propose a heterogeneity-driven team selection framework that performs offline profiling to characterize individual capability along with two complementary signals: one captures decorrelation in error patterns to reduce co-failures, while the other measures divergence in predictive behavior to capture strategy diversity. We formulate team selection as a standardized quality--complementarity combinatorial objective and apply an efficient greedy search to select a small team from a candidate pool. Experiments across multiple benchmarks demonstrate that our framework consistently outperforms quality-only baselines under controlled candidate pools and team sizes, establishing reusable selection principles for multi-LLM systems.
Multi-agent debate (MAD) reportedly improves reasoning and factuality over single-model inference, but prior work treats agents as symmetric peers, leaving open what drives the gains. We test the hypothesis that cognitive diversity among agents is the driver, in the setting where the question is still measurable: small open-weight models with benchmark headroom. Across 23 models from eleven vendor families, five tasks, and 5,500+ debate and control runs, we vary diversity along three axes - personas, sampling temperature, and model identity - pairing every debate configuration with a generation-budget-matched majority-vote control. The hypothesis is rejected on every axis. Debate beats single-agent inference (3--7 points where tasks have headroom) but at matched budget conditions it ties or even loses to self-consistency sampling at 1.6× the wall-clock and 3.4× the token cost. Persona prompting reduces accuracy and a dose-response experiment over each model's full combinatorial persona space shows the cost is a persona tax, not a diversity tax: redundant personas hurt most, while maximally-diverse teams recover part of the loss. Furthermore, mixed-model teams lose to majority votes over their own rosters, with accuracy tracking member capability rather than heterogeneity, and nearly all of debate's benefit comes from the first exchange of answers. We further identify a pervasive measurement hazard in which debate transcripts silently overflow serving context windows, whose correction alone moves our debate-versus-sampling comparison from −1.8 points to parity. Our results recast reported MAD gains as an ensemble-sampling effect and provide the budget-matched, contamination-checked baseline bar that future debate mechanisms should be required to clear.
Leonardo Ferreira, Gardenia Liu, Kaden Zheng
Boston Children’s Hospital, Harvard Medical School · Harvard School of Engineering and Applied Sciences, Harvard College