What does Zero-Ticket Interfaces and Self-Service State Machines conclude, in numbers, about “The Ceiling on Elimination: Class Share Times Self-Service Completion”?
Answer: The elimination rate equals the sum of share times completion across self-serviceable classes, minus the enquiries that self-service creates. In this example the self-serviceable share is 0.869, which is the ceiling; once the uncertainty in completion and in new enquiries is sampled, the ninety per cent interval runs from 0.468 to 0.601. Nine tenths is out of reach because refunds, payments and miscellaneous requests must stay with people, and they account for 0.131.
Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs; the book is general business analysis, not individual or legal advice. Marked boxes separate published evidence, runnable Python calculations (22 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: 0.131, 0.869
| tickets 366 self-serviceable share 0.869 | |
| human-only share (refund, payment, other) 0.131 | |
| g low mid high perfect | |
| 0.00 | 0.441 0.581 0.722 0.869 |
| 0.05 | 0.397 0.538 0.679 0.825 |
| 0.10 | 0.354 0.494 0.635 0.782 |
| 0.90 needs self-serviceable share > | 0.90 even at completion 1; |
| here the perfect-completion ceiling is 0.869 | |
| human tickets left per 100 orders (12.20 before): | |
| low E | 0.397 -> 7.36 |
| high E | 0.679 -> 3.92 |
Show the full program
# Chapter 2. p21: the ceiling on eliminable tickets
# E = sum over self-serviceable classes of share x completion rate,
# minus g x (eligible share) for new contacts that self-service flows
# create themselves. Shares are the p11 month; completion ranges and g
# are illustrative.
import math
# class, tickets in the p11 month, low, high completion (0 = human)
ROWS = [("not_received", 98, 0.60, 0.90),
("wrong_input", 55, 0.55, 0.85),
("progress", 73, 0.40, 0.80),
("repeat_chase", 38, 0.50, 0.85),
("link_expired", 31, 0.70, 0.95),
("content_q", 23, 0.10, 0.40),
("refund", 18, 0.0, 0.0),
("payment", 12, 0.0, 0.0),
("other", 18, 0.0, 0.0)]
N = int(math.fsum(r[1] for r in ROWS))
def elim(pick, g=0.0):
terms = []
elig = []
for name, k, lo, hi in ROWS:
s = k / N
c = pick(lo, hi)
terms.append(s * c)
if hi > 0:
elig.append(s)
return math.fsum(terms) - g * math.fsum(elig)
elig_share = math.fsum(k / N for _, k, lo, hi in ROWS if hi > 0)
print("tickets {} self-serviceable share {:.3f}".format(N, elig_share))
print("human-only share (refund, payment, other) {:.3f}".format(
1 - elig_share))
print("g low mid high perfect")
for g in (0.0, 0.05, 0.10):
lo = elim(lambda a, b: a, g)
mid = elim(lambda a, b: (a + b) / 2, g)
hi = elim(lambda a, b: b, g)
top = elim(lambda a, b: 1.0 if b > 0 else 0.0, g)
print("{:.2f} {:.3f} {:.3f} {:.3f} {:.3f}".format(
g, lo, mid, hi, top))
print("0.90 needs self-serviceable share >= 0.90 even at completion 1;")
print("here the perfect-completion ceiling is {:.3f}".format(
elim(lambda a, b: 1.0 if b > 0 else 0.0)))
print("human tickets left per 100 orders (12.20 before):")
for label, f in (("low", lambda a, b: a),
("high", lambda a, b: b)):
e = elim(f, 0.05)
print(" {:<4} E={:.3f} -> {:.2f}".format(label, e, 12.20 * (1 - e)))Single source and citation
Fan, Y. (2026). Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination (Version 1.0.0), Chapter 2: The Ceiling on Elimination: Class Share Times Self-Service Completion. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-401 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026401,
author = {Fan, Yafu},
title = {Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Root-Cause Clustering of Tickets: What a Month of After-Sale Messages Is Made Of
- Chapter 3 · The Self-Service Correction State Machine: Guards, Idempotency and Exhaustive Checking
- Chapter 4 · Abuse Limits and Rebind Verification: Stopping Scripts Without Stopping People
- Chapter 5 · One Timed Self-Service Recompute: Window Length, Precision Stamps and Misuse
- Chapter 6 · Progress Transparency and the Residual Human Desk: a Chase Model and Erlang C
- Chapter 7 · Classical Sources East and West: the Ant Hole and the Division of Mental Labour
- Chapter 8 · The Empirical Loop: Field Tools and Checker Specifications