关于「停时协议:秘书问题、跟进上限与锁单时窗」,《异议柔道与定金锁单》给出的定量结论是什么?

结论:第六章把收口写成停时问题:只提一次的成交请求成功率趋近 0.3679,跟进以两次为上限,三天的可退锁单时窗把最终购买概率从 0.225 提到 0.488。

数据口径:书中的顾客群、概率与金额均为示意;全部计算由书中程序生成;本书不构成个人化的法律、财务或投资建议,只讨论守规矩的说服。 第一章的判别树说明,在示意先验下,说「太贵了」的人有 0.734 并不缺钱。

English version

对照数据表

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

lock TP(buy) P(switch) P(drift)P(no)holdmargin/lead
none0.2250.3820.2950.098 0.0000.1011
30.4880.3040.0000.208 0.0060.2137
70.2980.5740.0000.128 0.0140.1202
140.1290.8160.0000.056 0.0280.0298
P(no cheaper rival in T days) = (1 - 0.3 * p)^T, p = 0.3803
查看完整验算程序
# Chapter 6. p63: A refundable deposit turns an open-ended "let me think"
# into a stopping time with a known horizon T. During T days the
# customer keeps searching: each day she meets a rival quote with
# probability 0.30, priced at our price times exp(N(0, 0.10)); she
# switches (and gets her deposit back) if it is cheaper by more than
# 0.03. With no lock she also drifts away with daily probability 0.10
# and decides on her own with daily probability 0.12. With a lock she
# decides on day T. A decision is yes with probability 0.70; a no with
# a lock is refunded in full. Holding a slot costs 0.002 a day.
# Fixed-seed Monte Carlo, 50,000 customers per row; illustrative.
import math
import random

N = 50000
rng = random.Random(20261112)


def no_lock():
    for _ in range(60):
        if rng.random() < 0.30 and math.exp(rng.gauss(0, 0.10)) < 0.97:
            return "switch"
        if rng.random() < 0.10:
            return "drift"
        if rng.random() < 0.12:
            return "buy" if rng.random() < 0.70 else "refuse"
    return "drift"


def lock(t):
    for _ in range(t):
        if rng.random() < 0.30 and math.exp(rng.gauss(0, 0.10)) < 0.97:
            return "switch"
    return "buy" if rng.random() < 0.70 else "refuse"


print("lock T  P(buy) P(switch) P(drift)  P(no)  hold  margin/lead")
rows = [("none", no_lock, 0)] + [(str(t), lambda t=t: lock(t), t)
                                 for t in (3, 7, 14)]
for name, fn, t in rows:
    out = {"buy": 0, "switch": 0, "drift": 0, "refuse": 0}
    for _ in range(N):
        out[fn()] += 1
    pb = out["buy"] / N
    hold = 0.002 * t
    print("{:>6} {:>7.3f} {:>9.3f} {:>8.3f} {:>6.3f} {:>5.3f} {:>12.4f}"
          .format(name, pb, out["switch"] / N, out["drift"] / N,
                  out["refuse"] / N, hold, pb * 0.45 - hold))
print("P(no cheaper rival in T days) = (1 - 0.3 * p)^T, p = {:.4f}".format(
    0.5 * math.erfc(math.log(1 / 0.97) / (0.10 * math.sqrt(2)))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《顾问式销售异议柔道、价格嫌贵贝叶斯拆解与定金锁单停时协议》第 6 章「停时协议:秘书问题、跟进上限与锁单时窗」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026146,
  author    = {Fan, Yafu},
  title     = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论