What does Studio Overbooking, Prepaid Float and Ascension conclude, in numbers, about “Overbooking: Airline Arithmetic in the Treatment Room”?
Answer: Chapter 2 writes overbooking as a newsvendor problem: with a bump cost of 3 prices the best is 1 extra booking, adding 0.033 of a full day, and overbooking only on days with two or more risky clients lifts daily net takings from 6.717 to 6.801.
Scope of the numbers: Its clients, prices, rates and costs are illustrative models; all calculations are generated by its programs; the book is not financial, accounting, legal or medical advice and makes no claim about the effect of any treatment or service. 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: 6.717, 6.801
| policy | chairs used | bumps per 100 days | net per day |
| none | 0.840 | 0.0 | 6.717 |
| blind | 0.918 | 20.4 | 6.734 |
| per-flag | 0.956 | 56.2 | 5.966 |
| two-flags | 0.906 | 15.0 | 6.801 |
| two-flags over none: 0.084 a day, 0.0125 of the day's net |
Show the full program
# Chapter 2. p04: Overbook everyone, or only the risky? Clients come in
# two kinds: 70 percent miss with probability 0.06 and 30 percent with
# 0.40 (mean 0.162). The studio flags a client as risky when she missed
# at least one of her last three bookings. Each day 8 slots are booked.
# Policies: none; one blind extra booking every day; one extra booking
# for each flagged client (at most two); one extra booking only on days
# with two or more flagged clients. Bump cost 3, price 1. 20,000
# simulated days per policy, seed 107.
import random
rng = random.Random(107)
DAYS, S, B = 20000, 8, 3.0
def client():
p = 0.40 if rng.random() < 0.30 else 0.06
flag = any(rng.random() < p for _ in range(3))
return p, flag
def day(policy):
cl = [client() for _ in range(S)]
extra = 0
if policy == "blind":
extra = 1
elif policy == "per-flag":
extra = min(2, sum(f for _, f in cl))
elif policy == "two-flags":
extra = 1 if sum(f for _, f in cl) >= 2 else 0
cl += [client() for _ in range(extra)]
shows = sum(rng.random() >= p for p, _ in cl)
return min(shows, S), max(shows - S, 0)
if __name__ == "__main__":
print(" policy chairs used bumps per 100 days net per day")
nets = {}
for pol in ("none", "blind", "per-flag", "two-flags"):
used = bumps = 0
for _ in range(DAYS):
u, b = day(pol)
used += u
bumps += b
net = (used - B * bumps) / DAYS
nets[pol] = net
print(" {:9s} {:11.3f} {:18.1f} {:11.3f}".format(
pol, used / DAYS / S, 100 * bumps / DAYS, net))
print(" two-flags over none: {:.3f} a day, {:.4f} of the day's net"
.format(nets["two-flags"] - nets["none"],
(nets["two-flags"] - nets["none"]) / nets["none"]))Single source and citation
Fan, Y. (2026). Appointment Studio Overbooking Queues, Prepaid Float Dynamics and High-Ticket Ascension Ladders (Version 1.0.0), Chapter 2: Overbooking: Airline Arithmetic in the Treatment Room. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-107 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026107,
author = {Fan, Yafu},
title = {Appointment Studio Overbooking Queues, Prepaid Float Dynamics and High-Ticket Ascension Ladders},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · No-Shows, Deposits and the Price of an Empty Chair
- Chapter 3 · The Float and the Breakage of Prepaid Cards
- Chapter 4 · Is the "Fourth-Session Cliff" a Law or a Parameter?
- Chapter 5 · Harvest the Breakage or Get the Sessions Used: Where NPV Reverses
- Chapter 6 · Intro Sessions and Annual Plans: The Arithmetic of a Two-Stage Funnel
- Chapter 7 · The Guanzi's Tiring Labour, the Reserve of the Jiaozi and Airline Revenue Management
- Chapter 8 · Practice: One Studio's Week and One Test Protocol