关于「配额怎么分:先到先得、排队、抽签与三种拍卖」,《限量稀缺与早鸟阶梯定价》给出的定量结论是什么?

结论:分法不改变货的数量,改变的是三件事:品牌收多少、货落到谁手里、社群记住什么。在本章的需求池里,统一价拍卖比定价 RM 289 多收 RM 15,161;按出价付费拍卖在均衡下收得几乎一样多,却更难解释;维克里拍卖只在一人多套时才与统一价不同。先到先得把配额交给脚本,排队把差额烧成时间,抽签把差额留给中签者与转售市场。实名把抽签里的转卖量从 108.1 压到 32.4,会员两张签把核心收藏者的中签率推到 0.865。低价实名抽签要胜过拍卖,每一位被它服务的边际收藏者需要在将来带回 RM 129.57 的毛利,约合三分之二套牌卡的毛利;这是一个关于复购的赌注,本章把它写成假说,交给第八章的发售去检验。

数据口径:「限量」「早鸟」宣称的消费者保护规范只写一般框架,不是法律意见。 书中以标注框区分已发表的证据、可运行的计算、原典与作者的假说,每条假说都写明什么结果会推翻它;原典考辨取《韩非子·外储说左上》的「买椟还珠」,讨论包装溢价与内容价值的分离。

English version

对照数据表

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

lottery at RM 289; brand revenue RM 144,500; 578 willing collectors; means over 400 draws
designcollcore resaleres p res margsurplus P coreP memP non
open, 160 accounts391.9204.8108.1346.086,15950,8960.6780.6780.679
one entry per verified ID467.6244.332.4412.623,98651,1560.8090.8080.810
ID + members x2 tickets472.1261.427.9414.803,49351,6900.8650.9080.696
ID + members x4 tickets475.4273.524.6416.583,12152,1010.9060.9780.617
closed form: open 500 x 160 / 738 = 108.4 resale units; per ID 500 x 40 / 618 = 32.4
查看完整验算程序
# Chapter 4. p43: Lotteries at RM 289: open accounts, one entry per verified ID, member-weighted tickets.
# Pool as in p40 (assumed). Entrants are collectors willing at 289 plus resale entries (160 accounts, or
# 40 people under ID checks). Weighted draws without replacement use keys u ** (1 / weight) (Efraimidis
# and Spirakis 2006); 400 draws, random.Random(43). Unserved collectors then meet resale as in p41.
import math
import random

COLL, PEOPLE, ACCTS, UNITS, PRICE = 1440, 40, 4, 500, 289


def build_pool(seed=136):
    rng = random.Random(seed)
    fans = []
    for _ in range(COLL):
        za, zb = rng.gauss(0, 1), rng.gauss(0, 1)
        core = za >= 0.5244
        fans.append({"v": 260 * math.exp(0.40 * (0.6 * za + 0.8 * zb)), "za": za, "core": core,
                     "member": rng.random() < (0.8 if core else 0.3)})
    resellers = [0.9 * rng.uniform(330, 380) for _ in range(PEOPLE)]
    return fans, resellers


def resale(unserved, s):
    vals = sorted((v for v in unserved if v >= PRICE), reverse=True)
    s = min(s, len(vals))
    if s == 0:
        return 0.0, 0.0, 0
    p = vals[s] if s < len(vals) else PRICE
    return p, math.fsum(v - p for v in vals[:s]), s


def draw(fans, entries, weight, rng):
    willing = [f for f in fans if f["v"] >= PRICE]
    keyed = [(rng.random() ** (1 / (weight if f["member"] else 1)), f) for f in willing]
    keyed += [(rng.random(), None) for _ in range(entries)]
    keyed.sort(key=lambda x: -x[0])
    got = [x[1] for x in keyed[:UNITS] if x[1]]
    ids = {id(f) for f in got}
    p_r, s_surp, sold = resale([f["v"] for f in willing if id(f) not in ids], UNITS - len(got))
    mem = [f for f in willing if f["member"]]
    non = [f for f in willing if not f["member"]]
    return {"coll": len(got), "core": sum(f["core"] for f in got), "resale": UNITS - len(got), "p_r": p_r,
            "margin": sold * (p_r - PRICE), "surplus": math.fsum(f["v"] - PRICE for f in got) + s_surp,
            "p_core": sum(f["core"] for f in got) / sum(f["core"] for f in willing),
            "p_mem": sum(1 for f in got if f["member"]) / len(mem),
            "p_non": sum(1 for f in got if not f["member"]) / len(non)}


if __name__ == "__main__":
    fans, res = build_pool()
    rng = random.Random(43)
    willing = [f for f in fans if f["v"] >= PRICE]
    print("lottery at RM {}; brand revenue RM {:,}; {} willing collectors; means over 400 draws".format(
        PRICE, UNITS * PRICE, len(willing)))
    print("{:<26} {:>6} {:>6} {:>6} {:>7} {:>8} {:>8} {:>6} {:>6} {:>6}".format(
        "design", "coll", "core", "resale", "res p", "res marg", "surplus", "P core", "P mem", "P non"))
    designs = (("open, 160 accounts", PEOPLE * ACCTS, 1), ("one entry per verified ID", PEOPLE, 1),
               ("ID + members x2 tickets", PEOPLE, 2), ("ID + members x4 tickets", PEOPLE, 4))
    for name, entries, w in designs:
        reps = [draw(fans, entries, w, rng) for _ in range(400)]
        m = {k: math.fsum(r[k] for r in reps) / len(reps) for k in reps[0]}
        fmt = "{:<26} {:>6.1f} {:>6.1f} {:>6.1f} {:>7.2f} {:>8,.0f} {:>8,.0f} {:>6.3f} {:>6.3f} {:>6.3f}"
        print(fmt.format(
            name, m["coll"], m["core"], m["resale"], m["p_r"], m["margin"], m["surplus"], m["p_core"],
            m["p_mem"], m["p_non"]))
    n = len(willing)
    print("closed form: open {} x 160 / {} = {:.1f} resale units; per ID {} x 40 / {} = {:.1f}".format(
        UNITS, n + 160, UNITS * 160 / (n + 160), UNITS, n + 40, UNITS * 40 / (n + 40)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《高奢稀缺配额拍卖、早鸟阶梯涨价动力学与限量实体品溢价母典》第 4 章「配额怎么分:先到先得、排队、抽签与三种拍卖」(版本 0.1.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026136,
  author    = {Fan, Yafu},
  title     = {Luxury Scarcity Allocation Auctions, Early-Bird Price-Ladder Dynamics and Limited-Edition Physical Premiums},
  year      = {2026},
  publisher = {5D Library},
  edition   = {0.1.0},
  note      = {DOI pending}
}

本书其他章节结论