关于「承诺棘轮:价格跳升比与升单时机」,《回溯信念与升单自动机》给出的定量结论是什么?

结论:第三章求含抗拒阈值与沉没成本的最优升单跳升比(首单 1.99,计入退款 1.86)与时机(第 7 天的报价收入是次日的数倍)。

数据口径:第一章证明「信任雪崩」是感受上的相变而不是证据上的:泛泛的回溯断言真实似然比只有 1.19,怀疑者需要 27 次命中才半信,但若把基率 0.80 误判为 0.20,3 次就够;在 20,000 位模拟用户中,一位没有任何洞察力的测算师在 6 条泛泛断言之内使 0.5263 的用户确信,而按真实似然比更新的用户几乎无人确信。 第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。

English version

对照数据表

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

   sunk S/p  threshold  no refunds: r*  A(r*)   with refunds: r*  A(r*)  phi
         0      2.500             1.99  0.701              1.86  0.744 0.127
         1      3.055             2.40  0.749              2.26  0.790 0.113
         3      3.609             2.82  0.788              2.68  0.825 0.103
        10      4.418             3.48  0.827              3.33  0.860 0.092
Reading: sunk cost raises the jump a buyer tolerates, so the
best ratio grows along the ladder. The optimum always lies
well below the resistance threshold, and counting refunds
lowers it further: pushing to the threshold does not pay.

核心公式

\[A(r) = \frac{1}{1 + e^{(r - r_0)/0.6}} ,\qquad r_0 = 2.5 + 0.8 \ln\!\left(1 + \frac{S}{p}\right),\]
查看完整验算程序
# Chapter 3. [p05] The optimal price jump for one upsell, with and
# without the cost of regret. A buyer of tier i (price p) is offered
# tier i+1 at r * p. She accepts with logistic probability
#   A(r) = 1 / (1 + exp((r - r0) / 0.6)),
# where her resistance threshold r0 = 2.5 + 0.8 * ln(1 + S / p) rises
# with what she has already spent, S (sunk cost; S = 0 for a first
# purchase). A share of buyers who accept ask for a refund, more so
# the harder they were pushed: phi(r) = 0.05 + 0.30 / (1 + exp(-(r -
# r0) / 0.6)). Net revenue per offer, in units of p: r A(r) (1 - phi).
import math

def r0(sunk):
    return 2.5 + 0.8 * math.log(1 + sunk)

def accept(r, t):
    return 1 / (1 + math.exp((r - t) / 0.6))

def refund(r, t):
    return 0.05 + 0.30 / (1 + math.exp(-(r - t) / 0.6))

def best(sunk, with_refunds):
    t = r0(sunk)
    grid = [1 + k / 100 for k in range(0, 1201)]
    def net(r):
        return r * accept(r, t) * ((1 - refund(r, t)) if with_refunds
                                   else 1.0)
    r = max(grid, key=net)
    return t, r, accept(r, t), refund(r, t), net(r)

if __name__ == "__main__":
    print("   sunk S/p  threshold  no refunds: r*  A(r*)   with refunds:"
          " r*  A(r*)  phi")
    for sunk in (0, 1, 3, 10):
        t, r1, a1, f1, n1 = best(sunk, False)
        t, r2, a2, f2, n2 = best(sunk, True)
        print("   {:7d} {:10.3f} {:16.2f} {:6.3f} {:17.2f} {:6.3f} {:5.3f}"
              .format(sunk, t, r1, a1, r2, a2, f2))
    print("\nReading: sunk cost raises the jump a buyer tolerates, so the")
    print("best ratio grows along the ladder. The optimum always lies")
    print("well below the resistance threshold, and counting refunds")
    print("lowers it further: pushing to the threshold does not pay.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机》第 3 章「承诺棘轮:价格跳升比与升单时机」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186

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

BibTeX
@book{fan2026069,
  author    = {Fan, Yafu},
  title     = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090186},
  url       = {https://doi.org/10.5281/zenodo.24090186}
}

本书其他章节结论