AC

Adaptive handoffs for multi-agent systems

A delegation need not always be prose or always be structured. Routed Graph Handoff selects a typed dependency graph or natural language for each task, then relies on an executor that understands the chosen form.

Route the handoff format, not just the task

Route the handoff format, not just the task

Routed Graph Handoff: Adaptive Format Selection for Multi-Agent LLM Delegation

The system routes between a typed DAG and prose fallback. The contribution is adaptive selection; graph-only handoff is not presented as universally better.

The paper reports a 12.7-point gain on τ-bench retail and an 8.7-point gain on BrowseComp against named prose baselines.

A 155-token router call sends each task to either a 357-token typed graph handoff or a 576-token prose handoff.
Figure 1: System overview. The router (one LLM call) selects Graph (typed DAG, 2× compression) or NL (prose fallback) per task. Taken from the paper.

Read the paper page PDF Citation + BibTeX

Opportunities for future work

Future work can improve adaptive executors and routing policies for tasks that need flexible reasoning, while retaining a natural-language fallback as a useful design option.