What does Power Laws, Audits and Buyouts in Creator Management conclude, in numbers, about “Reading the Classics: Lord Mengchang's Three Thousand Retainers and Machiavelli's Mercenaries”?

Answer: Chapter 7 examines the keeping of retainers, the cock-crow and dog-thief episode and Feng Huan's burning of the bonds in the "Biography of Lord Mengchang" of the Records of the Grand Historian, read against Machiavelli and Adam Smith: when seating is unrelated to crisis value the most valuable retainer sits in the lowest rank with probability 0.323, and at a correlation of 0.3 only 0.007.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not individual legal or financial advice. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

中文版

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.007, 0.3, 0.323

rhotop-1% sharebest in lowest rankone of top two there
0.00.2670.3230.553
0.10.2690.1270.267
0.20.2620.0330.077
0.30.2690.0070.007
Show the full program
# Chapter 7. p71: three thousand retainers and the lowest seats.
# A lord keeps 3000 retainers whose value in a given crisis is Pareto
# with tail index 1.3 (illustrative).  He seats them in three ranks of
# 1000 by a noisy signal whose correlation with log crisis value is
# rho.  For each rho, 300 simulated households: the median share held
# by the top 1% (30 retainers), the chance that the single most
# valuable retainer sits in the lowest rank, and the chance that at
# least one of the two most valuable does.  Fixed seed.
import math
import random

rng = random.Random(20261112)
N, ALPHA, REPS = 3000, 1.3, 300

print("rho   top-1% share  best in lowest rank  one of top two there")
for rho in (0.0, 0.1, 0.2, 0.3):
    shares, best, two = [], 0, 0
    for _ in range(REPS):
        vals = [(1.0 - rng.random()) ** (-1 / ALPHA) for _ in range(N)]
        logs = [math.log(v) for v in vals]
        m = math.fsum(logs) / N
        sd = math.sqrt(math.fsum((x - m) ** 2 for x in logs) / N)
        sig = [rho * (x - m) / sd + math.sqrt(1 - rho * rho)
               * rng.gauss(0.0, 1.0) for x in logs]
        order = sorted(range(N), key=lambda i: (sig[i], i))
        low = set(order[:N // 3])
        top = sorted(range(N), key=lambda i: (-vals[i], i))
        shares.append(math.fsum(vals[i] for i in top[:30])
                      / math.fsum(vals))
        best += top[0] in low
        two += top[0] in low or top[1] in low
    shares.sort()
    print("{:3.1f} {:13.3f} {:20.3f} {:21.3f}".format(
        rho, shares[REPS // 2], best / REPS, two / REPS))

Single source and citation

Fan, Y. (2026). Survivor Power Laws in Influencer-Agency Incubation, Sampling-Audit Games against Off-Platform Deals and Option Pricing of Contract Buyouts (Version 1.0.0), Chapter 7: Reading the Classics: Lord Mengchang's Three Thousand Retainers and Machiavelli's Mercenaries. 5D Library. DOI pending

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

BibTeX
@book{fan2026172,
  author    = {Fan, Yafu},
  title     = {Survivor Power Laws in Influencer-Agency Incubation, Sampling-Audit Games against Off-Platform Deals and Option Pricing of Contract Buyouts},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book