What does Catharsis Falsified and the Cooling-Off Period conclude, in numbers, about “Closing the Loop: Complaint Cooling Rules, an Owner's Emotion-Decision Log and Pre-Registration”?

Answer: Chapter 8 gives complaint cooling rules (acknowledge first, with a best substantive delay of about 35.5 minutes), an owner's emotion-decision log, the Cooling-Off Calculator and a pre-registered test (176 events per group). Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not psychological, medical or legal advice, nor personalised business advice. Chapter 4 computes the excitation-transfer window from Zillmann's two clocks, peaking at 10.75 minutes under illustrative parameters, and reports the controversy over two-factor theory.

中文版

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: 35.5

policymd* minL(d*)L(0)window min
acknowledge first1.035.50.0260.73127.5 to47.5
acknowledge first1.526.00.0200.73120.5 to35.0
silent wait1.020.50.1060.73116.0 to28.0
silent wait1.515.50.0810.73112.0 to20.5
harsh-reply risk at once e(A0) = 0.731
Show the full program
# Chapter 8. p81: A reply-delay rule for customer complaints.
# 店主读到一条激烈客诉后唤醒 A0 = 7,按 p31 的一阶衰减(tau = 20 分钟,
# 慢呼吸时速率乘 m)回落;回复带火气的概率沿用 p61 的 e(A)。等待期间
# 顾客升级(公开差评、转投诉平台)的风险率:先发一条中性确认时为
# H_ACK,不确认时为 H_NO(每小时)。损失 L(d) = e(A(d)) CH +
# (1 - exp(-h d / 60)) CW。求最优延迟 d* 与「损失不超过最优 1.1 倍」的
# 可接受窗口。CH、CW、H_ACK、H_NO 均为示意参数,请用自家日志重估。
import math

A0, TAU = 7.0, 20.0
CH, CW = 1.0, 0.6
H_ACK, H_NO = 0.05, 0.40


def err(a):
    return 1 / (1 + math.exp(-(a - 6.0)))


def loss(d, h, m=1.0):
    a = A0 * math.exp(-m * d / TAU)
    return err(a) * CH + (1 - math.exp(-h * d / 60.0)) * CW


def scan(h, m):
    grid = [i * 0.5 for i in range(0, 481)]
    ls = [loss(d, h, m) for d in grid]
    k = min(range(len(grid)), key=lambda i: ls[i])
    ok = [grid[i] for i in range(len(grid)) if ls[i] <= 1.1 * ls[k]]
    return grid[k], ls[k], ok[0], ok[-1]


def main():
    print("policy             m    d* min   L(d*)   L(0)   window min")
    for name, h in (("acknowledge first", H_ACK), ("silent wait", H_NO)):
        for m in (1.0, 1.5):
            d, l, lo, hi = scan(h, m)
            print("%-17s  %3.1f  %7.1f  %6.3f  %5.3f   %5.1f to %5.1f"
                  % (name, m, d, l, loss(0.0, h, m), lo, hi))
    print("harsh-reply risk at once e(A0) = %.3f" % err(A0))


if __name__ == "__main__":
    main()

Single source and citation

Fan, Y. (2026). Falsifying the Catharsis Hypothesis: Two-Factor Arousal Decay and the Optimal Cooling-Off Period in Negotiation (Version 1.0.0), Chapter 8: Closing the Loop: Complaint Cooling Rules, an Owner's Emotion-Decision Log and Pre-Registration. 5D Library. DOI pending

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

BibTeX
@book{fan2026200,
  author    = {Fan, Yafu},
  title     = {Falsifying the Catharsis Hypothesis: Two-Factor Arousal Decay and the Optimal Cooling-Off Period in Negotiation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book