What does Limited-Edition Scarcity Pricing conclude, in numbers, about “Secondary-Market Premiums, Name Binding, Transfer Fees, Anti-Bot Defences and the Compliance Edge of "Limited" Claims”?
Answer: The resale premium is the gap between face value and what latecomers will pay, and the early-bird tier is where the gap is widest, so identity controls belong first on the early-bird tier. Resale has a legitimate side, moving goods to people who want them more, but that move should cost close to face value. Name binding is valuable because it means "transfer only by the rules": official face-value transfer plus a waitlist cuts the workshop's empty seats from 4.789 on average to 0.596. A resale share on prints follows a Laffer curve, and the take-maximising rate squeezes out almost half of the trading; this book recommends 0.05 to 0.10. Purchase limits must fall on verified identities, and once scripts are suppressed, the filter's false blocks become the main problem. A "limited" claim has to survive five reconciliations, and its failures fall into two classes: the quantity itself is false, or the devices that make it believable are empty. Chapter 7 writes both classes, together with the ladder and allocation checks, into a new op for the pricing calculator.
Scope of the numbers: Legal rules on such claims are described only in general terms, not as legal advice. Marked boxes separate evidence, calculations, sources and hypotheses, each hypothesis stating what would refute it; the classical source is the Han Feizi parable of buying the casket and returning the pearl, read as a lesson on packaging premiums.
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.596, 4.789
| policy | mean empty | P(empty >= 3) | mean moved | fee to brand | rent to sellers | replacement pays |
| A | 1.188 | 0.1156 | 3.601 | 0.00 | 193.29 | 533.67 |
| B | 4.789 | 0.8777 | 0.000 | 0.00 | 0.00 | - |
| C | 1.188 | 0.1156 | 3.601 | 172.87 | 0.00 | 480 |
| D | 0.596 | 0.0212 | 4.193 | 172.87 | 0.00 | 480 |
| expected drop-outs per sale 4.8; of which known 48h ahead 3.60 |
Show the full program
# Chapter 6. p61: Workshop seats: four transfer policies, simulated 10,000 times (seeds 61061, 61062).
# Fictional: 40 seats at RM 480 won by lottery; clearing price 533.67 (p70 workshop row). Assumptions,
# not measurements: each winner cannot attend with probability 0.12; such a winner knows at least 48
# hours ahead with probability 0.75; a waitlist exists; at the door, a standby list fills a
# last-minute empty seat with probability 0.5 (policy D only).
# A free resale: anyone who drops out early sells at the clearing price; the seller keeps the gap.
# B name-bound, no transfer, no refund. C name-bound, official transfer to the waitlist at face, the
# seller pays a 10% fee. D as C plus the door standby list.
import math
import random
SEATS, FACE, CLEAR, Q, EARLY, STANDBY, FEE, RUNS = 40, 480, 533.67, 0.12, 0.75, 0.5, 0.10, 10000
def one(rng, door, policy):
empty, fee, rent, moved = 0, 0.0, 0.0, 0
for _ in range(SEATS):
if rng.random() >= Q:
continue
early = rng.random() < EARLY
if policy == "B":
empty += 1
elif early:
moved += 1
if policy == "A":
rent += CLEAR - FACE
else:
fee += FEE * FACE
elif policy == "D" and door.random() < STANDBY:
moved += 1
else:
empty += 1
return empty, fee, rent, moved
if __name__ == "__main__":
print("policy mean empty P(empty >= 3) mean moved fee to brand rent to sellers replacement pays")
for pol in "ABCD":
rng, door = random.Random(61061), random.Random(61062)
res = [one(rng, door, pol) for _ in range(RUNS)]
me = math.fsum(r[0] for r in res) / RUNS
p3 = sum(1 for r in res if r[0] >= 3) / RUNS
mm = math.fsum(r[3] for r in res) / RUNS
mf = math.fsum(r[1] for r in res) / RUNS
mr = math.fsum(r[2] for r in res) / RUNS
pay = "-" if pol == "B" else ("{:.2f}".format(CLEAR) if pol == "A" else str(FACE))
print("{:6s} {:10.3f} {:13.4f} {:10.3f} {:12.2f} {:15.2f} {:>16s}".format(
pol, me, p3, mm, mf, mr, pay))
print("expected drop-outs per sale {:.1f}; of which known 48h ahead {:.2f}".format(
SEATS * Q, SEATS * Q * EARLY))Single source and citation
Fan, Y. (2026). Luxury Scarcity Allocation Auctions, Early-Bird Price-Ladder Dynamics and Limited-Edition Physical Premiums (Version 0.1.0), Chapter 6: Secondary-Market Premiums, Name Binding, Transfer Fees, Anti-Bot Defences and the Compliance Edge of "Limited" Claims. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-136 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026136,
author = {Fan, Yafu},
title = {Luxury Scarcity Allocation Auctions, Early-Bird Price-Ladder Dynamics and Limited-Edition Physical Premiums},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Three Sources of a Scarcity Premium, Four Indicators, Evidence Grades and "Buying the Casket, Returning the Pearl"
- Chapter 2 · The Coase Conjecture and Commitment Devices: A Limit Must First Bind the Seller
- Chapter 3 · Early-Bird Ladder Dynamics: Tiers, Steps, Slopes and Honest Announcement
- Chapter 4 · Who Gets the Allocation: First Come, Queues, Lotteries and Three Auctions
- Chapter 5 · Scarcity Psychology: Evidence, Replication Status, Bandwagons and Snobs, and the Modern Casket
- Chapter 7 · The Limited-Edition Playbook: Numbered Decks, Workshop Seats, Numbered Prints, Boutique Quotas and the Distillation Spec for the Four Kits
- Chapter 8 · Practice: Moontide's 500 Numbered Card Sets, from Pricing, Ladder and Allocation to Resale Monitoring