关于「等待的心理账:峰终规则、等待八原则与优先级的公平代价」,《私域等待、转人工门限与客诉阻断》给出的定量结论是什么?

结论:按秒表算,B 比 A 多 30 秒,不适的总量从 47 增加到 52;可是按峰终规则,A 的回顾评分是 7.0,B 只有 5.0。为了确认这个排序不依赖于单一的记忆规则,程序还用一个把均值、峰值与终值按 0.3、0.35、0.35 加权的混合规则复核,A 是 6.66,B 是 5.06,排序不变。进度提示的作用体现在峰值上:C 的峰值从 8 降到 6,峰终评分从 7.0 降到 6.0。两者叠加的 D,峰终评分只有 4.0,混合规则 4.06,是四个脚本中最好的。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律、财务或经营上的个人化建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(18 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 30, 4.0, 4.06, 47, 5.0, 5.06

scriptsecondstotalmeanpeakendpeak-endblend
A120475.88867.06.66
B150525.20825.05.06
C120374.62666.05.59
D150424.20624.04.06
B lasts 30 s longer than A and adds 5 units of discomfort,
yet both memory rules score it better than A
查看完整验算程序
# Chapter 6. p61: peak-end memory of a private-message wait.
# Model (illustrative numbers, not measurements): discomfort on a 0-10
# scale, one value per 15 s slice of a chat.  Four scripts:
#   A  silent wait, then an abrupt answer
#   B  as A, plus two closing slices (clear next step, thanks)
#   C  the same wait with a progress note every 30 s (Maister: an
#      explained, occupied wait), abrupt answer
#   D  as C, plus the closing slices of B
# "Total" is the area (slices x discomfort) a stopwatch would measure;
# "peak-end" is the mean of the worst and the last slice, the rule of
# Kahneman et al. (1993); "blend" weights mean, peak and end 0.3,
# 0.35, 0.35 as a check that the ranking does not hinge on one rule.
import math

WAIT_SILENT = [3, 4, 5, 6, 7, 8, 8]
WAIT_NOTED = [3, 4, 4, 5, 5, 5, 5]
END_ABRUPT = [6]
END_CLOSE = [6, 3, 2]
SCRIPTS = (("A", WAIT_SILENT + END_ABRUPT), ("B", WAIT_SILENT + END_CLOSE),
           ("C", WAIT_NOTED + END_ABRUPT), ("D", WAIT_NOTED + END_CLOSE))

print("script  seconds  total  mean   peak  end  peak-end  blend")
for name, xs in SCRIPTS:
    total = math.fsum(xs)
    mean = total / len(xs)
    pe = (max(xs) + xs[-1]) / 2.0
    blend = math.fsum((0.3 * mean, 0.35 * max(xs), 0.35 * xs[-1]))
    print("{:>6}  {:7d}  {:5.0f}  {:4.2f}  {:5d}  {:3d}  {:8.1f}  {:5.2f}"
          .format(name, 15 * len(xs), total, mean, max(xs), xs[-1], pe,
                  blend))
print("B lasts 30 s longer than A and adds 5 units of discomfort,")
print("yet both memory rules score it better than A")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《私域对话队列耐心衰减分布、人机协同红黄绿灯移交门限与客诉升级马尔可夫阻断》第 6 章「等待的心理账:峰终规则、等待八原则与优先级的公平代价」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-175 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026175,
  author    = {Fan, Yafu},
  title     = {Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论