What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking”?
Answer: Chapter 5 writes complaint escalation as an absorbing Markov chain: an inquiry ends in public exposure with probability 0.01469, and blocking upstream with a complete first answer saves 24.18 yuan per yuan spent, though above a unit price of 2.57 yuan intervention at dissatisfaction is better.
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: 2.57, 24.18
| block | exposures | complaint | spend | total cost | saved per |
|---|---|---|---|---|---|
| rounds | (yuan) | (yuan) | yuan spent | ||
| none | 146.9 | 597.0 | 0 | 530149 | |
| B-I | 73.1 | 297.1 | 10576 | 274391 | 24.18 |
| B-D | 72.7 | 295.7 | 28388 | 290981 | 8.42 |
| B-P | 102.1 | 597.0 | 35821 | 431642 | 2.75 |
| B-I keeps the larger net saving up to 2.57 yuan per inquiry round |
Show the full program
# Chapter 5. p52: where blocking the escalation chain pays the most.
# Model (illustrative parameters): the chain of p51. Three blocks:
# B-I a complete first reply, 1 yuan per inquiry round, halves I->D
# B-D human apology and make-good, 15 yuan per dissatisfied round,
# halves D->P and D->E
# B-P fast settlement of a platform complaint, 60 yuan per complaint
# round, halves P->E
# Moved probability goes to "resolved". Each exposure is charged
# X_EXP yuan and each complaint round X_CMP yuan (illustrative). All
# figures are per 10000 inquiries; exact fractions, printed as floats.
from fractions import Fraction as F
X_EXP, X_CMP, PER = 3000, 150, 10000
T = ("I", "D", "P")
# I D P E R
ROWS = {"I": (F(5, 100), F(15, 100), F(0), F(0), F(80, 100)),
"D": (F(5, 100), F(15, 100), F(25, 100), F(3, 100), F(52, 100)),
"P": (F(0), F(5, 100), F(20, 100), F(15, 100), F(60, 100))}
def inverse(m):
n = len(m)
a = [list(r) + [F(int(i == j)) for j in range(n)]
for i, r in enumerate(m)]
for c in range(n):
p = next(r for r in range(c, n) if a[r][c] != 0)
a[c], a[p] = a[p], a[c]
piv = a[c][c]
a[c] = [x / piv for x in a[c]]
for r in range(n):
if r != c and a[r][c] != 0:
f = a[r][c]
a[r] = [x - f * y for x, y in zip(a[r], a[c])]
return [r[n:] for r in a]
def solve(rows):
q = [[rows[i][j] for j in range(3)] for i in T]
b = [[rows[i][3], rows[i][4]] for i in T]
n = inverse([[F(int(i == j)) - q[i][j] for j in range(3)]
for i in range(3)])
nb = [[n[i][0] * b[0][k] + n[i][1] * b[1][k] + n[i][2] * b[2][k]
for k in range(2)] for i in range(3)]
return n, nb
def halve(rows, state, cols):
r = list(rows[state])
for c in cols:
r[4] += r[c] / 2
r[c] = r[c] / 2
out = dict(rows)
out[state] = tuple(r)
return out
def report(name, rows, unit, state_ix):
n, nb = solve(rows)
exp_, cmp_ = PER * nb[0][0], PER * n[0][2]
spend = PER * unit * n[0][state_ix] if unit else F(0)
total = exp_ * X_EXP + cmp_ * X_CMP + spend
return name, exp_, cmp_, spend, total
cases = [report("none", ROWS, 0, 0),
report("B-I", halve(ROWS, "I", (1,)), 1, 0),
report("B-D", halve(ROWS, "D", (2, 3)), 15, 1),
report("B-P", halve(ROWS, "P", (3,)), 60, 2)]
base = cases[0][4]
print("block exposures complaint spend total cost saved per")
print(" rounds (yuan) (yuan) yuan spent")
for name, e, c, s, t in cases:
ratio = "" if s == 0 else "{:10.2f}".format(float((base - t) / s))
print("{:5} {:9.1f} {:9.1f} {:6.0f} {:10.0f} {}".format(
name, float(e), float(c), float(s), float(t), ratio))
# at 1 yuan per round, the B-I spend equals its count of inquiry rounds
gross_i = base - (cases[1][4] - cases[1][3])
net_d = base - cases[2][4]
price = (gross_i - net_d) / cases[1][3]
print("B-I keeps the larger net saving up to {:.2f} yuan per inquiry"
" round".format(float(price)))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 5: A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking. 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
- Chapter 1 · The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring
- Chapter 2 · Queues that Give Up: Erlang C, Erlang-A and Square-Root Staffing
- Chapter 3 · The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback
- Chapter 4 · Red, Amber, Green: Cost-Sensitive Handoff Thresholds on the ROC Curve
- Chapter 6 · The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority
- Chapter 7 · The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange
- Chapter 8 · Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions