What does Equity, Clauses and Early Warning among Partners conclude, in numbers, about “Early Warning with Wald's Sequential Test”?

Answer: Chapter 5 uses Wald's sequential test to watch for the quiet transfer of key resources, deciding after about 57.8 weeks on average where a fixed test needs 116; with a base rate of 2%, only 0.279 of alarms from a test with a 5% false-alarm rate are true.

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: 116, 57.8

bounds on log LR4.554 and -2.986
step per event +1.609; per quiet week -0.0852
events needed with no quiet weeks2.8
normal partner alarm rate 0.0055 mean weeks57.8
defecting partner alarm rate 0.9534 mean weeks56.8
fixed test with the same targets116 weeks, alarm at 7 events
Show the full program
# Chapter 5. p09: Wald's sequential probability ratio test. Each week a
# partner either does or does not move a key resource outside the firm
# without an agreed reason (a client moved to a private channel, code
# kept in a private repository, a supplier contract re-signed in
# another name). Normal rate p0 = 0.02 a week; rate when preparing to
# defect p1 = 0.10. Error targets alpha = 0.01 (false alarm) and
# beta = 0.05 (miss). Wald's bounds: A = (1 - beta) / alpha and
# B = beta / (1 - alpha) on the likelihood ratio. Simulated error rates
# and average weeks to a decision, against the shortest fixed-length
# test with the same error targets. 20,000 runs each, seed 93.
import random
from math import log

P0, P1, ALPHA, BETA = 0.02, 0.10, 0.01, 0.05
UP, DOWN = log((1 - BETA) / ALPHA), log(BETA / (1 - ALPHA))
YES, NO = log(P1 / P0), log((1 - P1) / (1 - P0))

def binom_tail(n, k, p):
    # P(X >= k) for X ~ binomial(n, p)
    c, tot = 1.0, 0.0
    for i in range(n + 1):
        if i >= k:
            tot += c * p ** i * (1 - p) ** (n - i)
        c = c * (n - i) / (i + 1)
    return tot

def fixed_test():
    for n in range(1, 400):
        for k in range(n + 1):
            if binom_tail(n, k, P0) <= ALPHA:
                if 1 - binom_tail(n, k, P1) <= BETA:
                    return n, k
                break
    return None

def sprt(rng, p, cap=520):
    s = 0.0
    for week in range(1, cap + 1):
        s += YES if rng.random() < p else NO
        if s >= UP:
            return "alarm", week
        if s <= DOWN:
            return "clear", week
    return "none", cap

if __name__ == "__main__":
    rng = random.Random(93)
    print("   bounds on log LR: {:.3f} and {:.3f}".format(UP, DOWN))
    print("   step per event {:+.3f}; per quiet week {:+.4f}".format(YES, NO))
    print("   events needed with no quiet weeks: {:.1f}".format(UP / YES))
    for lab, p in (("normal partner", P0), ("defecting partner", P1)):
        res = [sprt(rng, p) for _ in range(20000)]
        al = sum(1 for r in res if r[0] == "alarm") / len(res)
        wk = sum(r[1] for r in res) / len(res)
        print("   {:<18} alarm rate {:.4f}   mean weeks {:5.1f}".format(
            lab, al, wk))
    n, k = fixed_test()
    print("   fixed test with the same targets: {} weeks, alarm at {}"
          " events".format(n, k))

Single source and citation

Fan, Y. (2026). Shareholder Free-Riding Games, Dynamic Vesting Mechanisms and Defection Early-Warning Models (Version 1.0.0), Chapter 5: Early Warning with Wald's Sequential Test. 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