关于「报价阶梯:跃迁马尔可夫链与事件研究的视力」,《头部艺人稀缺溢价与降格成本》给出的定量结论是什么?
结论:报价阶梯是一条马尔可夫链。下滑概率升几个点、爬升概率降几个点,到顶时间就拉长三到五倍,二十个季度的收入现值反而更少;低端商单的现金要达到档位收入的 0.686 到 0.781 倍,才能补偿爬坡艺人失去的机会。事件研究证实代言有价值、丑闻有代价,但它的视力有限,单个艺人的经验更看不清降格成本。既然看不清,就要建模:一单低端商单究竟怎样折旧艺人的高奢报价,这笔折旧又该在签约那天收多少钱?
数据口径:核对原文后,本书对立项蓝图作了修正:凸性是对能力而非对曝光,且有 Adler 与 Hamlen 的反方证据;已发表的代言事件研究测的是企业股价,不是艺人报价,降格污染因此写成模型与预注册假说;套牢的经典表述来自 Klein、Crawford 与 Alchian,Grossman 与 Hart 讨论的是剩余控制权;「肖像暗投」一律改写为如实披露的肖像拆分授权。 书中参数均为示意,全部计算由书中程序生成;本书不点名评价任何在世人士,不是个人化的法律、财务或投资建议,合同条款只写结构与博弈逻辑,以上架前人工复核为准。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.686, 0.781
| CLEAN: quarters to reach T4 from T2 31.7, from T3 19.9 | |
| start T2: PV 20 quarters | 4,662; P(T4 at end) = 0.354 |
| start T3: PV 20 quarters | 7,497; P(T4 at end) = 0.505 |
| start T4: PV 20 quarters | 11,430; P(T4 at end) = 0.655 |
| MIXED: quarters to reach T4 from T2 127.4, from T3 100.1 | |
| start T2: PV 20 quarters | 3,272; P(T4 at end) = 0.075 |
| start T3: PV 20 quarters | 5,703; P(T4 at end) = 0.132 |
| start T4: PV 20 quarters | 10,604; P(T4 at end) = 0.237 |
| break-even cash bonus that makes MIXED = CLEAN: | |
| start T1: bonus | 0.686 of tier income |
| start T2: bonus | 0.781 of tier income |
| start T4: bonus | 0.347 of tier income |
查看完整验算程序
# Chapter 2. p21: the fee ladder as a quarterly Markov chain.
# Tiers T0..T4 (entry, mid, premium, luxury, flagship) earn convex
# quarterly fee income (fee units, illustrative). Policy CLEAN accepts
# only deals at or above the current tier; policy MIXED also accepts
# down-market deals that add 25% cash on top of the tier income but
# raise the chance of slipping a tier and lower the chance of climbing.
# All probabilities are illustrative. Discount 3% a quarter.
import math
FEE = [20.0, 50.0, 130.0, 340.0, 900.0]
CLEAN = [[0.80, 0.20, 0.00, 0.00, 0.00],
[0.05, 0.80, 0.15, 0.00, 0.00],
[0.00, 0.05, 0.83, 0.12, 0.00],
[0.00, 0.00, 0.05, 0.87, 0.08],
[0.00, 0.00, 0.00, 0.04, 0.96]]
MIXED = [[0.80, 0.20, 0.00, 0.00, 0.00],
[0.08, 0.79, 0.13, 0.00, 0.00],
[0.00, 0.11, 0.81, 0.08, 0.00],
[0.00, 0.00, 0.11, 0.85, 0.04],
[0.00, 0.00, 0.00, 0.10, 0.90]]
BONUS = {"CLEAN": 0.0, "MIXED": 0.25}
R = 0.03
H = 20
def step(dist, p):
n = len(dist)
return [math.fsum(dist[i] * p[i][j] for i in range(n))
for j in range(n)]
def hitting_time(p, target):
# expected quarters to first reach target, solved by Gauss-Jordan
idx = [i for i in range(len(p)) if i != target]
a = [[(1.0 if r == c else 0.0) - p[r][c] for c in idx] + [1.0]
for r in idx]
n = len(idx)
for col in range(n):
piv = max(range(col, n), key=lambda r: abs(a[r][col]))
a[col], a[piv] = a[piv], a[col]
d = a[col][col]
a[col] = [x / d for x in a[col]]
for r in range(n):
if r != col and a[r][col] != 0.0:
f = a[r][col]
a[r] = [x - f * y for x, y in zip(a[r], a[col])]
return {i: a[k][n] for k, i in enumerate(idx)}
def value(p, bonus, start):
dist = [0.0] * 5
dist[start] = 1.0
terms, top = [], []
for t in range(1, H + 1):
dist = step(dist, p)
inc = math.fsum(d * f * (1 + bonus) for d, f in zip(dist, FEE))
terms.append(inc / (1 + R) ** t)
top.append(dist[4])
return math.fsum(terms), dist
if __name__ == "__main__":
for name, p in (("CLEAN", CLEAN), ("MIXED", MIXED)):
ht = hitting_time(p, 4)
print("{}: quarters to reach T4 from T2 {:.1f}, from T3 {:.1f}"
.format(name, ht[2], ht[3]))
for s in (2, 3, 4):
v, d = value(p, BONUS[name], s)
print(" start T{}: PV {} quarters = {:,.0f}; P(T4 at end)"
" = {:.3f}".format(s, H, v, d[4]))
print("break-even cash bonus that makes MIXED = CLEAN:")
for s in (1, 2, 4):
lo, hi = 0.0, 5.0
vc = value(CLEAN, 0.0, s)[0]
for _ in range(60):
mid = (lo + hi) / 2
if value(MIXED, mid, s)[0] < vc:
lo = mid
else:
hi = mid
print(" start T{}: bonus = {:.3f} of tier income".format(s, hi))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《超模与头部艺人稀缺溢价保护、代言降格污染惩罚与独家经纪博弈母典》第 2 章「报价阶梯:跃迁马尔可夫链与事件研究的视力」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-343 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026343,
author = {Fan, Yafu},
title = {Flagship Talent Scarcity Pricing, Brand-Dilution Spillover Penalties and Exclusive Representation Game Theory},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}