CORTEXA
← Browse
arxivcs.AIcs.CLcs.MAeess.SYmath.OC2026-07-07

How Much Does Correctness Cost? Budgeted Placement of Strong Correctors in a Weak Multi-Agent Swarm

Igor Itkin

A cheap swarm of unreliable agents can be steered to a correct consensus by a few strong, expensive "oracle" correctors. We ask how much one must spend, and where to place the oracles. We model the swarm as a consensus on a graph in which each oracle pins one node toward the truth at a cost-coupled, concave strength, and measure quality by the coherence H(R)=tr M(R)^{-1}. Our first result is that H stays submodular (each added oracle helps less than the last) even when the oracles differ in strength, so a cost-benefit greedy comes within 1-1/e of the best placement at any budget. Inverting the budget gives the budget-correctness frontier B*(eps), the least spend that guarantees an eps-correct consensus: closed-form on the complete graph, and a minimal oracle count k* when oracles cost the same. Whether a budget then buys a few strong oracles or many medium onese curvature of the cost-quality law: diminishing returns favour spreadsharply increasion. Measured onthe Qwen3 ladder (0.6-32B), the law is concave for math verificatio convex foremergent code tracing, so the verdict is genuinely task-dependent.https://github.com/YehudaItkin/budgeted-oracle-placemen

View free PDFSource page

Related papers

arxivcs.CLcs.AIcs.MA2026-07-09

WebSwarm: Recursive Multi-Agent Orchestration for Deep-and-Wide Web Search

Xiaoshuai Song, Liancheng Zhang, Kangzhi Zhao, Yutao Zhu, Zhongyuan Wang, Guanting Dong, et al.

Large language model (LLM)-based web search agents are transforming information seeking from simple factoid question answering into complex, deep-and-wide search and research-oriented tasks. A single ReAct-style agent is constrained by one long trajectory and limited context, mak…

View free PDFSource page
arxiveess.SYcs.MAmath.OC2026-07-21

How network perturbations distort agreement trajectories in LTI multi-agent systems

Gal Barkai, Irinel-Constantin Morărescu

Distributed coordination of multi-agent systems frequently relies on cooperative protocols designed to achieve agreement on a prescribed, non-trivial trajectory. While the robustness of such protocols to various uncertainties is well documented, existing literature universally as…

View free PDFSource page
arxivcs.AIcs.CLcs.LGcs.MA2026-07-07

Norm Enforcement for AI Agents: Robustly Shaping Behavior in Multi-Agent Systems

Yaowen Ye, Jacob Steinhardt

AI agents are increasingly deployed in shared environments where they pursue diverse goals and compete for rewards. This multi-agent competition can lead to behaviors that serve individual gains at collective cost -- for instance, marketing agents may post misleading content as a…

View free PDFSource page
arxivcs.MAcs.AIcs.CYcs.DCeess.SY2026-07-19

The Optimization Trilemma: Efficiency, Comfort and Fairness in Decentralized Multi-agent Coordination

Jovan Nikolic, Maciej Krzysztof Zuziak, Evangelos Pournaras

The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems. Resource allocation is based on optimized collective arrangements accounting for agents' needs. Such coordination should not…

View free PDFSource page
arxivcs.AIcs.CLcs.MAcs.MM2026-06-28

Mixture of Debaters: Learn to Debate at Architectural Level in Multi-Agent Reasoning

Dayong Liang, Kaisong Gong, Yi Cai, Changmeng Zheng, Xiao-Yong Wei

Existing multi-agent debate frameworks suffer from two critical limitations: they rely on static architectures where agent roles and coordination patterns are fixed at design time, and they require instantiating multiple model copies, incurring substantial computational overhead.…

View free PDFSource page