What does Catalog Bundling, Throttling and Direct Sales conclude, in numbers, about “The Law of Large Bundles”?

Answer: Chapter 1 shows a bundle of 100 independently valued volumes collecting 0.6839 of value against 0.3356 for singles, with the coefficient of variation falling to 0.2003, but only 0.4595 with a moderate common taste, so "nearly all consumer surplus" is too strong.

Scope of the numbers: Its readers, demands, rates and parameters are illustrative models; all calculations are generated by its programs; platform rules quoted were checked on 11 November 2026; the book is not legal, financial or tax advice. 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.2003, 0.3356, 0.6839, 100

Nmean/volCV of totalbundle price/volshare taken
14.05221.96696.150.3356
54.04060.88893.600.3952
204.05740.44693.000.5157
1004.05490.20033.100.6839
selling each volume alone takes 0.3356 of value
Show the full program
# Chapter 1. p01: The law of large bundles. Each reader values each of N
# volumes independently: with chance 0.55 at zero (not her subject),
# otherwise lognormal with median USD 6 and spread 0.9. Copies cost
# nothing to make. For N = 1, 5, 20 and 100 we print the mean value per
# volume, the coefficient of variation of a reader's total, the best
# price of the whole bundle (searched per volume, step 0.05) and the
# share of all value it collects, against selling each volume at its own
# best price. 20000 readers, seed 115.
import math
import random

def values(rng, n):
    out = []
    for _ in range(n):
        if rng.random() < 0.55:
            out.append(0.0)
        else:
            out.append(math.exp(math.log(6.0) + 0.9 * rng.gauss(0, 1)))
    return out

def best_price(totals, scale):
    tot = math.fsum(totals)
    best = (0.0, 0.0)
    for k in range(1, 400):
        p = 0.05 * k * scale
        rev = p * len([t for t in totals if t >= p])
        if rev > best[0]:
            best = (rev, p)
    return best[0] / tot, best[1] / scale

if __name__ == "__main__":
    readers = 20000
    print("   N   mean/vol   CV of total   bundle price/vol   share taken")
    single = None
    for n in (1, 5, 20, 100):
        rng = random.Random(115)
        totals = [math.fsum(values(rng, n)) for _ in range(readers)]
        m = math.fsum(totals) / readers
        sd = math.sqrt(math.fsum((t - m) ** 2 for t in totals) / readers)
        share, p = best_price(totals, n)
        single = single or share
        print("{:4d}   {:8.4f}   {:11.4f}   {:16.2f}   {:11.4f}".format(
            n, m / n, sd / m, p, share))
    print("selling each volume alone takes {:.4f} of value".format(single))

Single source and citation

Fan, Y. (2026). Large-Scale Monograph Catalog Bundling, Platform Upload Throttling and Sovereign Direct-to-Reader Arbitrage (Version 1.0.0), Chapter 1: The Law of Large Bundles. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-115 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026115,
  author    = {Fan, Yafu},
  title     = {Large-Scale Monograph Catalog Bundling, Platform Upload Throttling and Sovereign Direct-to-Reader Arbitrage},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book