5D Library › Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders · 中文

Chapter 8. A Menu Audit and a Pre-Registered Experiment

Four questions for any price menu

This chapter turns the book into four questions that can be put to the price menu of any digital reading service, the author’s own included. They are not business advice.

One: is there an all-access pass cheaper than what a high-value segment pays for its single module? If so, it pulls that segment down as a whole (Chapter 2).

Two: do the extra slots exceed the arbitrage threshold? The threshold is k+1>P/((1−γ)p2)k + 1 > P/((1-\gamma)p_2); with self-referral, PP is halved (Chapters 3 and 4).

Three: how much does the firm still net from each resold slot? Below the delivery cost, the channel has blown through (Chapter 4).

Four: is any step in the ladder so large that a segment has nothing to buy? The optimal menu of Chapter 5 jumps by a factor of 22.11 between 567 and 12537. That is the result of screening, but it needs a human review: is there an overlooked segment in between (part-time individual practitioners, for instance)?

The audit as a program

The program writes the four questions as four automatic flags and applies them to two menus: a common “cheap all-in” menu (single reading 99, an annual card of 199 with 6 extra slots and self-referral paid, an all-access pass of 399, a licence of 2999) and the locked ladder of Chapter 5.

Calculation

# Chapter 8. [p15] A four-flag audit of a price menu.
# Flags: (1) CANNIBAL - an all-access pass priced below the top single
# price a high-value segment pays (p03); (2) RESALE - unlocked slots per
# card above the threshold k + 1 > P / ((1 - g) p2), with the card cost
# halved if self-referral is paid (p05, p07); (3) BLOW - firm net per
# resold slot below the delivery cost c = 15 (p07); (4) GAP - a step
# ratio above 20 with no tier between, so one segment has no product
# (p09 has one such step, 22.11, by design: flagged for review only).
G, C = 0.5, 15.0

MENUS = {
    "cheap all-in": dict(p2=99, card=199, k=6, self_ref=True,
                         pass_=399, b_single=2999,
                         ladder=(9, 99, 199, 399, 2999, 9999)),
    "locked ladder": dict(p2=117, card=287, k=0, self_ref=False,
                          pass_=None, b_single=12537,
                          ladder=(12, 117, 287, 567, 12537, 34537)),
}

def audit(m):
    flags = []
    if m["pass_"] is not None and m["pass_"] < m["b_single"]:
        flags.append("CANNIBAL pass {} < B2B price {}".format(
            m["pass_"], m["b_single"]))
    cost = m["card"] * ((1 - G) if m["self_ref"] else 1.0)
    thr = cost / ((1 - G) * m["p2"])
    if m["k"] + 1 > thr:
        flags.append("RESALE k+1 = {} > {:.2f}".format(m["k"] + 1, thr))
    net = cost / (m["k"] + 1) - C
    if m["k"] > 0 and net < 0:
        flags.append("BLOW net per slot {:.2f}".format(net))
    lad = m["ladder"]
    for a, b in zip(lad, lad[1:]):
        if b / a > 20:
            flags.append("GAP {} -> {} (x{:.2f})".format(a, b, b / a))
    return flags

if __name__ == "__main__":
    for name, m in MENUS.items():
        fl = audit(m)
        print("   {}: {} flag(s)".format(name, len(fl)))
        for f in fl:
            print("     - " + f)
    print("\nReading: the cheap all-in menu trips the first three flags")
    print("at once; the locked ladder keeps only the reviewed B2B step.")
#    cheap all-in: 3 flag(s)
#      - CANNIBAL pass 399 < B2B price 2999
#      - RESALE k+1 = 7 > 2.01
#      - BLOW net per slot -0.79
#    locked ladder: 1 flag(s)
#      - GAP 567 -> 12537 (x22.11)
#
# Reading: the cheap all-in menu trips the first three flags
# at once; the locked ladder keeps only the reviewed B2B step.

The cheap all-in menu trips the first three flags at once: the pass at 399 is below the B2B single price of 2999; the extra slots give k+1=7k + 1 = 7, far above the self-referral threshold of 2.01; and every resold slot loses 0.79. The locked ladder keeps only the fourth flag, the deliberate B2B step that calls for review.

A pre-registered experiment

Hypothesis · not established

Study protocol. Visitors are randomised by session to the current menu or the locked ladder; channel partners are randomised by partner to one of two channel rules, “extra slots + self-referral commission” or “identity lock + no commission on a partner’s own purchase”. Primary outcome: the share of channel partners whose card shows more than one birth hash within a year (manually checked not to be family use); expected to fall from 0.15 to 0.05. Secondary outcomes: profit per visitor; the share of ordinary users who abandon at the identity check (the refutation condition of Chapter 3). Test: a two-sided two-proportion test at 0.05 with power 0.90 for the primary outcome. Carried out with pre-registered code by an independent analyst who has no financial relationship with the author; results published whether positive or negative.

Calculation

# Chapter 8. [p16] Sample sizes for a pre-registered menu experiment.
# Visitors are randomised between the current menu and the locked
# ladder. (a) Profit per visitor is whale-driven: its standard deviation
# under the p09 model (shares, tiers, margins) is computed exactly, and
# the visitors per arm needed to detect a 20% change (two-sided 0.05,
# power 0.90) follow from the normal approximation. (b) A secondary,
# better-powered outcome: the share of channel partners whose card is
# used for more than one birth-record hash, 0.15 -> 0.05.
import math
from statistics import NormalDist

SHARE = (0.60, 0.22, 0.10, 0.05, 0.025, 0.005)
MARGIN = (11, 114, 279, 555, 11037, 28537)

def n_means(sd, delta, alpha=0.05, power=0.90):
    z = NormalDist().inv_cdf
    return math.ceil(2 * ((z(1 - alpha / 2) + z(power)) * sd / delta) ** 2)

def n_props(p1, p2, alpha=0.05, power=0.90):
    z = NormalDist().inv_cdf
    pb = (p1 + p2) / 2
    a = z(1 - alpha / 2) * math.sqrt(2 * pb * (1 - pb))
    b = z(power) * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))
    return math.ceil((a + b) ** 2 / (p1 - p2) ** 2)

if __name__ == "__main__":
    mean = sum(s * m for s, m in zip(SHARE, MARGIN))
    var = sum(s * m * m for s, m in zip(SHARE, MARGIN)) - mean ** 2
    sd = math.sqrt(var)
    print("   profit per visitor: mean {:.2f}, sd {:.2f}, CV {:.2f}".format(
        mean, sd, sd / mean))
    n = n_means(sd, 0.2 * mean)
    print("   (a) visitors per arm for a 20% change: {:,d}".format(n))
    print("   (b) partners per arm for 0.15 -> 0.05: {:,d}".format(
        n_props(0.15, 0.05)))
    print("\nReading: profit per visitor is dominated by a few B2B")
    print("buyers, so a fair test of it needs tens of thousands of")
    print("visitors per arm; the channel outcome needs a few hundred")
    print("partners. Register both, with profit as a secondary outcome.")
#    profit per visitor: mean 505.94, sd 2624.37, CV 5.19
#    (a) visitors per arm for a 20% change: 14,136
#    (b) partners per arm for 0.15 -> 0.05: 188
#
# Reading: profit per visitor is dominated by a few B2B
# buyers, so a fair test of it needs tens of thousands of
# visitors per arm; the channel outcome needs a few hundred
# partners. Register both, with profit as a secondary outcome.

Profit per visitor is set by a few B2B buyers: its standard deviation is 5.19 times its mean, and detecting a 20% change with power 0.90 needs 14,136 visitors per arm. The channel outcome needs only 188 partners per arm. That is why the protocol makes the channel outcome primary and profit secondary: an experiment with profit as its primary outcome and too small a sample is all but certain to report “no difference”.

Summary

The four questions – is a pass cheaper than a high-value single price, do extra slots cross the arbitrage threshold, do resold slots blow the channel through, does the ladder leave a gap – can be written as an automatic audit. An experiment on the identity lock should take the channel outcome as primary, which needs 188 partners per arm; one with profit per visitor as primary needs 14,136 visitors per arm.

Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders: Orthogonal Demand Partitioning, Resale Cannibalization Bounds, Affiliate Margin Preservation and Five-Figure B2B Upsell Equilibria [分拆经济学、防套利身份锁定与多阶授权阶梯] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090184 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).