Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation: chapter answers
While a high-intent buyer waits in a private-message channel, the owner must decide how fast to reply, after how many seconds the AI should hand the conversation to a person, which signals show that a conversation has turned dangerous, where to intervene when the buyer is dissatisfied, and how to make the buyer remember being looked after. This book writes these decisions as runnable mathematics and states what data would refute each conclusion. Its parameters are illustrative; all calculations are generated by its programs; it is not personalised legal, financial or business advice.
DOI pending · monograph page goes live after publication · 5DL-B-175 · 中文版
- Chapter 1 · The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring
Chapter 1 shows that with the same mean patience the hazard can rise, fall, or rise and then fall; under exponential patience a buyer who has waited any length of time leaves within the next 30 seconds with probability… - Chapter 2 · Queues that Give Up: Erlang C, Erlang-A and Square-Root Staffing
Chapter 2 uses Erlang-A to show that for the same six-person team Erlang C reports a mean wait of 103.6 seconds while, with abandonment counted, it is only 13.1 seconds, at the price of 0.109 of high-intent buyers leavi… - Chapter 3 · The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback
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… - Chapter 4 · Red, Amber, Green: Cost-Sensitive Handoff Thresholds on the ROC Curve
Chapter 4 shows that red-amber-green thresholds must move with margin: a threshold fixed at the midpoint costs 1232.9 yuan on expensive goods where the optimum costs 550.2. - Chapter 5 · A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking
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… - Chapter 6 · The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority
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 alo… - Chapter 7 · The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange
Chapter 7 examines the nine postures of the Guiguzi's "Fu Yan" and Erlang's telephone-exchange papers of 1909 and 1917, finding that push notices raise the variance-to-mean ratio of message arrivals to 1.992 and break t… - Chapter 8 · Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions
Chapter 8 gives an owner's checklist, six red lines for scripts and a pre-registered testing plan whose largest test needs 3470 conversations per arm. Marked boxes separate published evidence, runnable Python calculatio…
Illustrative model calculation, not a live quote