What does Team Size under Coordination Overhead conclude, in numbers, about “Merge Conflicts as a Birthday Problem: Shared Files, Hot Files and Private Directories”?

Answer: Chapter 5 treats merge conflicts as a birthday problem: one hot file raises the conflict probability of four windows to 0.6875, while private directories bring it to zero.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Chapter 4 takes this bureau's four volumes in parallel per wave as an illustrative scene: capacity peaks at 6.78 windows, four windows already reach 89.6 % of the peak, and the coordinator's review queue holds the ceiling at four.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.6875

P(at least one conflict per wave)
nA uniformB +hot fileC hot->coordD private
20.11750.33820.11750.0000
30.30860.65430.30860.0000
40.51640.84890.51640.0000
50.69650.94310.69650.0000
60.82820.98120.82820.0000
80.95890.99860.95890.0000
hot file alone, n = 4: 0.6875; n = 2: 0.2500
A with only 40 shared files left, n = 4: 0.1352
Show the full program
# Chapter 5. p52: one hot shared file against private directories.
# Each agent touches file j independently with probability p_j. No file
# is touched by two agents with probability
# prod_j [(1 - p_j)^n + n p_j (1 - p_j)^(n - 1)], computed as a math.fsum
# of logarithms. Layouts (illustrative): A, 200 shared files, p = 0.025
# each (about 5 per agent); B, A plus one catalogue file every agent
# edits with p = 0.5; C, B with the catalogue written only by the
# coordinator; D, private directory per agent, nothing shared.
import math


def p_clash(n, probs):
    logs = [math.log((1 - p) ** n + n * p * (1 - p) ** (n - 1))
            for p in probs]
    return 1.0 - math.exp(math.fsum(logs))


LAYOUT = {
    "A uniform": [0.025] * 200,
    "B +hot file": [0.025] * 200 + [0.5],
    "C hot->coord": [0.025] * 200,
    "D private": [0.0] * 200,
}

if __name__ == "__main__":
    names = ("A uniform", "B +hot file", "C hot->coord", "D private")
    print("P(at least one conflict per wave)")
    print("   n  " + "  ".join("{:>12}".format(x) for x in names))
    for n in (2, 3, 4, 5, 6, 8):
        print("  {:2d}  ".format(n) + "  ".join(
            "{:12.4f}".format(p_clash(n, LAYOUT[x])) for x in names))
    hot = [0.5]
    print("hot file alone, n = 4: {:.4f}; n = 2: {:.4f}".format(
        p_clash(4, hot), p_clash(2, hot)))
    shared = [0.025] * 40
    print("A with only 40 shared files left, n = 4: {:.4f}".format(
        p_clash(4, shared)))

Single source and citation

Fan, Y. (2026). The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead (Version 1.0.0), Chapter 5: Merge Conflicts as a Birthday Problem: Shared Files, Hot Files and Private Directories. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-322 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026322,
  author    = {Fan, Yafu},
  title     = {The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book