关于「时间:准双曲贴现、拖延与表单的摩擦」,《选择架构与价格界面》给出的定量结论是什么?

结论:准双曲贴现函数源于费尔普斯与波拉克的代际模型,莱布森把它用于个人的不同时点;它与双曲函数都会产生偏好反转,指数函数不会。现时偏差在努力任务中比在金钱选择中明显。作者的分步表单模型中,今天做胜过明天做的门槛为 2 步;步数为 3 至 14 时,天真者拖到最后一天、完成率 0.488,老练者在 4 至 7 步时于第 2 天完成、完成率 0.902,步数再多时行动日不单调;成本超过 \(\beta V\) 时两者都放弃。默认选项对指数贴现者无影响,对天真者改变约一半人的结局,对老练者约一成。框架中的「拖延—违约临界值」在这个模型中是两个门槛,而且是作者的模型,不是已发表的结果。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.488, 0.902, 14

V10.0, e = 0.5 per step, beta = 0.7, q = 0.05 per day, window T = 14 days
acting today beats acting tomorrow iff C <= beta q V / (1 - beta (1 - q))1.045
steps cost exponential naive sophisticated
(first day on which the form is done, P(done))
10.5 day 0 1.000 day 0 1.000 day 0 1.000
21.0 day 0 1.000 day 0 1.000 day 0 1.000
31.5 day 0 1.000 day 14 0.488 day 0 1.000
42.0 day 0 1.000 day 14 0.488 day 2 0.902
63.0 day 0 1.000 day 14 0.488 day 2 0.902
105.0 day 0 1.000 day 14 0.488 day 3 0.857
136.5 day 0 1.000 day 14 0.488 day 14 0.488
147.0 day 0 1.000 day 14 0.488 day 14 0.488
2110.5 never 0.000 never 0.000 never 0.000
sophisticated, first day by steps 1..150 0 0 2 2 2 2 0 5 3 14 14 14 14 -
enrolment after the window, m6 steps, 30 % of people would rather not join:
exponential : opt-in form 0.700; opt-out form 0.700 (target 0.700)
naive : opt-in form 0.341; opt-out form 0.854 (target 0.700)
sophisticated: opt-in form 0.632; opt-out form 0.729 (target 0.700)

核心公式

\[C \le \frac{\beta q V}{1 - \beta(1-q)}.\]
查看完整验算程序
# THE AUTHOR'S MODEL of a multi-step form, in the setting of O'Donoghue & Rabin (1999).
# Completing it costs C = m * e on the day it is done (m steps, effort e each); the
# benefit V comes later, so on that day it carries the factor beta (delta = 1 within the
# window). The offer closes after day T; each day a person who has not acted drops out
# (forgets, loses the tab) with probability q. Self t acts iff acting beats her forecast:
#   act now: -C + beta V;  if the next self to act does so k days later:
#   wait:    beta (1 - q)^k (V - C).
# Exponential (beta = 1) forecasts correctly; a naive person forecasts that tomorrow's
# self will act (k = 1) whenever C <= V; a sophisticated person solves backwards.
V, E, BETA, Q, T = 10.0, 0.5, 0.7, 0.05, 14

def plan(C, beta, kind):
    """Return the first day on which the form is done (None = never)."""
    act = [False] * (T + 1)
    act[T] = -C + beta * V >= 0
    for t in range(T - 1, -1, -1):
        if kind == "naive":                       # believes she will do it tomorrow
            k = 1 if C <= V else None
        else:                                     # knows the next self who acts
            k = next((j - t for j in range(t + 1, T + 1) if act[j]), None)
        wait = beta * (1 - Q) ** k * (V - C) if k else 0.0
        act[t] = -C + beta * V >= max(wait, 0.0) and -C + beta * V >= 0
    return next((t for t in range(T + 1) if act[t]), None)

def done(m, kind):
    day = plan(m * E, 1.0 if kind == "exponential" else BETA, kind)
    return day, (0.0 if day is None else (1 - Q) ** day)

c_s = BETA * Q * V / (1 - BETA * (1 - Q))
print(f"V = {V}, e = {E} per step, beta = {BETA}, q = {Q} per day, window T = {T} days")
print("acting today beats acting tomorrow iff C <= beta q V / (1 - beta (1 - q))"
      f" = {c_s:.3f}")
print("   steps   cost    exponential    naive          sophisticated")
print("                   (first day on which the form is done, P(done))")
for m in (1, 2, 3, 4, 6, 10, 13, 14, 21):
    cells = []
    for kind in ("exponential", "naive", "sophisticated"):
        day, p = done(m, kind)
        cells.append(f"{'never' if day is None else 'day ' + str(day):>6s} {p:5.3f}")
    print(f"   {m:5d}  {m * E:5.1f}    " + "    ".join(cells))
print("sophisticated, first day by steps 1..15: "
      + " ".join("-" if d is None else str(d) for d in
                 (done(m, "sophisticated")[0] for m in range(1, 16))))
print("enrolment after the window, m = 6 steps, 30 % of people would rather not join:")
for kind in ("exponential", "naive", "sophisticated"):
    p = done(6, kind)[1]
    print(f"   {kind:13s}: opt-in form {0.7 * p:.3f};"
          f"  opt-out form {0.7 + 0.3 * (1 - p):.3f}"
          f" (target 0.700)")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《选择架构、累积前景理论与销售界面价格锚定的计算行为学》第 6 章「时间:准双曲贴现、拖延与表单的摩擦」(版本 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}
}

本书其他章节结论