What does Unbundling, Anti-Arbitrage and Licensing Ladders conclude, in numbers, about “The Six-Tier Menu: an Exactly Solved Screening Problem”?

Answer: Chapter 5 solves the six-tier menu exactly as a screening problem: the optimal prices are 12, 117, 287, 567, 12537 and 34537, and the business licence and agency seat bring about four fifths of profit; with the licence held at 3,000, profit falls to 0.434.

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: 0.434, 12537, 3000, 34537

   case                      profit/visitor  vs p09   p5     p6
   p09 menu                       505.94    1.000  12537  34537
   (a) tiers 1-4 only             103.98    0.206      -      -
   (b) no agency seat             418.44    0.827  12537      -
   (c) licence <= 3,000           219.83    0.434   3000  25000
   (d) B2B shares halved          296.63    0.586  12537  34537
   (e) commission halved          377.34    0.746      -  15667
Reading: the two B2B tiers carry most of the profit. A cheap
licence does not just lose its own margin: the agency price
is tied to it through the IC chain and falls with it. If the
commission halves, the best menu drops the licence and sells
studios the agency seat at a lower price instead.

Key formula

\[p_j = p_{j-1} + v_t(j) - v_t(j-1) .\]
Show the full program
# Chapter 5. [p10] How much of the ladder's profit depends on its top?
# The model of p09 (same six types, values, shares and unit costs) is
# re-solved exactly under five changes: (a) consumer tiers only (1-4);
# (b) no agency seat (1-5); (c) licence capped at 3,000 because "it is
# only software" (it stays on the menu, higher prices follow from it);
# (d) studio and agency shares halved; (e) the studio commission
# halved (licence value 0.25 x 99 x 260 = 6,435).
from itertools import combinations_with_replacement as cwr

SHARE = (0.60, 0.22, 0.10, 0.05, 0.025, 0.005)
V = ((12, 30, 40, 45, 50, 55),
     (15, 120, 180, 210, 240, 260),
     (18, 160, 330, 420, 520, 560),
     (20, 180, 420, 700, 1100, 1300),
     (20, 200, 500, 900, 12870, 16000),
     (20, 200, 520, 1000, 16000, 38000))
COST = (1, 3, 8, 12, 1500, 6000)

def solve(v, share, allowed=(1, 2, 3, 4, 5, 6), cap=None):
    best = (-1.0, None)
    for assign in cwr((0,) + allowed, 6):
        if cap and not set(cap) <= set(assign):
            continue          # a capped tier must stay on the menu
        price, prev = {}, None
        for t, j in enumerate(assign):
            if j == 0:
                continue
            if prev is None:
                price[j] = v[t][j - 1]
            elif j not in price:
                price[j] = price[prev] + v[t][j - 1] - v[t][prev - 1]
            if cap and j in cap:
                price[j] = min(price[j], cap[j])
            prev = j
        tot = 0.0
        for t in range(6):
            opts = [(round(v[t][j - 1] - price[j], 9), j) for j in price]
            opts = [o for o in opts if o[0] >= 0]
            if opts:
                j = max(opts)[1]
                tot += share[t] * (price[j] - COST[j - 1])
        if tot > best[0] + 1e-9:
            best = (tot, price)
    return best

if __name__ == "__main__":
    base, _ = solve(V, SHARE)
    v_half = [list(r) for r in V]
    v_half[4][4] = 6435
    cases = (("p09 menu", V, SHARE, (1, 2, 3, 4, 5, 6), None),
             ("(a) tiers 1-4 only", V, SHARE, (1, 2, 3, 4), None),
             ("(b) no agency seat", V, SHARE, (1, 2, 3, 4, 5), None),
             ("(c) licence <= 3,000", V, SHARE, (1, 2, 3, 4, 5, 6),
              {5: 3000}),
             ("(d) B2B shares halved", V,
              SHARE[:4] + (0.0125, 0.0025), (1, 2, 3, 4, 5, 6), None),
             ("(e) commission halved", v_half, SHARE,
              (1, 2, 3, 4, 5, 6), None))
    print("   case                      profit/visitor  vs p09   p5     p6")
    for name, v, sh, al, cap in cases:
        p, price = solve(v, sh, al, cap)
        print("   {:24s} {:12.2f} {:8.3f} {:>6s} {:>6s}".format(
            name, p, p / base,
            "{:.0f}".format(price[5]) if 5 in price else "-",
            "{:.0f}".format(price[6]) if 6 in price else "-"))
    print("\nReading: the two B2B tiers carry most of the profit. A cheap")
    print("licence does not just lose its own margin: the agency price")
    print("is tied to it through the IC chain and falls with it. If the")
    print("commission halves, the best menu drops the licence and sells")
    print("studios the agency seat at a lower price instead.")

Single source and citation

Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders (Version 1.0.0), Chapter 5: The Six-Tier Menu: an Exactly Solved Screening Problem. 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