Worked case · Chapter 7, Decisions in Time · p. 281 · sources checked 9 November 2026
The race to fill low Earth orbit
from which starts can the follower close the gap by whatever the leader does, and which lever moves the closing date?
The network
- Leading constellation → Capacity in orbit acts build rule
- Follower → Capacity in orbit acts build rule
- Follower → Capacity in orbit sees public capacity; whether the current build is seen does not matter
- Follower → Second resource acts build the second resource
The mapping
The six fields of the model card, as the book fills them in for this situation.
| Field | In the case |
|---|---|
| 1 Decision-makers | a leading constellation and one follower; in fact several followers, each with its own launch providers, manufacturers and backers |
| 2 Time | discrete periods (launch seasons); a deadline — a regulatory milestone, a contract date, the end of a market window |
| 3 Information | capacities are public through trackers and filings; the current period's build is hidden or seen first by one side; the model shows that here it does not matter |
| 4 Commitment | none; plans and authorisations are not commitments to build (item vi) |
| 5 Payoffs | to the follower if the gap reaches the target by : a reachability question, zero-sum by construction, not a statement about welfare or markets |
| 6 Strategies | build rules bounded by launch and production rates (, ); attrition by end-of-life disposal and failure (, ); in D5b, a second resource built at its own rate |
What the mathematics licenses.
Six statements about the model; the mapping to the constellations is a reconstruction R.
- In a pure race, intelligence about the leader's plans buys nothing. When neither side's building affects the other's, the follower can guarantee closing the gap by exactly when its full-rate path meets the leader's full-rate path by ; building at the full rate is optimal for both, and the value is the same whether builds are simultaneous or one side sees the other's current build (Proposition 7.14 (p. 301)(a)). In the pursuit game of Model D2, by contrast, seeing the opponent's current move decided between capture at once and no capture at all: information about the opponent's move is valuable only when the opponent's move changes what one can achieve. In a race of this kind, a better forecast of the leader's manifest improves forecasts, not guarantees D [Proposition 7.14 (p. 301)(a), certified by backward induction under three information patterns].
- The gap is not the state. With unequal attrition, two starts with the same gap can lie on opposite sides of the bridge: from the follower closes at date , from it never closes (Figure 7.5 (p. 285)a). A headline that compares counts — “the follower is so many satellites behind” — drops the levels, and with them the attrition that each side must replace before it can grow D [Proposition 7.14 (p. 301)(b)].
- Out-launching is not catching up. The base follower builds half as fast again as the leader and still has the lower ceiling, against , because its units retire sooner. Its window for catching up is set by the leader's level: once the leader holds units, the follower never closes from behind, at any date. Below that level it can close only early and only from close behind: from it closes from , is level or ahead at dates to , and is behind at every date from on; from no integer start does it ever close (Table 7.1 (p. 284)) D [Proposition 7.14 (p. 301)(b); “never” certified for every date].
- Build rate is the short-deadline lever, lifetime the long-deadline lever. Doubling the build rate and halving the attrition rate give the same ceiling, but the faster build gets there sooner at every date (Proposition 7.14 (p. 301)(c)(i); column against in Table 7.1 (p. 284)). Comparing one more unit of build rate with halving attrition, the extra unit adds more up to a crossover date and the longer life adds more after it; the crossover comes earlier the larger the follower's fleet, because attrition is levied on the fleet. In the table every closing date falls before the crossover, so the extra unit of build closes first or at the same date in every row; what reverses is the capacity at a deadline past the crossover, and the closing-date ranking itself reverses only when both fleets start nearer the ceiling — from the halved attrition closes at date and the extra unit at date D [Proposition 7.14 (p. 301)(c)].
- With a second resource, no single bisector exists. When capacity requires both satellites and ground capacity, the follower's winning starts form a staircase, one step per closing date (Figure 7.5 (p. 285)b). The follower with satellite units and ground units closes at date ; the one with and does not close by date , although by satellites alone it is past the threshold. A follower short of ground capacity must close early, before the leader grows further; a follower short of satellites can close late. The rate at which one resource substitutes for the other changes from step to step D [Proposition 7.14 (p. 301)(d)]. Spectrum priority, which the Kuiper order makes depend on the date of deployment, is a further coordinate of the same kind R.
- A milestone is a reachability question with a date, and the regulator chooses the payoff. The interim Kuiper milestone asked whether a follower could reach a target by 30 July 2026; the operator's own projection answered it before the date, and the regulator's choice was what missing it should cost: a loss of priority for the shortfall and the bond, not termination of the authorisation. In the model's terms the regulator did not move the state or the rates; it rewrote field 5, and with it the game the follower plays after the date. The ITU procedure does the same mechanically, by shrinking a filing that misses a milestone to a multiple of the number deployed R.
Where the mapping breaks.
Capacity is not a count: satellites of different generations and sizes carry different throughput, and a count is at best a proxy for the state variable the model needs. The build rates are not exogenous bounds but the output of launch vehicles, factories and finance, each with its own strategic problem (Chapter 6's export controls are one); the model's rates are constants. Attrition is not proportional: satellites retire by cohort at the end of a design life, which makes losses depend on the launch history rather than on the current fleet, and failures cluster by batch. The players are more than two, and they are not symmetric: one leader, several followers, governments that are customers, regulators and backers at once. Above all, the comparison argument needs monotonicity (Remark 7.15 (p. 304)): a common pool of orbital shells or spectrum that the leader pre-empts keeps the leader's full rate a worst case, but building that costs money, a budget that makes early launches expensive later, or a payoff that is not the race alone, all give the leader a trade-off; then timing and information matter again and the bridge must be computed by the backward recursion, not read from two paths. And the record is about deployment, not service: the model says nothing about users, prices or coverage.
In the book
The full case runs through six steps: The situation, as documented; The model card; What the mathematics licenses; Where the mapping breaks; What one would have to measure; Sources. The numbers in step 3 are certified in the chapter's engine room, and the sources in step 6 are listed with the day they were read. The site shows the model mapping (step 2), what the mathematics licenses (step 3) and where the mapping breaks (step 4); the full case is on p. 281 of the book.