关于「信任阈值停时规则与人工坐席规划」,《成交对话、异议与人机交接》给出的定量结论是什么?

结论:第六章求解信任阈值停时规则:信念低于 0.138 继续聊,0.138 至 0.500 交给人,0.500 以上由 AI 请求付款;并以爱尔朗 C 公式配置人工坐席。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.138, 0.500

   human time worth RM 250 a hand-over:
     from P(ready) 0.000: keep talking
     from P(ready) 0.138: hand to a human
     from P(ready) 0.500: ask for payment
     value at 0.1: RM 2,454 (ask now RM 686)
     value at 0.3: RM 3,768 (ask now RM 2,058)
     value at 0.6: RM 6,001 (ask now RM 4,116)
   human time worth RM 500 a hand-over:
     from P(ready) 0.000: keep talking
     from P(ready) 0.295: hand to a human
     from P(ready) 0.415: ask for payment
查看完整验算程序
# Chapter 6. p11: When should the AI ask for payment, hand over to a human,
# or keep talking? The buyer is ready to buy or not; the AI holds the
# belief p = P(ready). Each further turn: 10% of buyers drift away, a
# buyer who is not ready becomes ready with probability 0.04 (questions
# and proof do their work), and the buyer shows a buying signal with
# probability 0.6 if ready, 0.15 if not. Asking for payment closes a ready
# buyer with probability 0.7 (RM 9,800); a buyer who is not ready refuses,
# and half of them leave. A human closer's time costs c per hand-over;
# the human closes a ready buyer with probability 0.9 and one not ready
# with 0.2. Value iteration on a grid of 401 beliefs.
V, N = 9800.0, 400
DRIFT, NURT, SIG, ASK, LEAVE, HUMAN = 0.10, 0.04, (0.6, 0.15), 0.7, 0.5, \
    (0.9, 0.2)

def interp(f, p):
    x = p * N
    i = min(int(x), N - 1)
    return f[i] + (f[i + 1] - f[i]) * (x - i)

def solve(cost):
    f = [0.0] * (N + 1)
    for _ in range(5000):
        g, act = [], []
        for i in range(N + 1):
            p = i / N
            q = p + (1 - p) * NURT
            cont = 0.0
            for sy, sn in ((SIG[0], SIG[1]), (1 - SIG[0], 1 - SIG[1])):
                pz = q * sy + (1 - q) * sn
                cont += pz * interp(f, q * sy / pz)
            cont *= 1 - DRIFT
            stay = p * (1 - ASK) + (1 - p) * (1 - LEAVE)
            close = p * ASK * V + stay * interp(f, p * (1 - ASK) / stay)
            esc = (p * HUMAN[0] + (1 - p) * HUMAN[1]) * V - cost
            best = max((cont, "keep talking"), (close, "ask for payment"),
                       (esc, "hand to a human"))
            g.append(best[0])
            act.append(best[1])
        done = max(abs(a - b) for a, b in zip(f, g)) < 1e-7
        f = g
        if done:
            break
    return f, act

if __name__ == "__main__":
    for cost in (250.0, 500.0):
        f, act = solve(cost)
        print("   human time worth RM {:.0f} a hand-over:".format(cost))
        prev = None
        for i in range(N + 1):
            if act[i] != prev:
                print("     from P(ready) {:.3f}: {}".format(i / N, act[i]))
                prev = act[i]
        if cost == 250.0:
            for p in (0.1, 0.3, 0.6):
                i = int(p * N)
                print("     value at {:.1f}: RM {:,.0f} (ask now RM {:,.0f})"
                      .format(p, f[i], p * ASK * V))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《对话式成交自动机、异议消解信息增益与高客单销售动力学》第 6 章「信任阈值停时规则与人工坐席规划」(版本 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}
}

本书其他章节结论