What does Unbundling, Anti-Arbitrage and Licensing Ladders conclude, in numbers, about “A Menu Audit and a Pre-Registered Experiment”?
Answer: Chapter 8 gives a four-flag menu audit and a pre-registered experiment (188 channel partners per arm). Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 188
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.
Show the full program
# 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.")Single source and citation
Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders (Version 1.0.0), Chapter 8: A Menu Audit and a Pre-Registered Experiment. 5D Library. https://doi.org/10.5281/zenodo.24090184
DOI: 10.5281/zenodo.24090184 · Read the monograph · 5DL-B-068 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026068,
author = {Fan, Yafu},
title = {Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090184},
url = {https://doi.org/10.5281/zenodo.24090184}
}Other chapter answers in this book
- Chapter 1 · When Bundling Pays: from Two Modules to Four
- Chapter 2 · How a Cheap All-Access Pass Cannibalizes, and Heavy Tails
- Chapter 3 · Resale Arbitrage and an Identity Hash Lock
- Chapter 4 · Self-Referral, Channel Blow-Through and Imitating Partners
- Chapter 5 · The Six-Tier Menu: an Exactly Solved Screening Problem
- Chapter 6 · How Robust Is the Menu: Misspecified Demand, Add-on Prices and Whale Risk
- Chapter 7 · The Han Tax on Hoarded Cash, the *Guanzi* and Song Salt Vouchers