Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Asymmetric payoffs and exposure

A forecast of an event and the payoff attached to that event answer different questions. Let XX be a real random variable with CDF FF and let g(X)g(X) be its payoff. We use gg for the transformation, reserving FF for the CDF as in the shared notation. An ordinary finite expected payoff requires E∣g(X)∣<∞\mathbb E|g(X)|<\infty.

The frequency of gains does not determine their mean

Consider this finite payoff table, in arbitrary payoff units:

Outcome probabilityPayoff APayoff B
0.981-1
0.02-8080

Direct summation gives E[A]=−0.62\mathbb E[A]=-0.62 and E[B]=0.62\mathbb E[B]=0.62. The higher probability of a gain belongs to the lower expected payoff. Both payoffs are bounded; fat tails are unnecessary for this distinction. More generally, a payoff equal to a>0a>0 with probability 1−q1-q and to −b<0-b<0 with probability qq has mean (1−q)a−qb(1-q)a-qb.

This is a one-period expectation calculation. A repeated strategy with a finite resource constraint needs a model of ruin as well.

Curvature and Jensen’s inequality

Suppose XX takes values in an open interval II, its mean μ=EX\mu=\mathbb E X belongs to II, and E∣X∣<∞\mathbb E|X|<\infty. If g:I→Rg:I\to\mathbb R is differentiable and convex, and E∣g(X)∣<∞\mathbb E|g(X)|<\infty, then

Eg(X)≥g(EX).\mathbb E g(X)\ge g(\mathbb E X).

We prove this differentiable case. Convexity gives the supporting-line inequality g(x)≥g(μ)+g′(μ)(x−μ)g(x)\ge g(\mu)+g'(\mu)(x-\mu) for every x∈Ix\in I: the secant slopes on either side of μ\mu bracket g′(μ)g'(\mu). Taking expectations of this integrable inequality proves the claim. Applying it to −g-g reverses the inequality for concave gg.

For a symmetric two-point perturbation X=μ±sX=\mu\pm s, each with probability 1/21/2, the mean remains μ\mu. With μ=4\mu=4 and s=2s=2,

EX2=20>16=(EX)2,EX=2+62<2.\mathbb E X^2=20>16=(\mathbb E X)^2, \qquad \mathbb E\sqrt X=\frac{\sqrt2+\sqrt6}{2}<2.

For the quadratic payoff g(x)=x2g(x)=x^2, the gain in expectation is exactly s2s^2; for g(x)=−x2g(x)=-x^2, it is −s2-s^2. These are changes relative to the constant input μ\mu. Comparing two arbitrary distributions requires a specified ordering of their spreads; variance alone does not order expectations of every convex function.

For example, compare the symmetric law at ±1\pm1 with the law assigning probability 3/43/4 to zero and 1/81/8 to each of ±2\pm2. Both have mean zero and variance one. Their expectations of ∣X∣|X| are 1 and 1/21/2, whereas their expectations of X4X^4 are 1 and 4. Both functions are convex, so neither law gives the larger expectation for every convex payoff.

A transformation changes the tail and its moment requirements

For exact Pareto XX with xm>0x_m>0, α>0\alpha>0, and a power payoff g(x)=xrg(x)=x^r with r>0r>0, direct inversion of the event gives

P(g(X)>y)=P(X>y1/r)=(xmry)α/r,y≥xmr.P(g(X)>y)=P(X>y^{1/r}) =\left(\frac{x_m^r}{y}\right)^{\alpha/r}, \qquad y\ge x_m^r.

The payoff exponent is α/r\alpha/r. Its mean is finite exactly when r<αr<\alpha, by the Pareto moment proof. For example, α=3/2\alpha=3/2 gives a finite mean for XX and an infinite mean for X2X^2. The finite-expectation version of Jensen above cannot be applied to that quadratic payoff with both sides finite.

If instead g(x)=min⁡(x,c)g(x)=\min(x,c) on x≥0x\ge0 with c>0c>0, the payoff lies in [0,c][0,c], so Eetg(X)≤e∣t∣c\mathbb E e^{t g(X)}\le e^{|t|c} for every real tt. For XX Pareto with xm=1x_m=1, α=3/2\alpha=3/2, and c=4c=4, integration of the survival gives

Emin⁡(X,4)=∫04P(X>v) dv=1+∫14v−3/2 dv=2,EX=3.\mathbb E\min(X,4)=\int_0^4P(X>v)\,dv =1+\int_1^4v^{-3/2}\,dv=2, \qquad \mathbb E X=3.

This cap bounds the realized payoff and changes its mean. It does not estimate the uncapped mean. The inference note shows why bounded payoffs have a different contamination sensitivity.

Convexity alone does not bound downside: g(x)=ex+xg(x)=e^x+x has g′′(x)=ex>0g''(x)=e^x>0 but tends to −∞-\infty as x→−∞x\to-\infty. An explicit bound such as g(x)=max⁡(x−u,0)−d≥−dg(x)=\max(x-u,0)-d\ge-d, for fixed uu and d≥0d\ge0, is a separate property. Repetition, costs and the distribution of XX still matter.

Worked calculation and sources

Use finite_payoff_mean.

from xmath.incerto.lecture_risk import finite_payoff_mean

probabilities = [0.98, 0.02]
print(f"A: {finite_payoff_mean(probabilities, [1, -80]):.4g}")
print(f"B: {finite_payoff_mean(probabilities, [-1, 80]):.4g}")
print(f"Convex gap: {finite_payoff_mean([0.5, 0.5], [2**2, 6**2]) - 4**2:.4g}")

Output

A: -0.62
B: 0.62
Convex gap: 4

A’s higher gain frequency does not imply a higher expected payoff.

The lower panel of the shared figure plots E[(4±s)2]−16=s2\mathbb E[(4\pm s)^2]-16=s^2 and its negative for 0≤s≤30\le s\le3. Reproduce the figure and finite payoff table with uv run python demos/incerto/lecture_risk.py. These are exact finite sums on 121 spread values, without simulation or external data.

The source context is Taleb (2025), ch. 3, §3.4.1, pp. 41–43, and §3.10, pp. 60–63. The chapter motivates distinguishing state from exposure. The finite-table calculation, differentiable Jensen argument, power-tail transformation and capped-mean calculation are proved here.

References
  1. Taleb, N. N. (2025). Statistical Consequences of Fat Tails (3rd ed.). https://arxiv.org/abs/2001.10488v4