关于「加购定价的在线学习与辛普森悖论」,《加购、升单与交叉推荐》给出的定量结论是什么?
结论:第六章以汤普森抽样把定价测试的损失从 RM 48,005 降到 RM 1,831,并展示推荐比较中的辛普森悖论。
数据口径:书中的估值分布、接受率、退款率与 30 个站点的需求结构均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。 第一章证明最优加购价格比不是固定区间:示意模型中摩擦为零时最优比为 0.451、对平均客单价贡献 +22.5%,随估值分布变化可从 0.246 到 0.812,贡献 +15.0% 到 +31.0%;两个加购合计 +34.7%。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1831, 48005
| bump RM | 19: take 0.854, per order 16.22 |
| bump RM | 29: take 0.700, per order 20.30 |
| bump RM | 44: take 0.501, per order 22.05 |
| bump RM | 69: take 0.288, per order 19.86 |
| split | revenue RM 392,991; regret RM 48,005 |
| thompson revenue RM 439,165; regret RM 1,831 |
查看完整验算程序
# Chapter 6. p11: Choosing a bump price by Thompson sampling.
# Four candidate bump prices with true take rates from p01's model at
# zero friction. Revenue per order = price x take. Over 20,000 orders we
# compare an even split (A/B/C/D test, then nothing learned until the
# end) with Thompson sampling on Beta posteriors of take, choosing the
# price with the highest sampled revenue. Regret = revenue lost against
# always using the best price.
import random
from math import log, erf, sqrt
def take(p, med=0.45, sd=0.8):
return 0.5 * (1 - erf((log(p / 98) - log(med)) / sd / sqrt(2)))
PRICES = (19.0, 29.0, 44.0, 69.0)
def run(policy, n=20000, seed=78011):
rng = random.Random(seed)
a = [1.0] * 4
b = [1.0] * 4
rev = 0.0
for t in range(n):
if policy == "split":
k = t % 4
else:
k = max(range(4), key=lambda i: PRICES[i] * rng.betavariate(
a[i], b[i]))
if rng.random() < take(PRICES[k]):
rev += PRICES[k]
a[k] += 1
else:
b[k] += 1
return rev
if __name__ == "__main__":
for p in PRICES:
print(" bump RM {:4.0f}: take {:.3f}, per order {:.2f}".format(
p, take(p), p * take(p)))
best = max(p * take(p) for p in PRICES) * 20000
for pol in ("split", "thompson"):
r = run(pol)
print(" {:8s} revenue RM {:,.0f}; regret RM {:,.0f}".format(
pol, r, best - r))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《结账顺手加购弹性、一键升单动力学与跨领域推荐矩阵》第 6 章「加购定价的在线学习与辛普森悖论」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090207
DOI: 10.5281/zenodo.24090207 · 阅读本章所在专著 · 5DL-B-078 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026078,
author = {Fan, Yafu},
title = {Order-Bump Friction Elasticity, One-Click Upsell Kinetics and Cross-Domain Recommendation Matrices},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090207},
url = {https://doi.org/10.5281/zenodo.24090207}
}