What does Deferred-Promise Options and Reciprocal Stopping conclude, in numbers, about “The Sequential Probability Ratio Test: How Many Weeks of Records Are Enough to Stop”?

Answer: Chapter 4 derives sequential stopping boundaries, against 15.2 weeks for a fixed-length test.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is not counselling, relationship advice or clinical judgement, and makes no divinatory inference. Marked boxes separate evidence, runnable calculations (21 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: 15.2

upper boundary ln A2.890, lower boundary ln B = -2.251
step for a missed week +0.773, for a met week -0.693
expected weeks under H07.9, under H1: 9.1
fixed-length test with the same errors15.2 weeks
misses in a row that reach the upper boundary4
met weeks in a row that reach the lower boundary4
Show the full program
# Chapter 4. p41: Wald SPRT boundaries for a weekly reciprocity record
# Each week is scored 1 if the other party's observable investment met
# the agreed reciprocal floor, else 0. H0: p = 0.70 (reciprocal pace),
# H1: p = 0.35 (persistently one-sided). alpha = P(stop for H1 | H0),
# beta = P(continue as if H0 | H1). Wald (1945) approximations.
import math
from statistics import NormalDist

P0, P1, ALPHA, BETA = 0.70, 0.35, 0.05, 0.10
a = math.log((1.0 - BETA) / ALPHA)
b = math.log(BETA / (1.0 - ALPHA))
inc_miss = math.log((1.0 - P1) / (1.0 - P0))
inc_met = math.log(P1 / P0)
print("upper boundary ln A = {:.3f}, lower boundary ln B = {:.3f}".format(
    a, b))
print("step for a missed week {:+.3f}, for a met week {:+.3f}".format(
    inc_miss, inc_met))


def drift(p):
    return (1.0 - p) * inc_miss + p * inc_met


asn0 = ((1.0 - ALPHA) * b + ALPHA * a) / drift(P0)
asn1 = ((1.0 - BETA) * a + BETA * b) / drift(P1)
print("expected weeks under H0: {:.1f}, under H1: {:.1f}".format(
    asn0, asn1))
z = NormalDist()
za, zb = z.inv_cdf(1.0 - ALPHA), z.inv_cdf(1.0 - BETA)
s0, s1 = math.sqrt(P0 * (1 - P0)), math.sqrt(P1 * (1 - P1))
n_fix = ((za * s0 + zb * s1) / (P0 - P1)) ** 2
print("fixed-length test with the same errors: {:.1f} weeks".format(n_fix))
k = 0
while k * inc_miss < a:
    k += 1
print("misses in a row that reach the upper boundary: {}".format(k))
m = 0
while m * inc_met > b:
    m += 1
print("met weeks in a row that reach the lower boundary: {}".format(m))

Single source and citation

Fan, Y. (2026). Unbundling Paternal Selection from Romantic Commitment: Deferred-Promise Options, Avoidant Autonomy and Reciprocal Stopping Rules (Version 1.0.0), Chapter 4: The Sequential Probability Ratio Test: How Many Weeks of Records Are Enough to Stop. 5D Library. DOI pending

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

BibTeX
@book{fan2026423,
  author    = {Fan, Yafu},
  title     = {Unbundling Paternal Selection from Romantic Commitment: Deferred-Promise Options, Avoidant Autonomy and Reciprocal Stopping Rules},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book