What does Unbundling, Anti-Arbitrage and Licensing Ladders conclude, in numbers, about “Self-Referral, Channel Blow-Through and Imitating Partners”?
Answer: Self-referral halves the cost of arbitrage: two extra slots make resale beat referral, and at six the firm pays for every resold slot it serves. Imitation among partners spreads profitable resale: with 3 extra slots and self-referral, 0.877 of partners resell after two years. The identity lock and "no commission on a partner's own purchase" together make resale unprofitable from the start.
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.877
share of partners reselling after 6, 12 and 24 months card 6 mo 12 mo 24 mo identity lock (k = 0) 0.000 0.000 0.000 k = 3, no self-referral 0.010 0.003 0.000 k = 5, no self-referral 0.020 0.062 0.380 k = 3, self-referral paid 0.028 0.122 0.877 Reading: once resale pays more than referral, imitation spreads it, slowly at first and then fast: most of the channel within two years when self-referral is paid. With the lock, or whenever resale pays less, the first resellers die out.
Key formula
Show the full program
# Chapter 4. [p08] Partner dynamics: how fast does a channel turn into
# resellers? 400 channel partners each serve 10 clients a month. Each
# month a partner compares her last-month payoff with that of a random
# other partner and copies the better strategy with probability
# gap / (referral payoff) (pairwise imitation, a discrete replicator
# rule), seed 68. Referral pays g * p2 = 49.5 per client. Resale pays
# p2 - slot cost, slot cost from p05/p07; resale also loses a share of
# clients each month to complaints (10%). Start: 2% resellers.
import random
P2, CARD, G, PARTNERS, CLIENTS = 99.0, 199.0, 0.5, 400, 10
def resale_pay(k, self_ref):
cost = (1 - G) * CARD if self_ref else CARD
return P2 - cost / (k + 1)
def run(k, self_ref, months=24, seed=68):
rng = random.Random(seed)
resell = [rng.random() < 0.02 for _ in range(PARTNERS)]
pay_r = 0.9 * CLIENTS * resale_pay(k, self_ref)
pay_a = CLIENTS * G * P2
scale = pay_a
for _ in range(months):
new = resell[:]
for i in range(PARTNERS):
j = rng.randrange(PARTNERS)
mine = pay_r if resell[i] else pay_a
theirs = pay_r if resell[j] else pay_a
if theirs > mine and rng.random() < (theirs - mine) / scale:
new[i] = resell[j]
resell = new
return sum(resell) / PARTNERS
if __name__ == "__main__":
print(" share of partners reselling after 6, 12 and 24 months")
print(" card 6 mo 12 mo 24 mo")
cases = (("identity lock (k = 0)", 0, False),
("k = 3, no self-referral", 3, False),
("k = 5, no self-referral", 5, False),
("k = 3, self-referral paid", 3, True))
for name, k, sr in cases:
out = [run(k, sr, m) for m in (6, 12, 24)]
print(" {:26s} {:6.3f} {:7.3f} {:7.3f}".format(name, *out))
print("\nReading: once resale pays more than referral, imitation")
print("spreads it, slowly at first and then fast: most of the channel")
print("within two years when self-referral is paid. With the lock, or")
print("whenever resale pays less, the first resellers die out.")Single source and citation
Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders (Version 1.0.0), Chapter 4: Self-Referral, Channel Blow-Through and Imitating Partners. 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 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
- Chapter 8 · A Menu Audit and a Pre-Registered Experiment