关于「首响时延:询价冷却曲线、夜间自动回执与爱尔朗 C 排班」,《私讯成交的节奏计算》给出的定量结论是什么?

结论:第二章显示询价热度约 63 分钟减半,每小时 40 条询价需要 6 位客服才能把超过 5 分钟的等待压在 0.10 以下。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不构成个别化的法律、合规或经营建议,只讨论守规矩的成交。 第一章用动态规划切分一条 184 字的示意报价,最优为 5 个气泡,代价 46.52,一句一条的代价是 142.00。

English version

对照数据表

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

inquiries/hagentsP(wait>0)P(wait>5min)mean wait (min)
2030.4440.1932.67
2040.1740.0330.52
2050.0600.0050.12
4050.5540.2413.32
4060.2850.0540.85
4070.1350.0110.27
8090.6530.2843.92
80100.4090.0771.23
80110.2450.0200.49
rule: smallest c with P(wait > 5 min) <= 0.10
查看完整验算程序
# Chapter 2. p22: how many agents keep first replies under 5 minutes
# Model: Erlang C queue (M/M/c). Inquiries arrive at rate LAM per hour,
# each agent handles one conversation at a time with mean handling time
# 6 minutes (illustrative). P(wait > t) = C(c, a) * exp(-(c*mu - LAM) t),
# where a = LAM / mu and C(c, a) is the Erlang C probability of waiting.
import math

MU = 10.0          # conversations per agent-hour (6 minutes each)
TARGET_T = 5 / 60  # 5 minutes
TARGET_P = 0.10


def erlang_c(c, a):
    terms = [a ** k / math.factorial(k) for k in range(c)]
    last = a ** c / math.factorial(c) * c / (c - a)
    return last / (math.fsum(terms) + last)


def p_wait_over(c, lam, t):
    a = lam / MU
    if c <= a:
        return 1.0
    return erlang_c(c, a) * math.exp(-(c * MU - lam) * t)


def mean_wait_min(c, lam):
    a = lam / MU
    return erlang_c(c, a) / (c * MU - lam) * 60


print("inquiries/h  agents  P(wait>0)  P(wait>5min)  mean wait (min)")
for lam in (20.0, 40.0, 80.0):
    c = int(lam / MU) + 1
    while p_wait_over(c, lam, TARGET_T) > TARGET_P:
        c += 1
    for cc in (c - 1, c, c + 1):
        if cc <= lam / MU:
            continue
        print("{:>11.0f} {:>7} {:>10.3f} {:>13.3f} {:>16.2f}".format(
            lam, cc, erlang_c(cc, lam / MU), p_wait_over(cc, lam, TARGET_T),
            mean_wait_min(cc, lam)))
print("rule: smallest c with P(wait > 5 min) <= {:.2f}".format(TARGET_P))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《即时通讯气泡节奏学、已读不回破冰博弈与高客单私讯逼单母典》第 2 章「首响时延:询价冷却曲线、夜间自动回执与爱尔朗 C 排班」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026145,
  author    = {Fan, Yafu},
  title     = {Instant-Messaging Bubble Rhythm, Read-No-Reply Icebreaking Games and High-Ticket Closing in Private Messages},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论