The central Shadow Futures equation

The complete chain

Read it from top to bottom

Under the paper’s theorem assumptions

\begin{aligned} s_{it}(\beta) &= \exp(\beta x_i)\bigl(a+N_i(t)\bigr)^\rho \\[6pt] p_{it}(\beta) &= \frac{s_{it}(\beta)}{\sum_j s_{jt}(\beta)} \\[6pt] \varepsilon_t(\beta) &= 1-\max_i p_{it}(\beta) \\[6pt] \sum_{t=0}^{\infty}\varepsilon_t(\beta)<\infty &\quad\Longrightarrow\quad \begin{gathered} \text{no universal consistent recovery}\\[-2pt] \text{of }F(\beta)\text{ from one history} \end{gathered} \end{aligned}

Four lines, four ideas

01
Build each competitor’s score
The score combines a contribution-related input with advantage the person or firm already has, such as attention, customers or past sales. When $\rho>1$ , that advantage can feed on itself strongly.
02
Choose who receives the next opportunity
Each score becomes a probability. A higher score means a better chance of receiving the next recommendation, customer, contract or sale.
03
Measure how open the contest remains
$\varepsilon_t$ is the chance that the next opportunity goes to anyone except the current favorite. Near zero, almost no other person or firm gets a real shot.
04
See what one history can’t tell us
If those remaining chances add up to only a finite amount, watching forever doesn’t create endless new comparisons. Under the theorem’s other conditions, no method can consistently recover every nonconstant contribution measure from that one history.

The symbols

$x_i$: Agent i’s verified contribution-related input.
$\beta$: How strongly that input affects the chance of winning the next opportunity.
$N_i(t)$: The attention, customers or sales agent i has already accumulated.
$\rho$: How strongly an accumulated advantage produces more advantage.
$p_{it}$: The chance that agent i receives the next opportunity.
$\varepsilon_t$: The chance left for an agent other than the current favorite.