What does Objection Judo and Deposit Locks conclude, in numbers, about “Classical Sources: Han Feizi's "Difficulties of Persuasion" and Franklin's Moral Algebra”?
Answer: Chapter 7 examines Han Feizi's "Difficulties of Persuasion" and Franklin's moral algebra: four days of weighing agree with the right decision 0.8275 of the time.
Scope of the numbers: Its customer populations, probabilities and amounts are illustrative; all calculations are generated by its programs; it is not individual legal, financial or investment advice, and it discusses only persuasion that keeps the rules. Chapter 1's objection tree shows that, under illustrative priors, 0.734 of those who say "too expensive" are not short of money.
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.8275
| days of weighing | agreement with true-weight decision |
|---|---|
| 1 | 0.7175 |
| 2 | 0.7764 |
| 3 | 0.8046 |
| 4 | 0.8275 |
| count only (ties by coin, 0.247 tied) | 0.6821 |
| one striking item | 0.6338 |
Show the full program
# Chapter 7. p72: Franklin's "moral or prudential algebra" (letter to
# Joseph Priestley, 1772): list pros and cons, weigh them, strike out
# items of equal weight, and take three or four days over it. A model:
# 5 pros and 5 cons with true weights U(0, 1). Each day the decider
# re-estimates every weight with error N(0, 0.35) and averages the days
# so far. How often does the averaged list agree with the true-weight
# decision? Compared with a count-only list and with deciding on one
# striking item. Fixed-seed Monte Carlo, 20,000 decisions; illustrative.
import math
import random
M, SD, TRIALS = 5, 0.35, 20000
rng = random.Random(20261112)
agree = [0] * 5
count_ok = gut_ok = ties = 0
for _ in range(TRIALS):
pro = [rng.random() for _ in range(M)]
con = [rng.random() for _ in range(M)]
truth = math.fsum(pro) > math.fsum(con)
est_p = [[] for _ in range(M)]
est_c = [[] for _ in range(M)]
for day in range(1, 5):
for i in range(M):
est_p[i].append(pro[i] + rng.gauss(0, SD))
est_c[i].append(con[i] + rng.gauss(0, SD))
sp = math.fsum(math.fsum(e) / day for e in est_p)
sc = math.fsum(math.fsum(e) / day for e in est_c)
agree[day] += (sp > sc) == truth
# count-only: an item "counts" if its first estimate exceeds 0.5
npro = len([e for e in est_p if e[0] > 0.5])
ncon = len([e for e in est_c if e[0] > 0.5])
if npro == ncon:
ties += 1
count_ok += rng.random() < 0.5 and 1 or 0
else:
count_ok += (npro > ncon) == truth
# one striking item: the largest single first-day estimate decides
bp = max(e[0] for e in est_p)
bc = max(e[0] for e in est_c)
gut_ok += (bp > bc) == truth
print("days of weighing agreement with true-weight decision")
for day in range(1, 5):
print("{:>16} {:>14.4f}".format(day, agree[day] / TRIALS))
print("count only (ties by coin, {:.3f} tied) {:>9.4f}".format(
ties / TRIALS, count_ok / TRIALS))
print("one striking item {:>23.4f}".format(gut_ok / TRIALS))Single source and citation
Fan, Y. (2026). Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols (Version 1.0.0), Chapter 7: Classical Sources: Han Feizi's "Difficulties of Persuasion" and Franklin's Moral Algebra. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026146,
author = {Fan, Yafu},
title = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Objection Tree: Six Hidden Causes behind Three Sentences
- Chapter 2 · A Bayesian Decomposition of "Too Expensive": Budget, Value, Rival Quotes and Polite Refusal
- Chapter 3 · "Let Me Think": the Posterior of Silence and Choice Conflict
- Chapter 4 · "I Need to Ask My Partner": a Unanimity Model of Joint Decisions
- Chapter 5 · Three Faces of a Deposit: Loss Aversion, Screening and the Civil Code
- Chapter 6 · Stopping-Time Protocols: the Secretary Problem, Follow-up Caps and Lock Windows
- Chapter 8 · Practice and Refutation: a Closing Skill Pack and a Pre-registered Trial