关于「停火协议的结构:暂停长度、归期与未来的影子」,《依恋博弈与停火协议》给出的定量结论是什么?

结论:暂停是一笔交换:用更长的总时间换更少的升温时间。在示意模型中,不暂停的分歧有 25.0 分钟在升温,暂停 20 分钟时降到 6.3 分钟,但总时长从 45.0 分钟升到 53.4 分钟。归期改变等待者的容忍时长,使最优暂停能随冷却时间变长,代价从无归期时的 83.8 降到 78.7(tau 为 15 分钟)。协议能否自我执行取决于未来的影子:阿克塞尔罗德表下需要预期至少 3.00 个回合。下一章转向一种特殊的伴侣:既是夫妻、又是合伙人的创业伴侣,他们的冲突会在两张棋盘之间外溢,该怎样划界?

数据口径:书中参数均为示意,全部计算由书中程序生成。 本书不是心理咨询、医疗或法律建议,不宣称任何改变关系或身心状况的效果,也不写任何操控、冷暴力或情感勒索技巧;遇到家庭暴力、威胁、自伤风险或严重心理困扰,请立即联系当地紧急求助渠道与专业机构。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 15, 20, 25.0, 45.0, 53.4, 6.3

tau = 15 min; one disagreement from its first TALK slot
pauseresidualP(reflare)min to settlemin hotflare-ups
none-0.80045.025.01.00
50.7170.64451.811.72.34
100.5130.53249.88.51.70
150.3680.45250.97.11.42
200.2640.39553.46.31.27
300.1350.32460.05.61.12
400.0690.28868.05.31.06
600.0180.26086.15.11.01
min to settle counts talk, hot and pause minutes together
查看完整验算程序
# 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")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《亲密关系依恋博弈与冲突停火协议、重复非零和博弈情绪衰减方程与创业伴侣冷战破局母典》第 5 章「停火协议的结构:暂停长度、归期与未来的影子」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论