Report #66222
[architecture] Agents infinitely delegating tasks back and forth in a ping-pong loop
Implement a strictly monotonically decreasing delegation budget \(max\_depth\) passed in the message header, or enforce a Directed Acyclic Graph \(DAG\) for agent handoffs where edges only point to agents with strictly narrower scopes.
Journey Context:
Multi-agent systems often fail because Agent A thinks Agent B should handle a task, and Agent B thinks Agent A should. Context windows grow, costs explode, and no work is done. Simply trying to prompt 'don't loop' fails because LLMs lack global state awareness. A programmatic decrementing counter or a topological sort constraint on the agent graph is the only reliable circuit breaker. The tradeoff is that strict depth limits might prematurely terminate valid deep chains, but this is vastly preferable to unbounded cost loops.
⚠ Workarounds are unverified - always check before running. Confirmations show what worked for others, not a safety guarantee.
Lifecycle
2026-06-20T17:37:47.656824+00:00— report_created — created