Say the cost in time/money/resources of coordinating between any two individuals is on average <i>x</i> dollars. Let's call this figure pair coordination cost.<p>The pair coordination cost between 3 individuals, ignoring overhead, is <i>3x</i> dollars, as there are three possible pairs that need to coordinate, i.e., there are three connections in a network with three nodes.<p>The pair coordination cost between 4 individuals, ignoring overhead, is <i>6x</i> dollars. At 5 people, the pair coordination cost is <i>10x</i> dollars.<p>At <i>n</i> people, the pair coordination cost is <i>(n(n-1)/2)x</i> dollars, which is asymptotically proportional to <i>n²x</i> as <i>n</i> grows.[a]<p>When coordination costs are high, as with software development, it's not surprising that small teams outperform large teams.<p>Large software development teams generally cannot accomplish much -- unless they break into smaller, highly autonomous teams with well-separated responsibilities.<p>This applies to other high-coordination-cost endeavors, such as building a successful company from scratch.<p>--<p>[a] This is Metcalfe's law, but for a network's pair coordination cost instead of value: <a href="https://en.wikipedia.org/wiki/Metcalfe%27s_law" rel="nofollow">https://en.wikipedia.org/wiki/Metcalfe%27s_law</a>