5D Library › Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics · 中文
Chapter 1. What the Buyer Hides, and How Much Each Question Tells
A high-ticket conversation as a partially observable decision problem
A prospect asks in a private channel about a business licence at RM 9,800 or an advanced programme at RM 29,800. The seller cannot see the two things that matter most: how much the buyer can pay now (budget) and how pressing the problem is (urgency). What the seller can do is ask, watch the answers, update the judgement, and finally decide which price to quote, or not to quote yet. This is a partially observable Markov decision process (POMDP) (Kaelbling et al. 1998): the true state is hidden, and the seller acts on a belief, the posterior distribution over states.
In the illustrative model budget has three levels: cannot pay RM 9,800 (prior 0.45), can pay RM 9,800 (0.35), can pay RM 29,800 (0.20); high urgency has a prior of 0.4, independent of budget. Rackham’s SPIN method divides diagnostic questions into four kinds: Situation, Problem, Implication and Need-payoff (Rackham 1988). Each question’s answer (yes or no) occurs with different probabilities in different states, and its information is the mutual information between state and answer (Lindley 1956).
Calculation
# Chapter 1. p01: What a buyer is hiding, and how much each question tells.
# Hidden state = budget x urgency. Budget: B0 cannot pay RM 9,800 now,
# B1 can pay 9800, B2 can pay 29800 (prior 0.45 / 0.35 / 0.20); urgency
# high with prior 0.4, independent. Each SPIN-style question has a yes/no
# answer whose probability depends on the state. A price pitched straight
# away is also a "question": the buyer's accept/decline answer is evidence.
# Information = mutual information I(state; answer), in bits.
import math
from math import log2
STATES = [(b, u) for b in (0, 1, 2) for u in (0, 1)]
PB, PU = (0.45, 0.35, 0.20), 0.4
PRIOR = {s: PB[s[0]] * (PU if s[1] else 1 - PU) for s in STATES}
# P(yes | budget, urgency) for each question
Q = {
"S situation (team > 5, revenue known)": lambda b, u: (0.1, 0.6, 0.9)[b],
"P problem (names a costly problem)": lambda b, u: 0.8 if u else 0.2,
"I implication (puts a monthly RM cost)":
lambda b, u: (0.1, 0.45, 0.75)[b] * (1.0 if u else 0.5),
"N need-payoff (says solving is worth it)":
lambda b, u: (0.2, 0.6, 0.85)[b] * (1.0 if u else 0.5),
}
# accept probability of a pitch, by price
def accept(price, b, u):
if price == 29800:
return (0.0, 0.0, 0.55 if u else 0.08)[b]
return (0.02, 0.6 if u else 0.12, 0.6 if u else 0.12)[b]
def entropy(p):
return -math.fsum(v * log2(v) for v in p.values() if v > 0)
def posterior(prior, like, yes):
post = {s: prior[s] * (like(*s) if yes else 1 - like(*s))
for s in prior}
z = math.fsum(post.values())
return {s: v / z for s, v in post.items()}, z
def info(prior, like):
h = entropy(prior)
out = 0.0
for yes in (True, False):
post, pz = posterior(prior, like, yes)
out += pz * (h - entropy(post))
return out
if __name__ == "__main__":
print(" uncertainty before talking: {:.3f} bits".format(entropy(PRIOR)))
for name, like in Q.items():
print(" {:<42} {:.3f} bits".format(name, info(PRIOR, like)))
for price in (9800, 29800):
like = lambda b, u, p=price: accept(p, b, u)
print(" pitch RM {:,} at once (accept or decline) {:.3f} bits"
.format(price, info(PRIOR, like)))
# uncertainty before talking: 2.484 bits
# S situation (team > 5, revenue known) 0.343 bits
# P problem (names a costly problem) 0.268 bits
# I implication (puts a monthly RM cost) 0.164 bits
# N need-payoff (says solving is worth it) 0.169 bits
# pitch RM 9,800 at once (accept or decline) 0.229 bits
# pitch RM 29,800 at once (accept or decline) 0.174 bitsBefore the conversation starts, the seller’s uncertainty about the buyer’s state is 2.484 bits. The situation question carries 0.343 bits, the problem question 0.268, the implication question 0.164 and the need-payoff question 0.169.
An intuition to correct: an early pitch is not empty of information
It is often said that an early pitch “learns nothing”. On checking, that is not so: quote RM 9,800 straight away and the buyer’s acceptance or refusal itself carries 0.229 bits, more than most diagnostic questions; quoting RM 29,800 straight away carries 0.174 bits. The cost of an early pitch lies not in information but in what follows a refusal: some buyers leave on the spot, and those who stay accept a second offer less often.
Ask first or pitch first
Calculation
# Chapter 1. p02: Ask first or pitch first? Exact expected value per lead,
# by enumerating every answer path. Ask the first k questions of p01 in
# the order S, P, I, N (each question loses 2% of buyers), then pick the
# plan with the most expected value under the posterior:
# (a) RM 29,800, and if declined a RM 9,800 downsell, (b) RM 9,800 only,
# (c) no pitch now: nurture. A nurtured buyer becomes urgent within six
# months with probability 0.35 and is then worth the best plan for the
# urgent version of his state, discounted by 0.9. After a declined pitch
# a buyer leaves for good (50% if not urgent, 20% if urgent: a pitch that
# comes too early feels pushy), and the rest accept a second offer (and
# any later one) only half as often (lost trust).
# The bound is a seller who knows the state (full information).
import math
from itertools import product
import importlib.util
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
p01 = load("p01_belief")
DROP, TRUST, NURT, DISC = 0.02, 0.5, 0.35, 0.9
LEAVE = (0.5, 0.2) # by urgency: low, high
ORDER = list(p01.Q)
def pitch(s):
"""Immediate revenue and close probability of plans (a) and (b)."""
a29, a98 = p01.accept(29800, *s), p01.accept(9800, *s)
second = (1 - a29) * (1 - LEAVE[s[1]]) * TRUST * a98
return {"29800+downsell": (29800 * a29 + 9800 * second, a29 + second),
"9800 only": (9800 * a98, a98)}
def later(s):
b = s[0]
return NURT * DISC * max(v[0] for v in pitch((b, 1)).values())
def plans(s):
out = {}
for name, (r, c) in pitch(s).items():
out[name] = (r + (1 - c) * (1 - LEAVE[s[1]]) * TRUST * later(s), c)
out["nurture"] = (later(s), 0.0)
return out
def value(belief):
best = None
for name in ("29800+downsell", "9800 only", "nurture"):
r = math.fsum(belief[s] * plans(s)[name][0] for s in belief)
c = math.fsum(belief[s] * plans(s)[name][1] for s in belief)
if best is None or r > best[1]:
best = (name, r, c)
return best
def ask_then_offer(k):
rev = close = 0.0
used = {}
for answers in product((True, False), repeat=k):
belief, pr = dict(p01.PRIOR), 1.0
for q, yes in zip(ORDER[:k], answers):
belief, pz = p01.posterior(belief, p01.Q[q], yes)
pr *= pz
name, r, c = value(belief)
keep = (1 - DROP) ** k
rev += pr * keep * r
close += pr * keep * c
used[name[:5]] = used.get(name[:5], 0.0) + pr
return rev, close, used
if __name__ == "__main__":
print(" questions RM per lead close now plans used (share)")
for k in range(0, 5):
rev, close, used = ask_then_offer(k)
mix = ", ".join("{} {:.2f}".format(n, v)
for n, v in sorted(used.items()))
print(" {:9d} {:11,.0f} {:9.3f} {}".format(k, rev, close, mix))
orev = math.fsum(p01.PRIOR[s] * max(v[0] for v in plans(s).values())
for s in p01.STATES)
print(" full-information bound: RM {:,.0f} per lead".format(orev))
# questions RM per lead close now plans used (share)
# 0 2,522 0.108 29800 1.00
# 1 2,666 0.138 29800 0.43, 9800 0.57
# 2 2,661 0.111 29800 0.19, 9800 0.57, nurtu 0.24
# 3 2,671 0.121 29800 0.27, 9800 0.57, nurtu 0.17
# 4 2,669 0.115 29800 0.20, 9800 0.59, nurtu 0.21
# full-information bound: RM 3,466 per leadIn the illustrative model a refused pitch drives some buyers away (50% of buyers who are not urgent, 20% of urgent ones), and the rest accept any later offer half as often; each question asked loses 2% of buyers; a buyer who is not pitched but nurtured becomes urgent within six months with probability 0.35.
Pitching at once, a prospect is worth RM 2,522 in expectation, with a close rate now of 0.108. Asking one situation question before the pitch raises the value to RM 2,666 and the close rate to 0.138. One more question leaves the value almost unchanged (RM 2,661) but lowers the close rate now to 0.111, because 0.24 of the answer paths choose “nurture, do not pitch yet”: diagnosis lets the seller recognise buyers who are not ready, and not burn them. If the seller knew every buyer’s state exactly, the value would be at most RM 3,466.
Note
The close rate is not the only goal. The value of diagnostic questions sometimes shows as a higher close rate now, and sometimes as one pitch fewer that would have been refused: the latter lowers the close rate now but keeps the buyer’s future value. Looking only at the close rate now undervalues diagnosis.
Summary
In the illustrative model an early pitch is not empty of information; its cost is the loss of buyers and of trust after a refusal. Asking one diagnostic question first raises the value from RM 2,522 to RM 2,666; the full-information bound is RM 3,466. That bound gives the most that diagnostic questions could ever add.
References
Fan, Y. (2026). Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics: Diagnostic Question Trees, Trust-Threshold Stopping Rules and AI Closer Escalation Protocols [对话式成交自动机、异议消解信息增益与高客单销售动力学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090221 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).