关于「双轨报价铺垫:混合 logit、折中效应与先报高档的锚定」,《私讯成交的节奏计算》给出的定量结论是什么?

结论:第四章显示双轨报价相对只报基础档,每条询价期望收入为 1.774 倍,真实的三档报价达到 2,209,高于陪衬档。

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

English version

对照数据表

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

menuP(buy)mean ticketrevenue/lead
basic only0.3182,980948
premium only0.2006,8001,363
two tracks0.3824,4041,681
two tracks + dominated0.4114,9052,014
three tracks0.5024,3962,209
six options0.4174,6171,924
two tracks vs basic only: buy ratio 1.200, revenue ratio 1.774
two tracks vs premium only: buy ratio 1.904, revenue ratio 1.233
查看完整验算程序
# Chapter 4. p41: one price, two tracks or more: buy rate and ticket
# Model (illustrative parameters): a mixed logit with two segments.
# Segment A (share W_A) has a budget of 5,000 and price weight B_A;
# segment B has no budget cap and price weight B_B. Option utility =
# quality - price weight * price / 1000, plus a compromise bonus KAPPA for
# the middle option of an odd menu of three or more, plus an attraction
# bonus DELTA for an option that dominates another one in the menu
# (better quality, price not higher). Not buying has utility U0 + THETA *
# max(0, n - 3) for a menu of n options (choice overload past three).
# Every offer is real and sellable; none is a fake reference price.
import math

KAPPA, DELTA, U0, THETA = 0.35, 0.30, 1.5, 0.25
SEGMENTS = [(0.7, 1.0, 5000), (0.3, 0.5, 10 ** 9)]
OPT = {"basic": (3.2, 2980), "mid": (4.4, 4580), "premium": (5.6, 6800),
       "premium-lite": (5.0, 6800), "basic+": (3.4, 3380),
       "mid+": (4.7, 5280), "vip": (6.1, 8800)}
MENUS = [("basic only", ["basic"]),
         ("premium only", ["premium"]),
         ("two tracks", ["basic", "premium"]),
         ("two tracks + dominated", ["basic", "premium", "premium-lite"]),
         ("three tracks", ["basic", "mid", "premium"]),
         ("six options", ["basic", "basic+", "mid", "mid+", "premium",
                          "vip"])]


def segment(menu, b, budget):
    ranked = sorted(menu, key=lambda k: OPT[k][1])
    mid = ranked[len(ranked) // 2] if len(menu) % 2 == 1 else None
    u = {}
    for k in menu:
        q, p = OPT[k]
        if p > budget:
            continue
        terms = [q, -b * p / 1000]
        if len(menu) >= 3 and k == mid:
            terms.append(KAPPA)
        if any(q > OPT[j][0] and p <= OPT[j][1] for j in menu if j != k):
            terms.append(DELTA)
        u[k] = math.fsum(terms)
    zero = math.exp(U0 + THETA * max(0, len(menu) - 3))
    den = math.fsum([zero] + [math.exp(v) for v in u.values()])
    buy = math.fsum(math.exp(v) for v in u.values()) / den
    rev = math.fsum(math.exp(v) * OPT[k][1] for k, v in u.items()) / den
    return buy, rev


def evaluate(menu):
    parts = [(w, segment(menu, b, cap)) for w, b, cap in SEGMENTS]
    buy = math.fsum(w * r[0] for w, r in parts)
    rev = math.fsum(w * r[1] for w, r in parts)
    return buy, rev / buy, rev


print("{:<24}{:>7}{:>13}{:>15}".format("menu", "P(buy)", "mean ticket",
                                         "revenue/lead"))
for name, menu in MENUS:
    buy, ticket, rev = evaluate(menu)
    print("{:<24}{:>7.3f}{:>13,.0f}{:>15,.0f}".format(name, buy, ticket, rev))
buy1, _, rev1 = evaluate(["basic"])
buy2, _, rev2 = evaluate(["basic", "premium"])
buy3, _, rev3 = evaluate(["premium"])
print("two tracks vs basic only: buy ratio {:.3f}, revenue ratio {:.3f}"
      .format(buy2 / buy1, rev2 / rev1))
print("two tracks vs premium only: buy ratio {:.3f}, revenue ratio {:.3f}"
      .format(buy2 / buy3, rev2 / rev3))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《即时通讯气泡节奏学、已读不回破冰博弈与高客单私讯逼单母典》第 4 章「双轨报价铺垫:混合 logit、折中效应与先报高档的锚定」(版本 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}
}

本书其他章节结论