关于「降单经济学:蚕食、策略性等待与频控上限」,《离场降单与感谢页加购》给出的定量结论是什么?

结论:降单的账有三笔:挽回、蚕食与学习。前两笔决定价格比的甜区与下限,第三笔决定频控。示意参数下,数字品的最优价格比约 0.432,频控一次稳态仍为正,频控两次转负;实物品类根本不该做价格降单。科斯猜想说明,降单兑现得越勤,原价越守不住。

数据口径:光标轨迹确实带有意图信息,但模型输出的是概率,合成桌面数据上的 AUC 为 0.809,触屏会话失去鼠标信号后降到 0.618。 多巴胺编码的是奖赏预测误差,没有文献证明付款后存在十秒窗口;感谢页上可测的是加购接受率的半衰期,示意参数下估计为 6.50 秒,前 10 秒集中了 0.830 的接受。

English version

对照数据表

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

r accept net digital net shipped (per 1,000 pop-ups)
0.10.148-88.91-2343.22
0.20.110179.91-1490.13
0.30.081308.73-928.46
0.40.060352.33-564.20
0.50.045346.16-332.82
0.60.033312.68-190.32
0.70.024265.71-106.92
0.80.018213.41-62.65
digital: best r 0.432, net 354.48, floor 0.127
shipped: best r 0.957, net -41.88, floor none
查看完整验算程序
# Chapter 2. p21: net value of one downsell offer by its price ratio.
# Full price 30 (unitless). The downsell sells the same entry item at
# ratio r of full price. Leavers accept with A(r) = 0.20 exp(-3 r):
# deeper cuts are accepted more. Would-be full-price buyers who see the
# pop-up (1.05 per 100 pops, from the cut of p13) take it instead with
# C(r) = 0.8 (1 - r). Each pop-up costs 0.15 in annoyance. Two cost
# structures: a digital report (unit cost 1) and a shipped item (18).
# Net per 1,000 pop-ups; the price floor is the lowest r with net > 0.
import math

P, HIT, K = 30.0, 0.0105, 0.15


def net(r, cost):
    acc = 0.20 * math.exp(-3.0 * r)
    margin = r * P - cost
    cann = HIT * 0.8 * (1.0 - r) * (P - r * P)
    per_pop = math.fsum([0.895 * acc * margin, -cann, -K])
    return 1000.0 * per_pop, acc


print("  r    accept  net digital  net shipped  (per 1,000 pop-ups)")
for r in (0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8):
    nd, acc = net(r, 1.0)
    ns, _ = net(r, 18.0)
    print("{:.1f}   {:.3f}   {:10.2f}   {:10.2f}".format(r, acc, nd, ns))
grid = [i / 1000.0 for i in range(50, 1001)]
for name, cost in (("digital", 1.0), ("shipped", 18.0)):
    best = max(grid, key=lambda r: net(r, cost)[0])
    pos = [r for r in grid if net(r, cost)[0] > 0.0]
    floor = "{:.3f}".format(min(pos)) if pos else "none"
    print("{}: best r {:.3f}, net {:.2f}, floor {}".format(
        name, best, net(best, cost)[0], floor))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《离场轨迹微降单挽留、零门槛诱饵捕获与付款成功页黄金十秒连带母典》第 2 章「降单经济学:蚕食、策略性等待与频控上限」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026398,
  author    = {Fan, Yafu},
  title     = {Exit-Trajectory Micro-Downsells, Zero-Friction Lead Magnet Capture and Thank-You-Page Ten-Second Monetisation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论