关于「不花钱的荣誉:荣誉阶梯、公开名牌与荣誉的饱和」,《使命社群的付费席位与志愿飞轮》给出的定量结论是什么?

结论:第三至六章说明,四档名牌让捐款合计升到 1.163 倍,荣誉计划发给 5 % 时最终持有 0.209、贡献时数增幅最大;公开场合的小额报酬让参与率从 0.615 跌到 0.433,奖励带来的增加里有 0.230 是从邻近项目挪来的;温和邀请从第 35 个月起持有人更多、第 47 个月起累计收入更高,合并积分账让付费者占满荣誉榜的 0.960;按出钱分票几乎让付费者通过所有多数反对的提案,付费者权重封顶十分之一时俘获率降到 0.070,退款准备金按第 99 百分位留出基金的 0.182,单层推荐奖励占保留销售额的 0.084。

数据口径:书中的成员数、价格、续费率、退款率与时数均为示意参数,全部计算由书中程序生成,收入数字只是示意算术,不是收益预测或保证;本书是非个人化经营建议,不构成法律、税务或投资建议。 第一、二章说明,单凭权益愿为 RM 1,000 席位付钱的示意成员只有 13 位,加上公开署名与透明用途升到 1,786 位,买家愿付价格平均 0.807 来自署名与使命;限量是对持有人的承诺,不是增收工具。

English version

对照数据表

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

designtotal RMmoved upmean stretchmax stretch
no plaque394,0270.0001.0001.000
flat plaque406,5070.2361.4121.976
four tiers458,4270.4001.4091.976
four tiers raise the total by a factor of 1.163
查看完整验算程序
# Chapter 3. p31: patron tiers on a public plaque make gifts bunch at tier floors.
# Harbaugh (1998) modelled giving as warm glow plus prestige, where the
# prestige comes from the category in which a gift is publicly reported.
# 2,000 patrons (illustrative); patron i would give x_i with no plaque,
# x_i lognormal with median RM 120. Utility of a gift g:
#   U(g) = x_i * ln(g) - g + LAM * floor(g),
# floor(g) = the highest tier floor not above g (0 below the first tier),
# LAM = 0.15 (illustrative prestige weight). Without tiers the best gift
# is x_i. With tiers the best gift is x_i or exactly one of the floors.
# Designs: no plaque; one flat plaque that lists every patron from RM 100;
# four tiers with floors RM 100, 500, 1,000 and 5,000.
import math
import random

RNG = random.Random(20261120)
N, LAM = 2000, 0.15
xs = [120 * RNG.lognormvariate(0, 1.0) for _ in range(N)]
DESIGNS = (("no plaque", ()), ("flat plaque", (100,)),
           ("four tiers", (100, 500, 1000, 5000)))


def floor_of(g, floors):
    below = [f for f in floors if f <= g]
    return max(below) if below else 0


def best_gift(x, floors):
    cands = [x] + [f for f in floors if f > x]

    def u(g):
        return x * math.log(g) - g + LAM * floor_of(g, floors)
    return max(cands, key=lambda g: (u(g), -g))


print("design        total RM   moved up     mean stretch   max stretch")
for name, floors in DESIGNS:
    gifts = [best_gift(x, floors) for x in xs]
    moved = [(g, x) for g, x in zip(gifts, xs) if g > x]
    stretch = [g / x for g, x in moved]
    print("%-12s %10s %10.3f %12.3f %13.3f" % (
        name, "{:,}".format(int(math.fsum(gifts))), len(moved) / N,
        math.fsum(stretch) / len(stretch) if stretch else 1.0,
        max(stretch) if stretch else 1.0))
base = math.fsum(xs)
tiers = math.fsum(best_gift(x, DESIGNS[2][1]) for x in xs)
print("four tiers raise the total by a factor of %.3f" % (tiers / base))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《使命感召型共创网络、付费席位身份沉没与志愿贡献飞轮母典》第 3 章「不花钱的荣誉:荣誉阶梯、公开名牌与荣誉的饱和」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026360,
  author    = {Fan, Yafu},
  title     = {Mission-Driven Co-Creation Networks, Paid-Seat Identity Commitment and Voluntary Contribution Flywheels},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论