关于「二十小时、三个时段与一道阶梯」,《无人空间计价、储值浮存金与平台收编》给出的定量结论是什么?
结论:第一章说明只分时段在逐时模型中增加到 1.0576 倍;加入预约、客群、商用费率与连租阶梯后,对调好的单一时薪为 1.1721 倍,对凭习惯定的低价为 1.3165 倍,所以「40% 以上」的说法不成立。
数据口径:书中的客人、需求、费率与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务、会计或税务方面的建议。 第七章读《新唐书》的飞钱、宋代出租官房的店宅务与双边市场理论:利特尔定律给出 17500,模拟为 17554。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1.1721, 1.3165
| A: TWD 950 an hour; B: bands x 1.05 | 1344 / 945 / 536 |
| plan rev/day books hours net/day /ping/mo vs A | |
| A one price | 7600.0 3.31 8.00 7103.0 8523.6 1.0000 |
| A0 habit 600 | 6970.0 4.31 11.62 6324.0 7588.8 0.8903 |
| B bands | 8458.8 3.41 8.56 7947.8 9537.4 1.1189 |
| C + commercial | 8569.2 3.36 8.32 8065.2 9678.2 1.1355 |
| D + ladder | 8800.8 3.17 9.40 8325.3 9990.3 1.1721 |
| cleaning share of revenue under A | 0.0654 |
| D against A0 (habit price) | 1.3165 |
查看完整验算程序
# Chapter 1. p02: Bookings, not hours. Personal shoots, commercial shoots
# and night creators ask for a start hour; the k-th hour is worth v*0.8**k
# to them, so each picks the length that maximises its surplus at the
# posted prices, or tries one hour earlier or later at 0.8 of the value.
# Plans: A one price; B three bands; C bands plus a 1.5x commercial rate
# that 0.75 of commercial clients declare; D C plus 20% off every hour
# after the second. Cleaning is TWD 150 a booking. 25 ping, 300 days each,
# common random numbers, seed 113. Prices of A and B are tuned on a grid;
# A0 is a single price of TWD 600 set by habit instead of by a search.
import math
import random
OPEN, CLOSE, DAYS, PING, CLEAN = 7, 27, 300, 25, 150.0
BANDS = (1280.0, 900.0, 510.0)
def band(h):
return 0 if 10 <= h <= 15 else (2 if h >= 22 else 1)
def poisson(rng, lam):
k, t = 0, rng.random()
p = math.exp(-lam)
c = p
while t > c:
k += 1
p *= lam / k
c += p
return k
def requests(rng):
out = []
for h in range(OPEN, CLOSE):
lam = {0: 1.05, 1: 0.55, 2: 0.45}[band(h)]
th = {0: 950.0, 1: 700.0, 2: 430.0}[band(h)]
if h <= 9:
lam, th = 0.4, 620.0
for _ in range(poisson(rng, lam)):
out.append((rng.random(), h, -th * math.log(1 - rng.random()),
False))
for _ in range(poisson(rng, 0.8)):
out.append((rng.random(), rng.choice((9, 10, 11, 12, 13)),
-1900.0 * math.log(1 - rng.random()), True))
for _ in range(poisson(rng, 0.6)):
out.append((rng.random(), rng.choice((21, 22, 23)),
-520.0 * math.log(1 - rng.random()), False))
out.sort()
return out
def price(plan, h, k, comm, declared):
p = plan["one"] if plan["one"] else plan["b"][band(h)]
if plan["comm"] and comm and declared:
p *= 1.5
if plan["ladder"] and k >= 2:
p *= 0.8
return p
def choose(plan, free, s, v, comm, dec):
best = (0.0, None, 0, 0.0)
for shift, f in ((0, 1.0), (-1, 0.8), (1, 0.8)):
st = s + shift
surplus, pay = 0.0, 0.0
for k in range(6):
h = st + k
if h < OPEN or h >= CLOSE or not free[h]:
break
pr = price(plan, h, k, comm, dec)
surplus += f * v * 0.8 ** k - pr
pay += pr
if surplus > best[0] + 1e-9:
best = (surplus, st, k + 1, pay)
return best
def run(plan, seed=113):
rng = random.Random(seed)
rev, books, hours = [], 0, 0
for _ in range(DAYS):
free = {h: True for h in range(OPEN, CLOSE)}
for _, s, v, comm in requests(rng):
dec = rng.random() < 0.75
sur, st, d, pay = choose(plan, free, s, v, comm, dec)
if st is None:
continue
for h in range(st, st + d):
free[h] = False
rev.append(pay)
books += 1
hours += d
r = math.fsum(rev) / DAYS
return r, books / DAYS, hours / DAYS, r - CLEAN * books / DAYS
def plan(one=0.0, scale=1.0, comm=False, ladder=False):
return {"one": one, "b": tuple(scale * x for x in BANDS),
"comm": comm, "ladder": ladder}
if __name__ == "__main__":
a = max(range(600, 1501, 50), key=lambda p: run(plan(one=p))[3])
sc = max([x / 20 for x in range(14, 27)],
key=lambda s: run(plan(scale=s))[3])
plans = (("A one price", plan(one=a)), ("A0 habit 600", plan(one=600)),
("B bands", plan(scale=sc)),
("C + commercial", plan(scale=sc, comm=True)),
("D + ladder", plan(scale=sc, comm=True, ladder=True)))
print("A: TWD {} an hour; B: bands x {:.2f} = {:.0f} / {:.0f} / {:.0f}"
.format(a, sc, *(sc * x for x in BANDS)))
print("plan rev/day books hours net/day /ping/mo vs A")
res = [(name, run(pl)) for name, pl in plans]
base, habit = res[0][1][3], res[1][1][3]
for name, (r, b, h, net) in res:
print("{:15s} {:8.1f} {:6.2f} {:6.2f} {:8.1f} {:9.1f} {:6.4f}"
.format(name, r, b, h, net, 30 * net / PING, net / base))
r, b = res[0][1][0], res[0][1][1]
print("cleaning share of revenue under A: {:.4f}".format(CLEAN * b / r))
print("D against A0 (habit price): {:.4f}".format(res[-1][1][3] / habit))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《无人共享空间收益管理、跨店储值浮存金与木马收编博弈》第 1 章「二十小时、三个时段与一道阶梯」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-113 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026113,
author = {Fan, Yafu},
title = {Unmanned Shared-Space Revenue Management, Cross-Venue Prepaid Float and Zero-Take-Rate Trojan Onboarding},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}