What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority”?

Answer: By the stopwatch, B is 30 seconds longer than A and total discomfort rises from 47 to 52; yet under the peak-end rule A scores 7.0 in memory and B only 5.0. To check that the ranking does not rest on one memory rule alone, the program also uses a blend that weights mean, peak and end by 0.3, 0.35 and 0.35; A scores 6.66 and B 5.06, and the ranking holds. Progress notes act on the peak: C's peak falls from 8 to 6 and its peak-end score from 7.0 to 6.0. D, which combines both, has a peak-end score of only 4.0 and a blended score of 4.06, the best of the four scripts.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not personalised legal, financial or business advice. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

中文版

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: 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
Show the full program
# 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")

Single source and citation

Fan, Y. (2026). Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation (Version 1.0.0), Chapter 6: The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book