What does Flagship Talent Pricing conclude, in numbers, about “The Fee Ladder: a Markov Chain of Tiers and the Eyesight of Event Studies”?

Answer: The fee ladder is a Markov chain. Raise the chance of slipping by a few points and lower the chance of climbing by a few points, and the expected time to the top becomes three to five times longer while the present value of twenty quarters of income falls. For a performer on the way up, the cash from down-market deals would have to reach between 0.686 and 0.781 of tier income to compensate for the lost chance to climb. Event studies confirm that endorsements create value and that scandals destroy it, but their eyesight is limited, and the experience of a single performer is nearly blind to the cost of downgrades. Since the cost cannot be seen, it must be modelled. How, exactly, does a down-market deal depreciate a performer's luxury fees, and how much should be charged for that depreciation on the day the contract is signed?

Scope of the numbers: All parameters are illustrative and all calculations are generated by the book's programs. The book evaluates no living person and is not personalised legal, financial or investment advice; contract terms are described only as structure and game logic, subject to review before publication.

中文版

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.686, 0.781

CLEAN: quarters to reach T4 from T2 31.7, from T3 19.9
start T2: PV 20 quarters4,662; P(T4 at end) = 0.354
start T3: PV 20 quarters7,497; P(T4 at end) = 0.505
start T4: PV 20 quarters11,430; P(T4 at end) = 0.655
MIXED: quarters to reach T4 from T2 127.4, from T3 100.1
start T2: PV 20 quarters3,272; P(T4 at end) = 0.075
start T3: PV 20 quarters5,703; P(T4 at end) = 0.132
start T4: PV 20 quarters10,604; P(T4 at end) = 0.237
break-even cash bonus that makes MIXED = CLEAN:
start T1: bonus0.686 of tier income
start T2: bonus0.781 of tier income
start T4: bonus0.347 of tier income
Show the full program
# 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))

Single source and citation

Fan, Y. (2026). Flagship Talent Scarcity Pricing, Brand-Dilution Spillover Penalties and Exclusive Representation Game Theory (Version 1.0.0), Chapter 2: The Fee Ladder: a Markov Chain of Tiers and the Eyesight of Event Studies. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book