Zenaique

Select every lever that reduces the cost of a chatty multi-agent workflow

Multi-select·Medium·4.0 · 0·~1 min·Asked atAi21AmdAnduril
Attempt it
TL;DR

Cheaper supervisor, trimmed context, structured handoffs, and hard caps are the four reliable cost levers; adding hierarchy and tweaking temperature are not.

Memory aid
Sign in to see the mnemonic that makes this stick.
Easy to grasp

Think of a noisy office meeting that bills by the minute. You can save money four ways. Hire a cheaper chair to run the meeting. Stop printing the entire project history for everyone every round. Pass clean one-page memos instead of forwarding the full email thread. Set a hard cap on how long the meeting can run. What does not save money: adding two more chairs above the current chair (now three managers bill by the minute), or telling everyone to talk faster by being more random (they argue more and the meeting runs longer). Same logic for multi-agent LLM systems.

Concept explanation~2 min read

Everything you need to truly understand this topic: intuition, mechanics, step by step explanation, code, formulas, and worked example. Click to expand.

Cost is the single most common reason teams roll back from multi-agent to single-agent in 2026. The fix is rarely 'less ambition'; it is usually 'the same ambition, executed with the right levers'. This question separates engineers who have actually run multi-agent in production from those who have only read the marketing pages of three frameworks.

The correct answers all map to specific terms in a simple cost equation. The trap answers both sound plausible at first and both fail under any quantitative analysis.

One-line summary: cost in a multi-agent system is hops * supervisor + sum(workers). The four real levers attack those terms. Everything else is folklore.

The cost equation, in honest detail

The shape

For a supervisor and workers run that takes N hops, total tokens are approximately

TtotalN(Csup+Osup)+h=1N(Cw,h+Ow,h)T_{total} \approx N \cdot (C_{sup} + O_{sup}) + \sum_{h=1}^{N} (C_{w,h} + O_{w,h})

where C_sup is the supervisor's input context per hop, O_sup is its output, and C_w,h, O_w,h are the corresponding worker terms. Dollar cost is T_total multiplied by the appropriate per-token price, which differs across the supervisor and workers if you route to different models.

Where the dominant terms live

In practice, C_sup grows quickly because the supervisor accumulates message history. C_w,h for any given worker is bounded by how much you choose to pass. O_sup is small (a routing decision). O_w,h is usually the worker's main output and is task-bounded.

What this implies for levers

Any lever that does not reduce one of these terms (or the multiplier in front of them) is not a cost lever. That is the framework for the rest of the analysis.

The four real levers and which term they attack
Why the two trap answers are wrong
Measurement, defaults, and when to stop optimising
Sign in to unlock the full deep dive.

Situations where this technique stops working.

Sign in to see when this approach fails.

2–4 min · Everything important, quickly.

Sign in to see the quick scan of the deep dive.
LeverEffect on cost equationReal or trap
Cheaper supervisor modelMultiplier on largest hop-level termReal
Trim per-agent contextCuts *_context across all hopsReal
Structured (typed) handoffsCuts supervisor context, removes recovery hopsReal
max_turns and max_handoffs capsBounds worst-case hop countReal
Add more supervisor layersMultiplies supervisor cost per hopTrap
Raise temperatureNo causal effect on hop count; may lengthenTrap

Real products, models, and research that use this idea.

  • Anthropic's published agent-design guidance recommends mixing Haiku for routing or summarisation with Sonnet or Opus for the hard reasoning steps.
  • LangGraph's create_supervisor lets you pass a different `llm` to the supervisor than to each worker, exactly to support heterogeneous routing.
Sign in to see more production examples.

What an interviewer would ask next. Try answering before peeking at the approach.

QHow would you actually measure whether your cost optimisations worked?
A

Track per-run tokens by agent (supervisor vs each worker), per-run cost in dollars, and hop count. Plot the distribution, not just the mean. Cheaper supervisor should drop supervisor tokens by a multiple; typed handoffs should drop supervisor input tokens; caps should clip the tail of the hop-count distribution.

2 more follow-ups an interviewer would ask next. Sign in to reveal them.

Red flags & common mistakes

The phrases that signal junior thinking. Click to expand.

Most common mistake

Reaching for more hierarchy to fix routing quality. Every layer adds an LLM call per hop, so you are multiplying the cost you are trying to control.

Sign in to see all red flags and common mistakes.

60 second bullets to scan on the way to the call.

  • The rough cost equation for supervisor plus workers (hops times supervisor cost plus worker costs)

  • Why heterogeneous routing (cheap supervisor, strong workers) is usually the biggest single win

Sign in to unlock the revision sheet.

Primary sources. Browse if you want the original framing.

Similar questions

Same topic, related formats. Practice these next.

4 curated
Next question
Estimate the per call cost of a typical RAG chatbot using GPT-4o-mini.
Flashcard·Easy