What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback”?
Answer: Chapter 3 finds that a human handoff can pay only above a margin of 16.0 yuan, and that once the cutoff is applied to every buyer, the best cutoff for a five-person team raises the expected value per buyer from 202.6 to 270.2 yuan.
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: 202.6, 270.2
| 3.0 chats/min, margin 600 yuan, human session 4 min | |||||
| agents | naive tau* | value | | system tau* | value | P(ab) at tau* |
| 3 | 20 | 158.4 | | 115 | 255.7 | 0.192 |
| 4 | 20 | 181.1 | | 95 | 263.7 | 0.138 |
| 5 | 20 | 202.6 | | 80 | 270.2 | 0.103 |
| 6 | 20 | 222.4 | | 70 | 275.6 | 0.073 |
| 8 | 20 | 255.0 | | 55 | 283.6 | 0.036 |
| naive tau* ignores the queue it feeds; the gap is the cost |
Show the full program
# Chapter 3. p32: a cutoff applied to everyone changes the human queue.
# Model (illustrative parameters): high-intent chats reach the AI at
# LAM per minute; exponential patience with mean 120 s (so the Erlang-A
# chain of p22 applies); AI and human parameters as in p31; margin V.
# Cutoff tau sends a share pi(tau) of chats to n human agents, so the
# human desk sees LAM pi(tau) chats per minute; its abandonment comes
# from the exact Erlang-A chain. The "naive" cutoff assumes an empty
# desk (nobody abandons after handoff); the "system" cutoff uses the
# queue it creates. Both are scored under the true queue.
import math
LAM, F_STD, ALPHA, C, Q_H, V = 3.0, 0.55, 1.0 / 60.0, 8.0, 0.5, 600.0
MEAN, HANDLE = 120.0, 4.0
MU, THETA = 1.0 / HANDLE, 60.0 / MEAN
GRID = list(range(0, 305, 5))
def s(t):
return math.exp(-t / MEAN)
def ai_part(upto):
f = [ALPHA * math.exp(-ALPHA * t) * s(t) for t in range(upto + 1)]
return math.fsum(f) - 0.5 * (f[0] + f[-1])
def p_abandon(lam, n):
w = [1.0]
for k in range(1, n + 401):
w.append(w[-1] * lam / (min(k, n) * MU + max(k - n, 0) * THETA))
eq = math.fsum((k - n) * w[k] for k in range(n + 1, len(w)))
return THETA * eq / math.fsum(w) / lam
def score(tau, n, naive):
left = (F_STD * math.exp(-ALPHA * tau) + 1.0 - F_STD) * s(tau)
pab = 0.0 if naive else p_abandon(LAM * left, n)
return F_STD * V * ai_part(tau) + left * (1 - pab) * (Q_H * V - C)
print("{} chats/min, margin {:.0f} yuan, human session {:.0f} min".format(
LAM, V, HANDLE))
print(" agents naive tau* value | system tau* value P(ab) at tau*")
for n in (3, 4, 5, 6, 8):
tn = max(GRID, key=lambda t: score(t, n, True))
ts = max(GRID, key=lambda t: score(t, n, False))
left = (F_STD * math.exp(-ALPHA * ts) + 1.0 - F_STD) * s(ts)
print("{:7d} {:10d} {:6.1f} | {:11d} {:6.1f} {:13.3f}".format(
n, tn, score(tn, n, False), ts, score(ts, n, False),
p_abandon(LAM * left, n)))
print("naive tau* ignores the queue it feeds; the gap is the cost")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 3: The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback. 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 4 · Red, Amber, Green: Cost-Sensitive Handoff Thresholds on the ROC Curve
- Chapter 5 · A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking
- 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