AI agents serving several tasks must decide which uncertainties justify a shared question budget. We compare modal planning, which selects a most-likely answer before choosing an action, with branching planning, which enumerates answer probabilities and expected losses. A prospectively specified local-model study records 896 episodes on 64 five-task queues from 16 held-out authored templates, with budgets of one or two questions and deterministic simulated replies. Both instructions share tasks, tools, loss scales and decoding settings. Branching reduces gemma's mean queue loss from 3.031 to 2.164 (Holm-adjusted template sign-flip 𝑝 = 0.014); the gpt-oss contrast is-0.114 (𝑝 = 0.73). A CPU allocator using the same elicited probabilities has the lowest observed mean loss in both bundles. Exploratory audits separate probability-vector validity, disagreement with visible base rates, and expected action loss relative to a conditional public-information reference. Fixed-policy price sensitivity and recorded token/latency costs show that a loss advantage and computational efficiency are distinct. A supporting 432-execution scripted census isolates short-horizon timing under queued service. Together, the evidence identifies question placement and explicit allocation as the operational link between additional model deliberation and lower queue loss under the stated task and response contracts.