subtraction

The passage around this formula

For n agents that each need a channel to every other agent, the number of pairwise links a fully connected coordination topology requires is $\binom{n}{2} = \frac{n(n-1)}{2}$. which grows quadratically in n even before accounting for the content sent over each link. That is a modeling assumption, not a law of nature — a system that routes all communication through a single orchestrator instead of a full mesh pays a linear cost in links, at the price of a central bottleneck and a single point of failure — but every real multi-agent framework has to choose a point on that trade-off, and reasonable designers disagree about where: full-mesh topologies keep no single node load-bearing but scale their wiring…

Read this part in the article →