Fair Price of a Coin-Flipping Game
You are offered a game: flip $n = 10$ fair coins. The payoff equals $H^2$, where $H$ is the number of heads.
- What is the fair price of this game (i.e., the expected payoff)?
- Generalize: for a payoff function $f(H)$, write down the fair price formula.
- Explain intuitively why the fair price of the $H^2$ game is not simply $(E[H])^2$.
Hints
- The fair price is always the expected payoff under the true probabilities -- no discounting needed for a one-period game with no time value.
- For the $H^2$ payoff, use the identity $E[H^2] = \text{Var}(H) + (E[H])^2$ to avoid summing 11 terms.
- The gap between $E[H^2]$ and $(E[H])^2$ is exactly $\text{Var}(H)$ -- this is not a coincidence, it is the definition of variance, and it connects directly to Jensen's inequality for convex functions.
Worked Solution
How to Think About It: The fair price of any game is its expected value under the true probability measure -- the amount at which a risk-neutral player is indifferent. For a binomial payoff, you weight each possible outcome by its probability and sum. The interesting subtlety here is Part 3: $E[H^2] \neq (E[H])^2$ because of variance. This is Jensen's inequality -- squaring is a convex function, so the expectation of the square exceeds the square of the expectation by exactly $\text{Var}(H)$.
Quick Estimate: With $n = 10$ fair coins, $E[H] = 5$ and $\text{Var}(H) = np(1-p) = 10 \times 0.5 \times 0.5 = 2.5$. So $E[H^2] = \text{Var}(H) + (E[H])^2 = 2.5 + 25 = 27.5$. Done. No need to enumerate all 11 outcomes.
Approach: Use the variance decomposition $E[H^2] = \text{Var}(H) + (E[H])^2$ for Part 1; state the general formula for Part 2; explain via Jensen for Part 3.
Formal Solution:
Part 1 -- Fair price of the $H^2$ game.
$H \sim \text{Binomial}(n=10, p=0.5)$. We use: $E[H^2] = \text{Var}(H) + (E[H])^2$
For a $\text{Binomial}(n, p)$: $E[H] = np = 5$ and $\text{Var}(H) = np(1-p) = 2.5$. Therefore: $\boxed{E[H^2] = 2.5 + 25 = 27.5}$
Part 2 -- General fair price formula.
For any payoff function $f$, the fair price is: $P = E[f(H)] = \sum_{k=0}^{n} \binom{n}{k} \frac{1}{2^n} f(k)$
This weights each value of $f$ by its binomial probability. For continuous or smooth $f$, you can often compute moments directly (as in Part 1) rather than summing all terms.
Part 3 -- Why $E[H^2] \neq (E[H])^2$.
The gap is the variance: $E[H^2] - (E[H])^2 = \text{Var}(H) = 2.5 > 0$. More generally, for any convex function $g$, Jensen's inequality says $E[g(H)] \geq g(E[H])$. Since $g(x) = x^2$ is convex, $E[H^2] \geq (E[H])^2$ always, with equality only when $H$ is constant (zero variance). The gap reflects the fact that the game pays off extra on the upside (a run of many heads contributes disproportionately because of the square) and is not offset symmetrically on the downside.
Answer: - Fair price of the $H^2$ game with $n=10$: