What does Attachment Games and Ceasefire Protocols conclude, in numbers, about “The Structure of a Ceasefire: Pause Length, a Named Return and the Shadow of the Future”?
Answer: A pause is a trade: more total time for less time in flares. In the illustrative model a disagreement without a pause spends 25.0 minutes in a flare, and a 20-minute pause cuts this to 6.3 minutes while the total rises from 45.0 to 53.4 minutes. A return time changes how long the waiting partner can tolerate, so the best pause can lengthen with the cooling time, and the cost falls from 83.8 without a return time to 78.7 with one (tau of 15 minutes). Whether the protocol enforces itself depends on the shadow of the future: under Axelrod's table both partners must expect at least 3.00 further rounds. The next chapter turns to a special kind of couple, partners who are both spouses and co-founders, whose conflicts spill over between two boards. Where should the boundary between the boards be drawn?
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: 15, 20, 25.0, 45.0, 53.4, 6.3
| tau = 15 min; one disagreement from its first TALK slot | |||||
| pause | residual | P(reflare) | min to settle | min hot | flare-ups |
| none | - | 0.800 | 45.0 | 25.0 | 1.00 |
| 5 | 0.717 | 0.644 | 51.8 | 11.7 | 2.34 |
| 10 | 0.513 | 0.532 | 49.8 | 8.5 | 1.70 |
| 15 | 0.368 | 0.452 | 50.9 | 7.1 | 1.42 |
| 20 | 0.264 | 0.395 | 53.4 | 6.3 | 1.27 |
| 30 | 0.135 | 0.324 | 60.0 | 5.6 | 1.12 |
| 40 | 0.069 | 0.288 | 68.0 | 5.3 | 1.06 |
| 60 | 0.018 | 0.260 | 86.1 | 5.1 | 1.01 |
| min to settle counts talk, hot and pause minutes together |
Show the full program
# Chapter 5. p51: what a ceasefire pause buys, absorbing chain.
# Model: a disagreement in 5-minute slots. TALK: settles with 0.25,
# flares (HOT) with 0.25, else goes on. Without a protocol HOT stays
# hot with 0.80 per slot. Under the protocol a flare costs one hot
# slot and then a pause of L slots; on resuming, residual arousal is
# f = exp(-5L / tau) with tau = 15 minutes, the first slot re-flares
# with 0.25 + 0.55 f and settles with 0.25 (1 - f). Expected minutes
# are solved exactly from the linear equations of the chain. Every
# number is an illustrative assumption, not an estimate.
import math
TAU, SLOT = 15.0, 5.0
def solve(a, y):
n = len(y)
m = [row[:] + [y[i]] for i, row in enumerate(a)]
for k in range(n):
piv = max(range(k, n), key=lambda r: abs(m[r][k]))
m[k], m[piv] = m[piv], m[k]
for r in range(n):
if r != k:
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 no_protocol():
# unknowns: T, H; reward vectors: slots, hot slots, flare-ups
a = [[0.5, -0.25], [-0.2, 0.2]]
t = solve(a, [1.0, 1.0])[0]
hot = solve(a, [0.0, 1.0])[0]
flares = solve(a, [0.25, 0.0])[0]
return t, hot, flares
def protocol(L):
f = math.exp(-SLOT * L / TAU)
pe, pr = 0.25 + 0.55 * f, 0.25 * (1 - f)
# unknowns: T (talking), E (entering a flare), Z (first resumed slot)
a = [[0.5, -0.25, 0.0],
[0.0, 1.0, -1.0],
[-(1 - pe - pr), -pe, 1.0]]
t = solve(a, [1.0, 1.0 + L, 1.0])[0]
hot = solve(a, [0.0, 1.0, 0.0])[0]
flares = solve(a, [0.0, 1.0, 0.0])[0]
return t, hot, flares, f, pe
print("tau = 15 min; one disagreement from its first TALK slot")
print("pause residual P(reflare) min to settle min hot flare-ups")
t, hot, fl = no_protocol()
print(" none %8s %10.3f %13.1f %7.1f %9.2f"
% ("-", 0.8, SLOT * t, SLOT * hot, fl))
for L in (1, 2, 3, 4, 6, 8, 12):
t, hot, fl, f, pe = protocol(L)
print("%5d %8.3f %10.3f %13.1f %7.1f %9.2f"
% (SLOT * L, f, pe, SLOT * t, SLOT * hot, fl))
print("min to settle counts talk, hot and pause minutes together")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 5: The Structure of a Ceasefire: Pause Length, a Named Return and the Shadow of the Future. 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 3 · Attachment as Parameters: Misreading, Forgiveness and the Demand-Withdraw Loop
- Chapter 4 · Emotion-Decay Equations: Coupling, Cooling Times and Two Attractors
- 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