关于「上下文赌博机:市场、渠道、新老客与分群定价的边界」,《冷启动测价与贝叶斯调价》给出的定量结论是什么?
结论:把市场、渠道与新老客写成上下文,能让定价更贴近不同人群的价格敏感度,但首发规模下收益有限:在北岸工作室的虚构样本里,分群上限是单一价格的 1.095 倍、六千名访客多 5,928 元;最好的上下文规则只比从第一天就知道单一最优价多赚 879 元。LinUCB 的理论 α 宽得离谱,要按奖励噪声缩放;逻辑回归 Thompson 更贴近店铺的批量现实。最要紧的发现是,算法会自己学会向回头客收更高的价,而这样做在本例里几乎不赚钱:新老客同价只损失 0.005 的收入。所以边界写在算法之外:同客同时同价,由散列分配保证;展示价一致,渠道价附带公开条件,价差有上限;新老客只许公开优惠,不许杀熟;限时活动的原价必须是真正用过的价格。下一章转向随时间的调价。
数据口径:价格展示与分群定价的法规只写一般框架,不是法律或税务意见。 书中以标注框区分已发表的证据、可运行的计算、原典与作者的假说,每条假说都写明什么结果会推翻它;原典考辨取《管子·国蓄》的轻重敛散与「准平」。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.005, 5928
| menu | yuan/visitor | share of V0 | lost vs V0 | prices |
| V0 eight cell prices | 11.386 | 1.000 | 0.000 | [99, 129, 169, 219] |
| V1 market x channel | 11.327 | 0.995 | 0.005 | [219, 129, 129, 99] |
| V2 V1 + spread cap 1.35 | 10.910 | 0.958 | 0.042 | [169, 129, 129, 129] |
| V3 one price per market | 10.851 | 0.953 | 0.047 | [169, 99] |
| V4 one price for all | 10.398 | 0.913 | 0.087 | [129] |
| V5 list + new-customer coupon | 11.018 | 0.968 | 0.032 | [219, 99, 40, 10] |
| without the 0.20 coupon limit V5 would pick [219, 129, 60, 40] for 11.100 per visitor | ||||
| V5 prices: [list A, list B, coupon A, coupon B]; V1/V2: A/site, A/community, B/site, B/community | ||||
| over 6,000 visitors: V0 - V4 = 5,928 yuan; V1 - V4 = 5,572; V5 - V4 = 3,715 |
查看完整验算程序
# Chapter 5. p53: What each fairness rule costs, in yuan per visitor, on the fictional truth of p50.
# Menus compared (every price must be one of the arms or, for the coupon menu, an arm minus a coupon):
# V0 eight cell prices, new and returning priced apart (no limits)
# V1 one price per market x channel, new and returning see the same price
# V2 as V1, and the dearest shown price at most 1.35 x the cheapest
# V3 one price per market (both channels show the same price inside a market)
# V4 one price for everyone
# V5 one list price per market, plus a disclosed first-order coupon for new customers (steps of 10 yuan,
# at most 0.20 of the list price, so the list price stays the price most buyers could really pay)
# The coupon menu is honest only if returning customers really pay the list price. EU readers: personalised
# prices must be disclosed under Directive 2019/2161; this program is arithmetic, not legal advice.
import itertools
import math
ARMS = [99, 129, 169, 219]
COUPONS = [0, 10, 20, 30, 40, 50, 60]
COUPON_MAX = 0.20
CAP = 1.35
MS, CS, RS = 0.6, 0.7, 0.75
def conv(m, c, r, p):
k = 0.22 + 0.18 * m + 0.20 * c - 0.10 * r
z = -2.4 - 0.2 * m + 0.3 * c + 0.6 * r - k * (p - 99) / 40
return 1 / (1 + math.exp(-z))
def w(m, c, r):
return (MS if m == 0 else 1 - MS) * (CS if c == 0 else 1 - CS) * (RS if r == 0 else 1 - RS)
CELLS = list(itertools.product((0, 1), repeat=3))
def value(price_of):
return math.fsum(w(*x) * price_of(x) * conv(*x, price_of(x)) for x in CELLS)
rows = []
v0 = {x: max(ARMS, key=lambda p: p * conv(*x, p)) for x in CELLS}
rows.append(("V0 eight cell prices", value(lambda x: v0[x]), sorted(set(v0.values()))))
pairs = list(itertools.product((0, 1), repeat=2))
best1, best2 = None, None
for combo in itertools.product(ARMS, repeat=4):
menu = dict(zip(pairs, combo))
v = value(lambda x: menu[(x[0], x[1])])
if best1 is None or v > best1[0]:
best1 = (v, combo)
if max(combo) <= CAP * min(combo) and (best2 is None or v > best2[0]):
best2 = (v, combo)
rows.append(("V1 market x channel", best1[0], list(best1[1])))
rows.append(("V2 V1 + spread cap {:.2f}".format(CAP), best2[0], list(best2[1])))
best3 = max(((value(lambda x: pa if x[0] == 0 else pb), (pa, pb)) for pa in ARMS for pb in ARMS))
rows.append(("V3 one price per market", best3[0], list(best3[1])))
best4 = max((value(lambda x: p), p) for p in ARMS)
rows.append(("V4 one price for all", best4[0], [best4[1]]))
def coupon_menu(la, lb, ca, cb):
def price(x):
lst, cp = (la, ca) if x[0] == 0 else (lb, cb)
return lst - cp if x[2] == 0 else lst
return value(price)
best5, unc = None, None
for la, lb, ca, cb in itertools.product(ARMS, ARMS, COUPONS, COUPONS):
v = coupon_menu(la, lb, ca, cb)
if unc is None or v > unc[0]:
unc = (v, [la, lb, ca, cb])
if ca > COUPON_MAX * la or cb > COUPON_MAX * lb:
continue
if best5 is None or v > best5[0]:
best5 = (v, [la, lb, ca, cb])
rows.append(("V5 list + new-customer coupon", best5[0], best5[1]))
top = rows[0][1]
print("menu yuan/visitor share of V0 lost vs V0 prices")
for name, v, prices in rows:
print("{:32s} {:12.3f} {:11.3f} {:10.3f} {}".format(name, v, v / top, 1 - v / top, prices))
print("without the 0.20 coupon limit V5 would pick {} for {:.3f} per visitor".format(unc[1], unc[0]))
print("V5 prices: [list A, list B, coupon A, coupon B]; V1/V2: A/site, A/community, B/site, B/community")
print("over 6,000 visitors: V0 - V4 = {:,.0f} yuan; V1 - V4 = {:,.0f}; V5 - V4 = {:,.0f}".format(
6000 * (top - best4[0]), 6000 * (best1[0] - best4[0]), 6000 * (best5[0] - best4[0])))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《零历史数据冷启动测价、范氏价格敏感度边界与贝叶斯自适应调价母典》第 5 章「上下文赌博机:市场、渠道、新老客与分群定价的边界」(版本 0.1.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-133 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026133,
author = {Fan, Yafu},
title = {Zero-History Cold-Start Price Testing, Van Westendorp Sensitivity Bounds and Bayesian Adaptive Repricing},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}