What does Closing Conversations, Objections and Hand-Overs conclude, in numbers, about “A Ledger of Ten Thousand Conversations, Probability Calibration and a Pre-Registered Experiment”?

Answer: Chapter 8 gives a ledger of ten thousand conversations, a calibration check and a pre-registered experiment. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

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. standard-library Python only

playbookAI saleshuman saleshand-oversnet RM
AI only (optimal)2,3580021,229,728
AI + human (optimal)02,6186,30221,998,388
ask at first signal1,9300017,370,880
everyone to a human02,67410,00021,578,784
Show the full program
# Chapter 8. p14: A ledger for 10,000 AI sales conversations (RM 9,800
# offer), simulated buyer by buyer with the model of p11; 10% of buyers
# are ready at the start (most inbound chats are cold). Playbooks: the
# optimal AI-only rule, the optimal rule with human hand-over (RM 250 a
# hand-over), "ask at the first buying signal", and "hand everyone to a
# human at once". Refunds take 8%
# of sales revenue; each AI conversation costs RM 3. Seed 84.
import importlib.util
import random

def load(name):
    spec = importlib.util.spec_from_file_location(name, name + ".py")
    m = importlib.util.module_from_spec(spec)
    spec.loader.exec_module(m)
    return m

p11 = load("p11_stopping")
V = p11.V

def play(rng, rule, n=10000, p0=0.1):
    sold_ai = sold_h = hand = 0
    for _ in range(n):
        ready, p, sig = rng.random() < p0, p0, False
        for turn in range(60):
            a = rule(p, sig, turn)
            if a == "ask for payment":
                if ready and rng.random() < p11.ASK:
                    sold_ai += 1
                    break
                if not ready and rng.random() < p11.LEAVE:
                    break
                r, s = p * (1 - p11.ASK), (1 - p) * (1 - p11.LEAVE)
                p = r / (r + s)
                continue
            if a == "hand to a human":
                hand += 1
                sold_h += rng.random() < p11.HUMAN[0 if ready else 1]
                break
            if rng.random() < p11.DRIFT:
                break
            if not ready and rng.random() < p11.NURT:
                ready = True
            q = p + (1 - p) * p11.NURT
            y, n_ = p11.SIG
            sig = rng.random() < (y if ready else n_)
            p = q * y / (q * y + (1 - q) * n_) if sig else \
                q * (1 - y) / (q * (1 - y) + (1 - q) * (1 - n_))
    rev = (sold_ai + sold_h) * V
    net = rev * 0.92 - hand * 250 - n * 3
    return sold_ai, sold_h, hand, net

def policy(cost):
    _, act = p11.solve(cost)
    return lambda p, sig, t: act[min(p11.N, round(p * p11.N))]

if __name__ == "__main__":
    rules = {"AI only (optimal)": policy(1e9),
             "AI + human (optimal)": policy(250.0),
             "ask at first signal": lambda p, s, t: "ask for payment"
             if s else "keep talking",
             "everyone to a human": lambda p, s, t: "hand to a human"}
    print("   playbook               AI sales  human sales  hand-overs"
          "  net RM")
    for name, rule in rules.items():
        a, h, k, net = play(random.Random(84), rule)
        print("   {:<22} {:8,d}  {:11,d}  {:10,d}  {:>12,.0f}".format(
            name, a, h, k, net))

Single source and citation

Fan, Y. (2026). Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics (Version 1.0.0), Chapter 8: A Ledger of Ten Thousand Conversations, Probability Calibration and a Pre-Registered Experiment. 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