What does Equity, Clauses and Early Warning among Partners conclude, in numbers, about “Shapley Values and the Drift of Contributions”?
Answer: Chapter 4 computes Shapley values for three founders and shows that an alarm based on drift in contributions also sounds in 0.823 of cases in which nothing changed.
Scope of the numbers: Its parameters are illustrative or synthetic; all calculations are generated by its programs; the book is not legal, tax or investment advice. Marked boxes separate published evidence, runnable Python calculations (16 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.823
| true C share: before 0.181, after 0.111 | ||||
| window k | alarm by q8 | by q12 | median q | false alarm |
| 1 | 0.922 | 0.981 | 5 | 0.823 |
| 2 | 0.827 | 0.942 | 6 | 0.593 |
| 4 | 0.649 | 0.846 | 8 | 0.358 |
Show the full program
# Chapter 4. p08: Watching contributions drift. Each quarter the value
# of every coalition is measured with noise (each v(S) times a
# lognormal factor, log-sd 0.25). From quarter 5 on, founder C quietly
# withdraws half of C's contribution: every v(S) containing C loses
# 1.5. C's Shapley share is recomputed each quarter; the alarm sounds
# when C's share averaged over the last k quarters falls 0.05 below its
# average in quarters 1 to 4. How long until it sounds, and how often
# it sounds by quarter 12 when nothing has changed? 4,000 runs, seed 93.
import random
from math import exp
from itertools import permutations
BASE = {"A": 2, "B": 1, "C": 0, "AB": 8, "AC": 5, "BC": 3, "ABC": 12}
def shapley_c(v):
tot = 0.0
for order in permutations("ABC"):
have = ""
for p in order:
if p == "C":
k1 = "".join(sorted(have + "C"))
tot += v[k1] - (v["".join(sorted(have))] if have else 0)
have += p
return tot / 6 / v["ABC"]
def quarter(rng, q, change=True):
v = {}
for s, x in BASE.items():
x = x - (1.5 if change and q >= 5 and "C" in s and x >= 1.5
else 0)
v[s] = x * exp(rng.gauss(0, 0.25))
return shapley_c(v)
def run(rng, k, change=True):
shares = [quarter(rng, q, change) for q in range(1, 13)]
base = sum(shares[:4]) / 4
for q in range(4 + k, 13):
if sum(shares[q - k:q]) / k < base - 0.05:
return q, shares
return None, shares
if __name__ == "__main__":
rng = random.Random(93)
print(" true C share: before {:.3f}, after {:.3f}".format(
shapley_c({s: x for s, x in BASE.items()}),
shapley_c({s: x - (1.5 if "C" in s and x >= 1.5 else 0)
for s, x in BASE.items()})))
print(" window k alarm by q8 by q12 median q false alarm")
for k in (1, 2, 4):
qs = [run(rng, k)[0] for _ in range(4000)]
hit = sorted(q for q in qs if q is not None)
med = hit[len(hit) // 2] if hit else 0
fa = sum(1 for _ in range(4000) if run(rng, k, False)[0]) / 4000
print(" {:8d} {:11.3f} {:6.3f} {:8d} {:11.3f}".format(
k, sum(1 for q in qs if q and q <= 8) / 4000,
len(hit) / 4000, med, fa))Single source and citation
Fan, Y. (2026). Shareholder Free-Riding Games, Dynamic Vesting Mechanisms and Defection Early-Warning Models (Version 1.0.0), Chapter 4: Shapley Values and the Drift of Contributions. 5D Library. https://doi.org/10.5281/zenodo.24090243
DOI: 10.5281/zenodo.24090243 · Read the monograph · 5DL-B-093 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026093,
author = {Fan, Yafu},
title = {Shareholder Free-Riding Games, Dynamic Vesting Mechanisms and Defection Early-Warning Models},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090243},
url = {https://doi.org/10.5281/zenodo.24090243}
}Other chapter answers in this book
- Chapter 1 · Free Riding When Effort Cannot Be Verified
- Chapter 2 · Vesting: What It Repairs and What It Does Not
- Chapter 3 · The Shotgun Clause: Who Gains When Information and Cash Are Unequal
- Chapter 5 · Early Warning with Wald's Sequential Test
- Chapter 6 · When Clauses Deter
- Chapter 7 · "Bei nei", the Eight Villainies, Pooled Capital and Body Shares
- Chapter 8 · Practice: A Cap Table, a Key-Person Test and the Rule That an Alarm Is Not Proof