关于「依恋作为参数:误读率、宽恕率与追逃循环」,《依恋博弈与停火协议》给出的定量结论是什么?

结论:第三章把依恋的焦虑与回避写成误读率、宽恕率与退缩率,在追逃循环中把退缩换成有归期的暂停,使升级概率从 0.373 降到 0.057。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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)
查看完整验算程序
# 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)")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《亲密关系依恋博弈与冲突停火协议、重复非零和博弈情绪衰减方程与创业伴侣冷战破局母典》第 3 章「依恋作为参数:误读率、宽恕率与追逃循环」(版本 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}
}

本书其他章节结论