关于「买家隐藏的状态与每个问题的信息量」,《成交对话、异议与人机交接》给出的定量结论是什么?

结论:第一章把买家的预算与紧迫度写成部分可观测决策过程的隐藏状态,改正一个直觉:过早报价并非没有信息(0.229 比特),它的代价是被拒绝之后的流失。

数据口径:书中的先验、回答概率、成交率、退款率与成本均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见,也不提供任何操纵买家的话术。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.229

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 bits
查看完整验算程序
# 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)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《对话式成交自动机、异议消解信息增益与高客单销售动力学》第 1 章「买家隐藏的状态与每个问题的信息量」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090221

DOI: 10.5281/zenodo.24090221 · 阅读本章所在专著 · 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}
}

本书其他章节结论