Multi-agent language systems are often deployed under the assumption that collaboration improves reasoning quality, but this assumption breaks down once token cost, latency, and collaboration-induced errors enter the picture. We study protocol selection under a cost-aware utility objective, where the system decides on each input whether to run a collaborative protocol or fall back to solo reasoning. We propose Causal Advantage Routing for Language agents (CARL), a contextual-bandit framework that estimates the conditional collaboration advantage of each protocol over solo reasoning. CARL combines confounded execution logs with budgeted randomized probes, forms one-vs-solo doubly robust scores and shrunken DR-derived pseudo-outcomes, and at deployment uses a one-sided predictive lower bound for a future realized protocol-solo contrast, otherwise abstaining to solo execution. Across math, code, and multi-hop question-answering benchmarks with an open-weight model, CARL improves cost-aware utility and substantially reduces harmful collaboration over fixed protocols, compute-matched solo strategies, MAS routers, cascade methods, and causal routing baselines, indicating that effective multi-agent systems should estimate when collaboration is causally worth its cost rather than invoking it by default.

Practical video editing is not only pixel generation: an editor must turn a brief, a clip pool, music metadata, and hard constraints into an executable timeline. We study this decision layer as executable video-editing planning and introduce RefineCut, which, unlike workflow systems that wrap a prompted frontier model, trains a compact open-weight planner for it. The planner edits a typed timeline through structured patches covering clip selection, trimming, ordering, transitions, and duration and music alignment; a deterministic verifier applies each patch and checks it against an explicit constraint ledger. Because editing has no single ground-truth repair, we do not imitate teachers directly: RefineCut replays every multi-teacher branch through the verifier and keeps verifier-best repairs as supervision. A second stage, RefineCut-Evo, lets the student score its own repairs with the verifier and a task rubric and trains on high-margin preference pairs, so the final 8B planner runs in a closed verifier loop with no teacher calls at inference. On RefineCut-Bench (3,578 tasks, 7,971 captioned clips, 499 music tracks, explicit ledgers), verifier-replayed distillation lifts the planner from 0.620 to 0.858 on the protocol-specific Video-Editing Score and RefineCut-Evo reaches 0.924; the gain transfers to Llama-3.1-8B and GLM-4-9B, and in the same closed loop the 8B planner matches or exceeds its frontier teachers. Code and RefineCut-Bench are publicly released; see the Data Availability statement.