What does Closing Conversations, Objections and Hand-Overs conclude, in numbers, about “Trust-Threshold Stopping Rules and Planning the Human Desk”?

Answer: Chapter 6 solves for a trust-threshold stopping rule: keep talking below a belief of 0.138, hand over between 0.138 and 0.500, let the AI ask for payment above 0.500; and staffs the human desk with the Erlang C formula.

Scope of the numbers: Priors, answer probabilities, close rates, refund rates and costs are illustrative or synthetic; all data are generated by its programs; the book is not legal advice and offers no scripts for manipulating buyers. Marked boxes separate published evidence, runnable Python calculations (16 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. printed values that match the answer: 0.138, 0.500

   human time worth RM 250 a hand-over:
     from P(ready) 0.000: keep talking
     from P(ready) 0.138: hand to a human
     from P(ready) 0.500: ask for payment
     value at 0.1: RM 2,454 (ask now RM 686)
     value at 0.3: RM 3,768 (ask now RM 2,058)
     value at 0.6: RM 6,001 (ask now RM 4,116)
   human time worth RM 500 a hand-over:
     from P(ready) 0.000: keep talking
     from P(ready) 0.295: hand to a human
     from P(ready) 0.415: ask for payment
Show the full program
# Chapter 6. p11: When should the AI ask for payment, hand over to a human,
# or keep talking? The buyer is ready to buy or not; the AI holds the
# belief p = P(ready). Each further turn: 10% of buyers drift away, a
# buyer who is not ready becomes ready with probability 0.04 (questions
# and proof do their work), and the buyer shows a buying signal with
# probability 0.6 if ready, 0.15 if not. Asking for payment closes a ready
# buyer with probability 0.7 (RM 9,800); a buyer who is not ready refuses,
# and half of them leave. A human closer's time costs c per hand-over;
# the human closes a ready buyer with probability 0.9 and one not ready
# with 0.2. Value iteration on a grid of 401 beliefs.
V, N = 9800.0, 400
DRIFT, NURT, SIG, ASK, LEAVE, HUMAN = 0.10, 0.04, (0.6, 0.15), 0.7, 0.5, \
    (0.9, 0.2)

def interp(f, p):
    x = p * N
    i = min(int(x), N - 1)
    return f[i] + (f[i + 1] - f[i]) * (x - i)

def solve(cost):
    f = [0.0] * (N + 1)
    for _ in range(5000):
        g, act = [], []
        for i in range(N + 1):
            p = i / N
            q = p + (1 - p) * NURT
            cont = 0.0
            for sy, sn in ((SIG[0], SIG[1]), (1 - SIG[0], 1 - SIG[1])):
                pz = q * sy + (1 - q) * sn
                cont += pz * interp(f, q * sy / pz)
            cont *= 1 - DRIFT
            stay = p * (1 - ASK) + (1 - p) * (1 - LEAVE)
            close = p * ASK * V + stay * interp(f, p * (1 - ASK) / stay)
            esc = (p * HUMAN[0] + (1 - p) * HUMAN[1]) * V - cost
            best = max((cont, "keep talking"), (close, "ask for payment"),
                       (esc, "hand to a human"))
            g.append(best[0])
            act.append(best[1])
        done = max(abs(a - b) for a, b in zip(f, g)) < 1e-7
        f = g
        if done:
            break
    return f, act

if __name__ == "__main__":
    for cost in (250.0, 500.0):
        f, act = solve(cost)
        print("   human time worth RM {:.0f} a hand-over:".format(cost))
        prev = None
        for i in range(N + 1):
            if act[i] != prev:
                print("     from P(ready) {:.3f}: {}".format(i / N, act[i]))
                prev = act[i]
        if cost == 250.0:
            for p in (0.1, 0.3, 0.6):
                i = int(p * N)
                print("     value at {:.1f}: RM {:,.0f} (ask now RM {:,.0f})"
                      .format(p, f[i], p * ASK * V))

Single source and citation

Fan, Y. (2026). Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics (Version 1.0.0), Chapter 6: Trust-Threshold Stopping Rules and Planning the Human Desk. 5D Library. https://doi.org/10.5281/zenodo.24090221

DOI: 10.5281/zenodo.24090221 · Read the monograph · 5DL-B-084 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026084,
  author    = {Fan, Yafu},
  title     = {Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090221},
  url       = {https://doi.org/10.5281/zenodo.24090221}
}

Other chapter answers in this book