Skip to content

AllocBench: Measuring Online Tool Allocation Capability in LLM Agents

Jul 2026 · arXiv.org · Vol abs/2607.23332 · 1 citation · 33 references
Computer Science

TL;DR

A paired benchmark that tests whether LLM agents exhibit conscious allocation behavior under a fixed budget in two contexts: an abstract text-based formulation and a code-construction task finds that every frontier model testedacts near-optimally in the abstract framing but fails to transfer this ability to script-writing.

Abstract

Creating a reusable tool is an investment: an agent pays a fixed cost now in exchange for the potential of future reuse. Therefore, a user should prefer an agent that creates a small number of highly reusable tools, rather than many one-offs. We introduce a paired benchmark that tests whether LLM agents exhibit conscious allocation behavior under a fixed budget in two contexts: an abstract text-based formulation and a code-construction task. We find that every frontier model we test---Claude Haiku, Claude Opus, GPT-5.4-mini, and GPT-5.6 Sol---acts near-optimally in the abstract framing but fails to transfer this ability to script-writing. Through further experiments, we identify the particular failure modes for each model. Notably, the first three models fail even when the scripts are not evaluated, while GPT-5.6 Sol stays selective under that weaker manipulation and collapses only at full construction. Furthermore, an open-source Qwen model policy-trained for abstract allocation generalizes this ability across held-out lexical variations, but sees no improvement at script allocation. Together, these results establish online tool allocation as a significant capability boundary, even for modern frontier models.

View source

Similar papers

Preprint Aug 2026

EcoAgent-Bench: Evaluating Economic Decision-Making in Budget-Constrained LLM Agents

EcoAgent-Bench is introduced, in which every task specifies priced actions and an explicit budget, and results show that completion under a budget and economical action selection are distinct properties.

Jie Wu, Ming Gong, Feixiang Cheng et al. · 0 citations
Preprint Aug 2026

Control Under Compression: Reliability Frontiers for Tool-Using Agents

CompressAgent is introduced, an environment-verified benchmark for ACC compression across nine independently constructed ACCs, three task families, three fixed Qwen API model identifiers, six retained-context budgets, and 15,525 runs, uncovering a nonlinear, method-dependent reliability frontier.

Ying-Han Hou, Zong-You Yang · 2 citations
Preprint Jul 2026

MetaRoute-Bench: Evaluating Meta-Decision Policies for Agentic Workflow Routing

This work presents MetaRoute-Bench, an open, inspectable framework for comparing meta-decision policies under a shared execution model, and releases task generation, policies, traces, tests, and analysis artifacts to support live-system validation.

Natan Vidra, Alina Kapanova, Arun Kanhai et al. · 0 citations
Preprint Aug 2026

CoBa: Cost-Effective Test-Time Scaling via Compute-Balanced Routing

This paper formulates test-time reasoning as a compute-allocation problem in which a system must decide whether the next unit of compute should be spent on generation, verification, or stopping, and introduces CoBa, a compute-balanced routing policy that first obtains a small set of candidates, applies cheap verification broadly, and routes uncertain or high-value candidates to stronger verification.

Yan Zhou, O. Yue, Kaiyang Zheng et al. · 0 citations
Jul 2026

ICAE-Bench: Evaluating Coding Agents as Interactive Project Builders

ICAE-Bench, a benchmark for evaluating coding agents under interactive project-building settings, starts from a fuzzy product requirement, simulating the dynamic paradigm with an automated User Agent, and introduces three key designs.

Zhongyuan Peng, Dan Huang, Chuyu Zhang et al. · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.