What does Revenue Management and Slot Packing for Space Rentals conclude, in numbers, about “Bid Prices: How the Value of a Studio-Day Changes over the Booking Run”?

Answer: Chapter 3 handles interleaved arrivals with bid prices that move over the booking run: bid prices earn 6009.0 yuan a month more than first come, first served, while EMSR-b fixed on total monthly demand earns only 1236.2 yuan more.

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: 1236.2, 6009.0

EMSR-b protection levels on total demand: [2, 7, 14]
policymean revenuegain vs FCFS95% CI of the gain
DP62768.36009.05777.3 to6240.7
DP-30%61697.54938.14768.2 to5108.1
DP+30%61725.84966.44672.2 to5260.6
EMSR-b57995.61236.2953.8 to1518.7
FCFS56759.30.00.0 to0.0
Show the full program
# Chapter 3. p32: bid prices, static EMSR-b and FCFS on mixed arrivals.
# Requests arrive one period at a time in the order the model of p31
# draws them (cheap mostly early, dear mostly late, but mixed). Policies:
#   DP     accept class j iff f_j >= bid price B(t, x) of p31
#   DP-30% / DP+30%  the same rule built on a forecast in which classes
#          1 and 2 are 30 % lower / higher than the truth
#   EMSR-b static nested limits from total class demand (sd = sqrt(mean))
#   FCFS   accept while any day is left
# 4000 seeded months; paired differences against FCFS with 95 % CI.
import math
import random
import statistics
from statistics import NormalDist

C, T = 20, 100
FARE = [5600, 4200, 3000, 1800]
EARLY = [0.00, 0.02, 0.08, 0.16]
LATE = [0.06, 0.08, 0.04, 0.04]


def probs(t, scale=1.0):
    p = EARLY if t > 50 else LATE
    return [p[j] * (scale if j < 2 else 1.0) for j in range(4)]


def bids(scale):
    v = [[0.0] * (C + 1)]
    for t in range(1, T + 1):
        prev, row = v[-1], [0.0]
        p = probs(t, scale)
        stay = 1.0 - math.fsum(p)
        for x in range(1, C + 1):
            terms = [stay * prev[x]]
            terms += [p[j] * max(FARE[j] + prev[x - 1], prev[x])
                      for j in range(4)]
            row.append(math.fsum(terms))
        v.append(row)
    return [[0.0] + [v[t - 1][x] - v[t - 1][x - 1] for x in range(1, C + 1)]
            for t in range(1, T + 1)]


def emsr_b():
    mu = [math.fsum([EARLY[j] * 50, LATE[j] * 50]) for j in range(4)]
    y = [0]
    for j in range(1, 4):
        s = math.fsum(mu[:j])
        fb = math.fsum(FARE[k] * mu[k] for k in range(j)) / s
        y.append(round(NormalDist(s, math.sqrt(s)).inv_cdf(
            1 - FARE[j] / fb)))
    return y


def run(stream, rule):
    x, rev = C, 0
    for t, j in stream:
        if x > 0 and rule(t, x, j):
            x -= 1
            rev += FARE[j]  # step: integer fare
    return rev


B = {s: bids(s) for s in (1.0, 0.7, 1.3)}
Y = emsr_b()
rules = {
    "DP": lambda t, x, j: FARE[j] >= B[1.0][t - 1][x],
    "DP-30%": lambda t, x, j: FARE[j] >= B[0.7][t - 1][x],
    "DP+30%": lambda t, x, j: FARE[j] >= B[1.3][t - 1][x],
    "EMSR-b": lambda t, x, j: x > Y[j],
    "FCFS": lambda t, x, j: True,
}
CUM = {flag: [math.fsum(probs(t)[:j + 1]) for j in range(4)]
       for flag, t in ((True, 100), (False, 1))}
rng = random.Random(20261113)
res = {k: [] for k in rules}
for _ in range(4000):
    stream = []
    for t in range(T, 0, -1):
        u = rng.random()
        for j, cp in enumerate(CUM[t > 50]):
            if u < cp:
                stream.append((t, j))
                break
    for k, rule in rules.items():
        res[k].append(run(stream, rule))
print("EMSR-b protection levels on total demand: %s" % Y[1:])
print("policy    mean revenue   gain vs FCFS   95% CI of the gain")
for k in rules:
    d = [a - b for a, b in zip(res[k], res["FCFS"])]
    m = statistics.fmean(d)
    h = 1.96 * statistics.stdev(d) / math.sqrt(len(d)) if any(d) else 0.0
    print("%-8s  %10.1f   %10.1f   %8.1f to %8.1f"
          % (k, statistics.fmean(res[k]), m, m - h, m + h))

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 3: Bid Prices: How the Value of a Studio-Day Changes over the Booking Run. 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