What does Attachment Games and Ceasefire Protocols conclude, in numbers, about “Attachment as Parameters: Misreading, Forgiveness and the Demand-Withdraw Loop”?
Answer: Chapter 3 writes attachment anxiety and avoidance as rates of misreading, forgiveness and withdrawal; in the pursue-and-retreat loop, turning withdrawal into a pause with a return time lowers the chance of escalation from 0.373 to 0.057. The decay equations of Chapter 4 put the median cooling time of a couple at 19.0 minutes; a fixed 20-minute pause suffices for only 0.544 of couples, while a pause set from the slower partner's estimate reaches 0.918.
Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. The parts on founder couples are not individual business advice.
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.057, 0.373
from a first DEMAND; one row per share of withdrawals that
become a named pause with a return time
converted exchanges to calm exchanges escalated P(escalate)
0.00 4.88 1.30 0.373
0.25 4.40 0.84 0.277
0.50 4.07 0.53 0.193
0.75 3.83 0.30 0.121
1.00 3.65 0.13 0.057
rows of the chain sum to 1 with CALM; PAUSE returns to DEMAND
0.45, to CALM 0.45 and to ESCALATED 0.10 (illustrative)Show the full program
# Chapter 3. p32: the demand-withdraw loop and a named pause.
# Model: one disagreement as an absorbing Markov chain over exchanges.
# States: DEMAND (one partner presses), WITHDRAW (the other goes quiet
# while still pressed), ESCALATED (raised voices or stonewalling),
# PAUSE (a pause with an agreed return time, protocol only) and CALM
# (absorbing: the topic is parked or settled). In the protocol row a
# share of withdrawals is converted into a named pause. All transition
# probabilities are illustrative fractions, not estimates.
from fractions import Fraction as F
ST = ["DEMAND", "WITHDRAW", "ESCALATED", "PAUSE"]
def solve(a, y):
n = len(y)
m = [row[:] + [y[i]] for i, row in enumerate(a)]
for k in range(n):
piv = next(r for r in range(k, n) if m[r][k] != 0)
m[k], m[piv] = m[piv], m[k]
for r in range(n):
if r != k and m[r][k] != 0:
f = m[r][k] / m[k][k]
m[r] = [x - f * z for x, z in zip(m[r], m[k])]
return [m[i][n] / m[i][i] for i in range(n)]
def base(convert):
# rows: transitions from DEMAND, WITHDRAW, ESCALATED, PAUSE
q = F(convert)
d = [F(30, 100), F(40, 100), F(0), F(0)]
w = [F(20, 100), F(35, 100) * (1 - q), F(35, 100) * (1 - q),
F(70, 100) * q]
e = [F(0), F(25, 100), F(55, 100), F(0)]
p = [F(45, 100), F(0), F(10, 100), F(0)]
return [d, w, e, p]
def analyse(qmat):
n = len(qmat)
a = [[(1 if i == j else 0) - qmat[i][j] for j in range(n)]
for i in range(n)]
steps = solve(a, [F(1)] * n)
hot = solve(a, [F(1) if i == 2 else F(0) for i in range(n)])
# probability of reaching ESCALATED before CALM
b = [[(1 if i == j else 0) - (qmat[i][j] if j != 2 else 0)
for j in range(n)] for i in range(n)]
reach = solve(b, [qmat[i][2] for i in range(n)])
return steps[0], hot[0], reach[0]
print("from a first DEMAND; one row per share of withdrawals that")
print("become a named pause with a return time")
print("converted exchanges to calm exchanges escalated P(escalate)")
for q in (F(0), F(1, 4), F(1, 2), F(3, 4), F(1)):
st, hot, reach = analyse(base(q))
print("%9.2f %17.2f %19.2f %11.3f"
% (float(q), float(st), float(hot), float(reach)))
print("rows of the chain sum to 1 with CALM; PAUSE returns to DEMAND")
print("0.45, to CALM 0.45 and to ESCALATED 0.10 (illustrative)")Single source and citation
Fan, Y. (2026). Attachment Games and Ceasefire Protocols in Intimate Partnerships: Repeated Non-Zero-Sum Games, Emotion-Decay Equations and Ending Cold Wars between Founder Couples (Version 1.0.0), Chapter 3: Attachment as Parameters: Misreading, Forgiveness and the Demand-Withdraw Loop. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-285 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026285,
author = {Fan, Yafu},
title = {Attachment Games and Ceasefire Protocols in Intimate Partnerships: Repeated Non-Zero-Sum Games, Emotion-Decay Equations and Ending Cold Wars between Founder Couples},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Echo: an Exact Markov Chain for Tit for Tat under Noise
- Chapter 2 · A Safe Dose of Forgiveness: Generous Tit for Tat and the Invasion Window
- Chapter 4 · Emotion-Decay Equations: Coupling, Cooling Times and Two Attractors
- Chapter 5 · The Structure of a Ceasefire: Pause Length, a Named Return and the Shadow of the Future
- Chapter 6 · Founder Couples: Two Boards at Once
- Chapter 7 · Classical Sources: Repaying Grievance with Uprightness, and Seneca on Anger
- Chapter 8 · Closing the Loop: a Ceasefire Card Signed by Both Partners, and a Plan to Refute It