What does Costly Signals and Hot-Cold Traps conclude, in numbers, about “Reading the Sources: the Six Rites of the Book of Rites and Zahavi's Handicap Principle”?
Answer: Chapter 7 reads the six rites of the Book of Rites chapter on marriage against Zahavi's handicap principle; staging cuts the sincere suitor's sunk-cost risk from 0.848 to 0.342.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not psychological counselling, claims no effect of any kind, and teaches no technique of manipulation. Chapter 2 enters each interaction in a likelihood-ratio ledger; with illustrative parameters one missed plan weighs as much as 2.52 kept ones, and Wald's sequential test saves 0.459 of the interactions a fixed observation period needs.
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.342, 0.848
| O values completion at 4.0 | |||||
| schedule | O completes | O stages | O pays | G completes | G sunk |
| front-loaded | 0.0000 | 0.000 | 0.000 | 0.8587 | 0.848 |
| back-loaded | 0.0000 | 3.488 | 0.000 | 0.8587 | 0.000 |
| even | 0.0000 | 0.000 | 0.000 | 0.8587 | 0.415 |
| six rites | 0.0000 | 2.530 | 1.265 | 0.8587 | 0.342 |
| O values completion at 7.0 | |||||
| schedule | O completes | O stages | O pays | G completes | G sunk |
| front-loaded | 0.0000 | 0.000 | 0.000 | 0.8587 | 0.848 |
| back-loaded | 0.3629 | 3.488 | 2.177 | 0.8587 | 0.000 |
| even | 0.3629 | 3.488 | 3.850 | 0.8587 | 0.415 |
| six rites | 0.3629 | 3.488 | 3.367 | 0.8587 | 0.342 |
Show the full program
# Chapter 7. p71: the six rites as staged costly commitment. Stages:
# nacai, wenming, naji, nazheng, qingqi, qinying. A suitor pays the cost
# of a stage, then the bride's family may learn something: an insincere
# suitor (O) is found out with probability d_k, a sincere one (G) is
# turned away by mistake with probability 0.03 (stages 1-5). O takes 0.5
# of short-term gain for each of stages 1-5 he sits through; completion
# is worth 10 to G and 4 (modest) or 7 (greedy) to O. Each suitor may
# quit before paying; decisions by backward induction, exact. Four
# schedules with the same total cost 6. All numbers are illustrative,
# not historical.
import math
D_O = [0.10, 0.30, 0.20, 0.10, 0.20, 0.0]
D_G = [0.03] * 5 + [0.0]
SCHED = [("front-loaded", [6, 0, 0, 0, 0, 0]),
("back-loaded", [0, 0, 0, 0, 0, 6]),
("even", [1, 1, 1, 1, 1, 1]),
("six rites", [0.5, 0.5, 0.5, 3, 0.5, 1])]
def play(cost, det, gain, final):
w = [0.0] * 7
go = [False] * 6
w[6] = final
for k in range(5, -1, -1):
g = gain if k < 5 else 0.0
enter = -cost[k] + g + (1 - det[k]) * w[k + 1]
go[k] = enter >= 0
w[k] = max(0.0, enter)
alive, stages, paid, done, sunk = 1.0, 0.0, 0.0, 0.0, 0.0
for k in range(6):
if not go[k]:
break
paid += alive * cost[k]
if k < 5:
stages += alive
if k == 5:
done = alive
caught = alive * det[k]
sunk += caught * math.fsum(cost[:k + 1])
alive -= caught
return done, stages, paid, sunk
for v_o in (4.0, 7.0):
print("O values completion at {:.1f}".format(v_o))
print("schedule O completes O stages O pays G completes G sunk")
for name, c in SCHED:
od, os_, op, _ = play(c, D_O, 0.5, v_o)
gd, _, _, gs = play(c, D_G, 0.0, 10.0)
print("{:12s} {:11.4f} {:8.3f} {:6.3f} {:11.4f} {:6.3f}".format(
name, od, os_, op, gd, gs))Single source and citation
Fan, Y. (2026). Costly-Signal Screening in Early Intimacy, Intermittent-Reinforcement Dopamine Traps and Reciprocal-Floor Stopping Games (Version 1.0.0), Chapter 7: Reading the Sources: the Six Rites of the Book of Rites and Zahavi's Handicap Principle. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-181 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026181,
author = {Fan, Yafu},
title = {Costly-Signal Screening in Early Intimacy, Intermittent-Reinforcement Dopamine Traps and Reciprocal-Floor Stopping Games},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · When Costly Signals Separate: Single Crossing, the Handicap Principle and the Cost Structure of Honest Signals
- Chapter 2 · Sequential Bayesian Screening: a Likelihood-Ratio Ledger and Wald's Boundaries for Going On or Stepping Back
- Chapter 3 · Variable-Ratio Reinforcement and Resistance to Extinction: Why Responses That Come and Go Are the Hardest to Give Up
- Chapter 4 · Reward Prediction Errors: a Small Temporal-Difference Model of the Hot-and-Cold Relationship
- Chapter 5 · Optimal Stopping: the 1/e of the Secretary Problem, Thresholds on a Known Scale and the Reciprocal-Floor Rule
- Chapter 6 · Detectable Fingerprints of Manipulation: Features and False Alarm Rates for the Love-Bombing and Withdrawal Cycle
- Chapter 8 · Practice and Refutation: a Personal Interaction Log, a Stop-Loss Communication Kit and a Pre-Registered Test