关于「选项的多少:选择过载与助推效应的规模」,《选择架构与价格界面》给出的定量结论是什么?

结论:果酱研究中「3% 对 30%」是停留者中的购买比例,按路过者计算是 1.7% 对 11.9%;24 种一组吸引了更多人停留。梅塔分析显示选择过载的平均效应接近零、异质性很大,并找到复杂性、任务难度、偏好不确定性与省力目标四个调节变量。作者的模型显示选项数量的效应方向由比较成本与偏好不确定性决定,12 种设定中 8 种对多选项有利、4 种不利。助推机构的大规模试验平均效应为 1.4 个百分点,学术期刊为 8.7;只发表显著结果时,一个 1.4 个百分点的真实效应在每组约 240 人的研究中平均显示为 8.7。所以「选项越多越好」与「选择过载普遍存在」都不成立,而任何单次实验报告的大效应都需要先问它经过了怎样的筛选。

数据口径:选项多一些会卖得更好还是更差?划掉一个原价能把顾客愿意支付的价格抬多高?三档定价中间那一档旁边放一个「不划算」的选项,会不会让中间档卖得更多?本书是教学与研究用的数学模型,不是营销、法律或合规建议。 书中三档价格示例 9.99、49.90、149.00 美元与 5D Library 自己的定价相同,已在利益披露中说明,书中分析不构成对该定价的验证。

English version

对照数据表

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

Iyengar & Lepper 2000, Study 1 (published counts)
24 jams: stopped 145/24260%; bought 4/145 = 2.8% of stoppers, 1.7% of passers-by
6 jams: stopped 104/26040%; bought 31/104 = 29.8% of stoppers, 11.9% of passers-by
Fisher exact p, buyers among stoppers1.8e-09; among passers-by: 4.4e-06
ratio of purchase rates per passer-by7.2
author's model: P(buy) for 6 and 24 options, best n in 1..60
cost c noise s n6 n=24 24 minus 6 best n P(best)
0.0000.0 0.645 0.984 +0.339 60 1.000
0.0001.0 0.388 0.860 +0.472 60 0.993
0.0002.0 0.074 0.264 +0.190 60 0.535
0.0050.0 0.630 0.967 +0.337 60 0.998
0.0051.0 0.368 0.758 +0.390 60 0.871
0.0052.0 0.064 0.141 +0.077 31 0.146
0.0200.0 0.583 0.834 +0.251 25 0.835
0.0201.0 0.310 0.376 +0.067 16 0.415
0.0202.0 0.041 0.013 -0.028 8 0.042
0.0500.0 0.488 0.317 -0.171 10 0.534
0.0501.0 0.210 0.028 -0.182 6 0.210
0.0502.0 0.015 0.000 -0.015 3 0.021
12 settings24 beats 6 in 8, 6 beats 24 in 4; mean difference +0.144, sd 0.219

核心公式

\[P(\text{购买}) = 1 - \Phi\!\left(\frac{u_0 + c(n-1)}{r}\right)^{n}.\]
查看完整验算程序
# Part A: the published counts of Iyengar & Lepper (2000), Study 1 (jam tasting booth),
# re-analysed per stopper and per passer-by, with Fisher's exact test.
# Part B: THE AUTHOR'S MODEL (illustrative, not evidence). A shopper sees n options whose
# match values u_i are iid N(0, 1). With preference uncertainty she observes u_i + e_i,
# e_i ~ N(0, s^2), so the best posterior mean is r * M_n with r = 1 / sqrt(1 + s^2) and
# M_n the maximum of n standard normals. Reviewing the set costs c per extra option. She
# buys if r * M_n - c * (n - 1) > u0, otherwise she defers. P(buy) is exact:
# P(M_n > t) = 1 - Phi(t) ** n with t = (u0 + c (n - 1)) / r.
import math, statistics

ND = statistics.NormalDist()

def fisher_two_sided(a, n1, b, n2):
    k, n = a + b, n1 + n2
    p = lambda x: math.comb(n1, x) * math.comb(n2, k - x) / math.comb(n, k)
    p0 = p(a)
    xs = range(max(0, k - n2), min(k, n1) + 1)
    return sum(p(x) for x in xs if p(x) <= p0 * 1.0000001)

def p_buy(n, c, s, u0=1.0):
    r = 1 / math.sqrt(1 + s * s)
    return 1 - ND.cdf((u0 + c * (n - 1)) / r) ** n

print("Iyengar & Lepper 2000, Study 1 (published counts)")
for lab, passed, stop, buy in (("24 jams", 242, 145, 4), ("6 jams", 260, 104, 31)):
    print(f"   {lab}: stopped {stop}/{passed} = {stop / passed:.0%}; bought {buy}/{stop}"
          f" = {buy / stop:.1%} of stoppers, {buy / passed:.1%} of passers-by")
print("   Fisher exact p, buyers among stoppers:",
      f"{fisher_two_sided(4, 145, 31, 104):.1e};"
      f" among passers-by: {fisher_two_sided(4, 242, 31, 260):.1e}")
print(f"   ratio of purchase rates per passer-by: {(31 / 260) / (4 / 242):.1f}")
print()
print("author's model: P(buy) for 6 and 24 options, best n in 1..60")
print("   cost c  noise s    n=6    n=24   24 minus 6   best n  P(best)")
effects = []
for c in (0.0, 0.005, 0.02, 0.05):
    for s in (0.0, 1.0, 2.0):
        p6, p24 = p_buy(6, c, s), p_buy(24, c, s)
        best = max(range(1, 61), key=lambda n: p_buy(n, c, s))
        effects.append(p24 - p6)
        print(f"   {c:6.3f}  {s:7.1f}  {p6:6.3f}  {p24:6.3f}  {p24 - p6:+10.3f}"
              f"  {best:7d}  {p_buy(best, c, s):6.3f}")
pos = sum(e > 0 for e in effects)
print(f"12 settings: 24 beats 6 in {pos}, 6 beats 24 in {12 - pos};"
      f" mean difference {statistics.fmean(effects):+.3f},"
      f" sd {statistics.stdev(effects):.3f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《选择架构、累积前景理论与销售界面价格锚定的计算行为学》第 1 章「选项的多少:选择过载与助推效应的规模」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23836260

DOI: 10.5281/zenodo.23836260 · 阅读本章所在专著 · 5DL-B-047 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026047,
  author    = {Fan, Yafu},
  title     = {Choice Architecture, Cumulative Prospect Theory and Computational Behavioural Economics of Pricing Interfaces},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23836260},
  url       = {https://doi.org/10.5281/zenodo.23836260}
}

本书其他章节结论