What does Cascades, Curiosity and Paywalls conclude, in numbers, about “Bundles, Decoy Tiers and Paying per Question”?
Answer: Chapter 6 shows that bundling independent questions collects 0.678 of their value at 20 questions, that a decoy tier depends on a parameter that must be measured, and that offering per-question pricing alongside an annual pass is best.
Scope of the numbers: It is not business, legal or investment advice; all data are synthetic, generated by its programs. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's 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: 0.678, 20
questions separate (per q) bundle (per q) value per q share
1 1.003 1.003 2.770 0.362
2 1.000 1.187 2.753 0.431
5 1.001 1.463 2.749 0.532
10 0.999 1.670 2.758 0.605
20 0.998 1.861 2.746 0.678
Reading: priced one by one, each question earns the same share
of its value however many there are. As one bundle, the share
captured climbs towards the whole value as n grows. This is an
argument for bundles of independent questions, not for tiers of
one reading.Show the full program
# Chapter 6. Why "ask as many questions as you like" can pay.
# A buyer's value for each answered question is independent across
# questions: log-normal with median 2 and log-sd 0.8. Selling n questions
# separately at the best single price per question, against selling the
# n as one bundle at the best bundle price (Bakos and Brynjolfsson: the
# law of large numbers makes the bundle's value per question concentrate
# near its mean, so one price captures more of it). 20,000 buyers.
import math
import random
def best_price(vals):
vs = sorted(vals, reverse=True)
return max(v * (i + 1) for i, v in enumerate(vs)) / len(vs)
if __name__ == "__main__":
rng = random.Random(63011)
print(" questions separate (per q) bundle (per q) value per q"
" share")
for n in (1, 2, 5, 10, 20):
vals = [[2 * math.exp(rng.gauss(0, 0.8)) for _ in range(n)]
for _ in range(20000)]
sep = best_price([v for row in vals for v in row])
bun = best_price([sum(row) for row in vals]) / n
mean = sum(sum(row) for row in vals) / (20000 * n)
print(" {:3d} {:6.3f} {:6.3f}"
" {:6.3f} {:5.3f}".format(
n, sep, bun, mean, bun / mean))
print("\nReading: priced one by one, each question earns the same share")
print("of its value however many there are. As one bundle, the share")
print("captured climbs towards the whole value as n grows. This is an")
print("argument for bundles of independent questions, not for tiers of")
print("one reading.")Single source and citation
Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization (Version 1.0.0), Chapter 6: Bundles, Decoy Tiers and Paying per Question. 5D Library. https://doi.org/10.5281/zenodo.24090174
DOI: 10.5281/zenodo.24090174 · Read the monograph · 5DL-B-063 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026063,
author = {Fan, Yafu},
title = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090174},
url = {https://doi.org/10.5281/zenodo.24090174}
}Other chapter answers in this book
- Chapter 1 · The Branching Process of "Invite to Unlock"
- Chapter 2 · A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero
- Chapter 3 · Commissions, Share-to-Unlock and the Incentives of Fake Accounts
- Chapter 4 · Information Gaps, Purchase Hazards and the Feeling of "So Accurate"
- Chapter 5 · Pareto Willingness to Pay, One Price and the Revenue Ceiling
- Chapter 7 · "Rub It with Its Own Kind", "Lift Then Clamp" and "Gather When Light"
- Chapter 8 · A Four-Step Check, a Compliance Checklist and a Pre-Registered Paywall Test