What does Revenue Management and Slot Packing for Space Rentals conclude, in numbers, about “Price Ladders Posted in Full: Dynamic Pricing, a Promise Not to Cut, and Real Scarcity”?

Answer: Chapter 6 compares dynamic pricing with a price ladder announced in advance that never falls (0.9622 of the dynamic optimum), and gives a checker for scarcity notices stated only from the real calendar.

Scope of the numbers: Chapter 1 computes exact expectations for an illustrative month of 20 studio-days: protecting 10 days lifts monthly revenue from 47323.9 yuan to 57432.1 yuan, 21.36 % more, though simulation shows that protection earns less in 0.1900 of months. Marked boxes separate published evidence, runnable Python calculations (18 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: 0.9622

dynamic optimum (closed loop): 39893.3 yuan
Knever-falling ladderrevenueof dynamic
1460037942.90.9511
24000 > 500038385.10.9622
34000 > 4000 > 500038385.10.9622
best 2-step ladder with cuts allowed: 4000 > 5000, 38385.1
dynamic policy: runs with at least one price cut 1.0000, mean cuts 31.98
Show the full program
# Chapter 6. p62: a published, never-falling price ladder.
# Same market as p61 (early makers, late brands). A ladder fixes K prices
# in advance, each at least the one before, so early bookers never see a
# later cut. Change dates are published: t = 30 for two steps, t = 45
# and 30 for three. Prices on a 200-yuan grid from 2000 to 8000; every
# ladder is valued exactly. The dynamic optimum of p61 is then simulated
# 2000 times (seeded) to count how often its posted price falls.
import itertools
import math
import random

C, T, A = 10, 60, 0.8
TH_EARLY, TH_LATE = 2000.0, 3500.0   # 早段价格敏感,晚段(品牌方)不敏感
GRID = list(range(2000, 8001, 200))
FINE = list(range(2000, 8001, 100))


def q(p, t):
    # t = 剩余期数;t > 30 为早段
    return A * math.exp(-p / (TH_EARLY if t > 30 else TH_LATE))


def run_value(price_at):
    v = [0.0] * (C + 1)
    for t in range(1, T + 1):
        p = price_at[t]
        qp = q(p, t)
        v = [0.0] + [math.fsum([qp * (p + v[x - 1]), (1 - qp) * v[x]])
                     for x in range(1, C + 1)]
    return v[C]


BREAKS = {1: [], 2: [30], 3: [45, 30]}   # 预先公示的换价日(剩余期数)


def ladder(prices):
    cut = [T + 1] + BREAKS[len(prices)]
    # 第 i 段:剩余期数 t 满足 cut[i+1] < t <= cut[i]
    return {t: prices[len([c for c in cut[1:] if t <= c])]
            for t in range(1, T + 1)}


def best_ladder(k, monotone=True):
    if monotone:
        pool = itertools.combinations_with_replacement(GRID, k)
    else:
        pool = itertools.product(GRID, repeat=k)
    return max((run_value(ladder(ps)), ps) for ps in pool)


def dyn_table():
    v, hist = [0.0] * (C + 1), [None]
    for t in range(1, T + 1):
        pr = [0] + [max(FINE, key=lambda p: q(p, t) * (p + v[x - 1]
                                                         - v[x]))
                    for x in range(1, C + 1)]
        hist.append(pr)
        v = [0.0] + [math.fsum([q(pr[x], t) * (pr[x] + v[x - 1]),
                                (1 - q(pr[x], t)) * v[x]])
                     for x in range(1, C + 1)]
    return hist, v[C]


hist, vdyn = dyn_table()
print("dynamic optimum (closed loop): %.1f yuan" % vdyn)
print("K  never-falling ladder                  revenue   of dynamic")
for k in (1, 2, 3):
    val, ps = best_ladder(k)
    print("%d  %-36s  %8.1f   %.4f"
          % (k, " > ".join(map(str, ps)), val, val / vdyn))
val2, ps2 = best_ladder(2, monotone=False)
print("best 2-step ladder with cuts allowed: %s, %.1f"
      % (" > ".join(map(str, ps2)), val2))
rng = random.Random(20261113)
cuts = []
for _ in range(2000):
    x, last, n = C, None, 0
    for t in range(T, 0, -1):
        if x == 0:
            break
        p = hist[t][x]
        n += last is not None and p < last  # step: count
        last = p
        if rng.random() < q(p, t):
            x -= 1
    cuts.append(n)
print("dynamic policy: runs with at least one price cut %.4f, mean cuts %.2f"
      % (len([c for c in cuts if c]) / 2000, math.fsum(cuts) / 2000))

Single source and citation

Fan, Y. (2026). Dynamic Revenue Management and Slot Packing for Space Rentals: Nested Protection Levels and the Elimination of Fragmented Idle Time (Version 1.0.0), Chapter 6: Price Ladders Posted in Full: Dynamic Pricing, a Promise Not to Cut, and Real Scarcity. 5D Library. DOI pending

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

BibTeX
@book{fan2026282,
  author    = {Fan, Yafu},
  title     = {Dynamic Revenue Management and Slot Packing for Space Rentals: Nested Protection Levels and the Elimination of Fragmented Idle Time},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book