What does Closing Conversations, Objections and Hand-Overs conclude, in numbers, about “Decoding the Four Classic Objections with Bayes”?

Answer: Chapter 3 decodes the four classic objections with Bayes' rule: answering by the posterior recovers 0.219 of the price, one script only 0.163; asking a clarifying question after "too expensive" raises the recovery by 9.9%.

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 onlyprinted values that match the answer: 0.163, 0.219

objection P(obj) most likely cause best response value
too expensive0.357 budget 0.490 reframe value 0.161
think it over0.275 trust 0.409 proof+guarantee 0.249
ask my partner0.215 partner 0.453 joint call 0.266
no time0.152 time 0.459 time plan 0.236
value per objector (share of full price):
matched response 0.219; one script (reframe) 0.163
Show the full program
# Chapter 3. p05: Decoding the four classic objections. Among buyers who
# object, the hidden cause is: a real budget limit, trust not yet built,
# value not yet clear, a real lack of time, or a genuine joint decision
# (prior 0.25 / 0.25 / 0.25 / 0.10 / 0.15). Each cause makes each
# objection more or less likely; Bayes gives the cause behind an
# objection. Each response closes with a probability that depends on the
# TRUE cause; a payment plan or downsell brings in 0.6 of the price.
import math
CAUSES = ("budget", "trust", "value", "time", "partner")
PRIOR = (0.25, 0.25, 0.25, 0.10, 0.15)
OBJ = ("too expensive", "think it over", "ask my partner", "no time")
LIKE = ((0.70, 0.15, 0.10, 0.05), (0.20, 0.45, 0.25, 0.10),
        (0.45, 0.30, 0.10, 0.15), (0.05, 0.20, 0.05, 0.70),
        (0.10, 0.20, 0.65, 0.05))
RESP = {  # close probability by true cause, revenue factor
    "reframe value": ((0.05, 0.15, 0.35, 0.10, 0.10), 1.0),
    "plan/downsell": ((0.30, 0.08, 0.12, 0.08, 0.10), 0.6),
    "proof+guarantee": ((0.05, 0.40, 0.20, 0.10, 0.15), 1.0),
    "joint call": ((0.05, 0.15, 0.10, 0.05, 0.45), 1.0),
    "time plan": ((0.03, 0.10, 0.12, 0.40, 0.08), 1.0),
}

def posterior(o, prior=PRIOR):
    w = [prior[c] * LIKE[c][o] for c in range(5)]
    z = math.fsum(w)
    return [x / z for x in w], z

def score(post, r):
    p, f = RESP[r]
    close = math.fsum(post[c] * p[c] for c in range(5))
    return close, close * f

if __name__ == "__main__":
    print("   objection       P(obj)  most likely cause   best response"
          "    value")
    total_best = total_one = 0.0
    for o, name in enumerate(OBJ):
        post, pz = posterior(o)
        c = max(range(5), key=lambda i: post[i])
        r = max(RESP, key=lambda x: score(post, x)[1])
        v = score(post, r)[1]
        total_best += pz * v
        total_one += pz * score(post, "reframe value")[1]
        print("   {:<14}  {:6.3f}  {:<7} {:5.3f}       {:<15}  {:.3f}".format(
            name, pz, CAUSES[c], post[c], r, v))
    print("   value per objector (share of full price):")
    print("     matched response {:.3f}; one script (reframe) {:.3f}".format(
        total_best, total_one))

Single source and citation

Fan, Y. (2026). Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics (Version 1.0.0), Chapter 3: Decoding the Four Classic Objections with Bayes. 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