What does Packing, Refund Ladders and Depreciation for Studios conclude, in numbers, about “Overbooking as a Newsvendor Problem: the Marginal-Booking Rule, the Cost of Compensation and the Trap of Correlated No-Shows”?

Answer: Chapter 4 writes overbooking as a newsvendor problem: one extra booking earns 679 yuan more, but once the intra-day correlation of no-shows reaches 0.15 the venue should not overbook.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not individual tax, legal or investment advice. Marked boxes separate published evidence, runnable Python calculations (22 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: 679

extra kP(any bump)E[bumped]E[profit]changeP(room)
00.00000.000017587+00.6404
10.31650.316518267+6790.2951
20.65830.936817487-7790.1087
30.86341.721115921-15670.0341
40.95362.571114039-18820.0095
best k = 1: 18267 yuan vs 17587 with no overbooking
rule: add a booking while P(room) > 0.4795
P(room) = chance the extra booking finds an empty slot
Show the full program
# Chapter 4. p41: overbooking a peak Saturday as a newsvendor problem.
# 8 half-day slots at 2400 yuan.  The venue takes 8 + k bookings; each
# client shows independently with probability 0.88.  A no-show forfeits
# a deposit of 0.3 of the price.  A client who shows but finds no slot
# gets her money back plus compensation of 1.0 price (a free future
# session at cost plus goodwill).  Exact binomial expectation.
# Newsvendor reading: book one more while the chance that the extra
# booking lands on an empty slot beats the cost ratio.
# Illustrative parameters.
import math

C, P, SHOW, DEP, COMP = 8, 2400, 0.88, 0.3, 1.0

def binom(n, k, p):
    return math.comb(n, k) * p ** k * (1 - p) ** (n - k)

def profit(n):
    parts, pb, eb = [], [], []
    for s in range(n + 1):
        w = binom(n, s, SHOW)
        bump = max(0, s - C)
        parts.append(w * (min(s, C) * P + (n - s) * DEP * P
                          - bump * COMP * P))
        pb.append(w if bump else 0.0)
        eb.append(w * bump)
    return math.fsum(parts), math.fsum(pb), math.fsum(eb)

def room(n):
    return math.fsum(binom(n, s, SHOW) for s in range(min(n, C - 1) + 1))

need = (COMP * SHOW - (1 - SHOW) * DEP) / (SHOW * (1 + COMP))
print("extra k  P(any bump)  E[bumped]  E[profit]  change  P(room)")
prev = None
best = None
for k in range(0, 5):
    v, pb, eb = profit(C + k)
    ch = 0 if prev is None else v - prev
    print("{:7d}  {:11.4f}  {:9.4f}  {:9.0f}  {:+6.0f}  {:7.4f}".format(
        k, pb, eb, v, ch, room(C + k)))
    prev = v
    if best is None or v > best[1]:
        best = (k, v)
print("best k = {}: {:.0f} yuan vs {:.0f} with no overbooking".format(
    best[0], best[1], profit(C)[0]))
print("rule: add a booking while P(room) > {:.4f}".format(need))
print("P(room) = chance the extra booking finds an empty slot")

Single source and citation

Fan, Y. (2026). One-Dimensional Time-Slot Packing for Multi-Format Studio Sets, Dynamic Cancellation-Option Ladders and Accelerated Depreciation of High-Wear Equipment (Version 1.0.0), Chapter 4: Overbooking as a Newsvendor Problem: the Marginal-Booking Rule, the Cost of Compensation and the Trap of Correlated No-Shows. 5D Library. DOI pending

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

BibTeX
@book{fan2026173,
  author    = {Fan, Yafu},
  title     = {One-Dimensional Time-Slot Packing for Multi-Format Studio Sets, Dynamic Cancellation-Option Ladders and Accelerated Depreciation of High-Wear Equipment},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book