Scaling Small Agents Through Strategy Auctions
Lisa Alazraki, Shen, Yoram Bachrach, Akhil Mathur
Abstract
Small language models are increasingly viewed as a promising, cost-effective approach to agentic AI, with proponents claiming they are sufficiently capable for agentic workflows. However, while smaller agents can closely match larger ones on simple tasks, it remains unclear how their performance scales with task complexity, when large models become necessary, and how to better leverage small agents for long-horizon workloads. In this work, we empirically show that small agents' performance fails to scale with task complexity on deep search and coding tasks, and we introduce Strategy Auctions for Workload Efficiency (sale), an agent framework inspired by freelancer marketplaces. In sale, agents bid with short strategic plans, which are scored by a systematic cost-value mechanism and refined via a shared auction memory, enabling per-task routing and continual self-improvement without training a separate router or running all models to completion. Across deep search and coding tasks of varying complexity, sale reduces reliance on the largest agent by 52%, lowers overall cost by 35%, and consistently improves upon the largest agent's pass@1 with only a negligible overhead beyond executing the final trace. In contrast, established routers that rely on task descriptions either underperform the largest agent or fail to reduce cost, often both, underscoring their poor fit for agentic workflows. These results suggest that while small agents may be insufficient for complex workloads, they can be effectively "scaled up" through coordinated task allocation and test-time self-improvement. More broadly, they motivate a systems-level view of agentic AI in which performance gains come less from ever-larger individual models and more from market-inspired coordination mechanisms that organize heterogeneous agents into efficient, adaptive ecosystems.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 61d5d9ef-264c-428a-94b5-e5df16592e3aCited by top-tier papers1
Ask how each one uses itBuilds on16
- GAIA: a benchmark for General AI AssistantsGrégoire Mialon, Clémentine Fourrier, Thomas Wolf, Yann LeCun et al.ICLR 2024 · 716 citations
- Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM ReasoningShenzhi Wang, Le Yu, Chang Gao, Chujie Zheng et al.NeurIPS 2025 · 592 citations
- When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric MemoriesAlex Mallen, Akari Asai, Victor Zhong, Rajarshi Das et al.ACL 2023 · 233 citations
- Reasoning with Exploration: An Entropy PerspectiveDaixuan Cheng, Shaohan Huang, Xuekai Zhu, Bo Dai et al.AAAI 2026 · 216 citations
- Measuring AI Ability to Complete Long Software TasksThomas Kwa, Ben West, Joel Becker, Amy Deng et al.NeurIPS 2025 · 160 citations
Related papers
- When AI Agents Compete for Jobs: Strategic Capabilities and Economic Dynamics of AI Labour MarketsChris Chiu, Simpson Zhang, Mihaela van der SchaarICML 2026
- Shapley-Coop: Credit Assignment for Emergent Cooperation in Self-Interested LLM AgentsYun Hua, Haosheng Chen, Shiqin Wang, Wenhao Li et al.NeurIPS 2025 · 13 citations
- EffGen: Enabling Small Language Models as Capable Autonomous AgentsGaurav Srivastava, Aafiya Hussain, Chi Wang, Yingyan (Celine) Lin et al.ICML 2026
- EvoRoute: Experience-Driven Self-Routing LLM Agent SystemsGuibin Zhang, Haiyang Yu, Kaiming Yang, Bingli Wu et al.ACL 2026 · 6 citations
- SwarmAgentic: Towards Fully Automated Agentic System Generation via Swarm IntelligenceYao Zhang, Chenyang Lin, Shijie Tang, Haokun Chen et al.EMNLP 2025 · 2 citations
