Sequential Allocation for Agent Routing: UCB Dispatch and Its Limitations
We treat specialist-agent dispatch as a stochastic multi-armed bandit and restate the UCB1 regret bound of Auer, Cesa-Bianchi, and Fischer. The note is an orientation: we do not claim a new LLM-specific theorem.
The editors routing bandits evaluation