关于「频次保护:疲劳曲线与 72 小时推送上限」,《异业联营拆账与频次保护》给出的定量结论是什么?

结论:第五章建立疲劳模型,求 72 小时推送上限,写出退订即停、名单不外流与冷却期。

数据口径:纳什议价解先还双方的破裂点,再平分合作红利,五五分只是破裂点对称时的特例;示意参数下,渠道方单干 2,000、操盘方单干 6,000 时,渠道方份额是 0.433。 频次方面,示意名单推 8 次比推 3 次成交多不到一倍,流失成员却是 7.453 倍;一次性操盘方的最优推送会让十二个月联合价值损失 0.1468。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

mordersextraunsubsilentactiveunsub per order
190.090.020.040.09,9400.222
2161.671.651.8119.59,8290.321
3218.256.6102.1237.59,6600.468
4262.744.5181.3392.09,4270.690
5297.434.8304.8580.69,1151.025
6324.326.9496.0799.38,7051.529
7344.920.5788.1 1,043.08,1692.285
8360.315.4 1,226.6 1,304.57,4693.405
8 pushes versus 3: orders times 1.651, lost members times 7.453
查看完整验算程序
# Chapter 5. p51: what each extra push in 72 hours does to a list.
# List of N = 10,000 members, all active at the start. The j-th push in
# a 72-hour window (j pushes inside the last 7 days):
#   unsubscribe share u_j = U0 * (1 + G) ** (j - 1)
#   silence share     s_j = S0 * j          (stop opening for months)
#   open share        o_j = O1 * OD ** (j - 1)
#   orders            active * o_j * CONV
# so each extra push multiplies the unsubscribe share by 1 + G = 1.6
# and the open share by OD = 0.8.
# U0, G, S0, O1, OD and CONV are illustrative parameters to be replaced
# by the channel's own back-filled data (chapter 8).
import math

N = 10000.0
U0, G = 0.002, 0.6
S0 = 0.004
O1, OD = 0.30, 0.80
CONV = 0.03


def run(m):
    active = N
    orders, unsub, silent = [], [], []
    for j in range(1, m + 1):
        orders.append(active * O1 * OD ** (j - 1) * CONV)
        u = U0 * (1.0 + G) ** (j - 1)
        s = S0 * j
        unsub.append(active * u)
        silent.append(active * s)
        active = active * (1.0 - u - s)
    return math.fsum(orders), math.fsum(unsub), math.fsum(silent), active


if __name__ == "__main__":
    print(" m   orders  extra   unsub  silent   active  unsub per order")
    prev = 0.0
    for m in range(1, 9):
        o, u, s, a = run(m)
        print("{:>2} {:>8.1f} {:>6.1f} {:>7,.1f} {:>7,.1f} {:>8,.0f}"
              "   {:>8.3f}".format(m, o, o - prev, u, s, a, u / o))
        prev = o
    o3, u3, s3, a3 = run(3)
    o8, u8, s8, a8 = run(8)
    print("8 pushes versus 3: orders times {:.3f}, lost members times {:.3f}"
          .format(o8 / o3, (u8 + s8) / (u3 + s3)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《异业私域联营拆账、技术换流量零本金借船与联合发售脉冲母典》第 5 章「频次保护:疲劳曲线与 72 小时推送上限」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-371 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026371,
  author    = {Fan, Yafu},
  title     = {Joint-Venture Audience Monetisation, Tech-for-Traffic Barter Structures and Co-Launch Revenue Waterfalls},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论