Skip to content
All library documents

Risk-Neutral Expectations in the Multi-Period Binomial Model

Article Quant Q&A · Author: BCLC

Summary

The answer explains why a claim's arbitrage-free value in a multi-period binomial model equals its risk-neutral expected payoff discounted by the risk-free rate. It shows the recursive one-step valuation and expands it across periods, where each iteration takes a risk-neutral expectation. The result can also be established by induction or by applying the law of total expectation to the value at the next time step.

The risk-neutral expectation sums the claim payoff over possible paths, weighting each path by the product of its up and down probabilities. For payoffs that depend only on the number of up moves, the path sum can be grouped using binomial coefficients. The discussion is a derivation within the standard binomial setup, not empirical evidence. It assumes the model's risk-neutral probabilities and discounting convention are already specified; notation in the final grouped sum appears inconsistent in places, so readers should check indices when implementing it.

Key ideas

  • In a multi-period binomial model, each step discounts the risk-neutral expected value at the next step.
  • Repeated one-step valuation yields the discounted risk-neutral expectation of the terminal payoff.
  • The result can be proved by induction or by using the law of total expectation.
  • A risk-neutral expectation weights each possible path by its probability under the measure Q.
  • Payoffs depending only on the number of up moves can be aggregated with binomial coefficients.

Tags

Full text
# Prove that the binomial algorithm implies the arbitrage free price at t=0 of a T-claim


# Prove that the binomial algorithm implies the arbitrage free price at t=0 of a T-claim












In Tomas Bjork's Arbitrage Theory in Continuous Time (or here), $\exists$ these propositions

How does the first formula follow from from the algorithm? I get that $\Pi(0;X) = V_0(0)$, but I don't really get what $E^{Q}[X]$ means...is that equal to $q_uu+q_dd$? Anyway using the algorithm I got $V_0(k) = \frac{1}{(1+R)^T} \sum_{l=0}^{T} V_T(k+l)q_u^{T-l}q_d^{l}$...is $\sum_{l=0}^{T} V_T(l)q_u^{T-l}q_d^{l}$ supposed to be $=q_uu+q_dd$?

## Answer by DoubleTrouble (score 1, accepted)

https://quant.stackexchange.com/a/14012

I believe this is the way that Björk proposes, however I believe "my" way below is more elegant. The trick in Björk's case is to realize that in each "iteration" we get an expeted value:

$$V_0(0) = \frac{1}{1+R}\left(q_u V_{1}(1) + q_d V_1(0) \right) \\ = \frac{1}{(1+R)^{2}} \left( q_u^2 V_2(2) + 2q_uq_d V_2(1) + q_d V_2(0) \right) \\ = \frac{1}{(1+R)^{2}}E^Q[V_2].$$

Continuing in the same fashion you will arrive at

$$V_0(0) = \frac{1}{(1+R)^{T}}E^Q[V_T],$$

however to make this formal you should make some kind of induction argument.

My Method:

My methods does not use Proposition 2.24 but instead the fact that we already know the single period Binomial Model and the Law of total expectation. We already know that Proposition 2.25 holds true if $T=1$ since this reduces to the single-period Binomial model. So assume that $T \geq 2$ and assume that Proposition 2.25 holds true for $T-1$ periods. We when know from the induction assumption that.

$$ \Pi(1; X) = \frac{1}{(1+R)^{T-1}}E^Q[\Phi(S_T)|Z_1] $$

But

$$ \Pi(0; X) = \frac{1}{(1+R)} E^Q[\Pi(1; X)],$$

and hence

$$ \Pi(0; X) = \frac{1}{(1+R)} E^Q[\Pi(1; X)] = \frac{1}{(1+R)^{T}} E^Q[E^Q[\Phi(S_T)|Z_1]] \\ = \frac{1}{(1+R)^{T}} E^Q[\Phi(S_T)].$$

This concludes the proof of Proposition 2.25

What does $E^Q[X]$ mean:

If $Z_1,...,Z_T$ are independent random variables

$$E[f(Z_1,...,Z_T)] = \sum_{z_1,...,z_T=\text{u or d}} f(z_1,...,z_T)P(Z_1=z_1)\cdots P(Z_T=z_T) \\ = \sum_{z_1,...,z_T=\text{u or d}} f(z_1,...,z_T)p_{z_1} \cdots p_{z_T}. $$

This sum means that we sum over all possible outcomes/paths. Since we often use a martingale/risk neutral probability measure it is convenient to introduce the notation to denote the expectation under the probability measure $Q$.

$$E^Q[f(Z_1,...,Z_T)] = \sum_{z_1,...,z_T=\text{u or d}} f(z_1,...,z_T)Q(Z_1=z_1)\cdots Q(Z_T=z_T) \\ = \sum_{z_1,...,z_T=\text{u or d}} f(z_1,...,z_T)q_{z_1} \cdots q_{z_T}.$$

In your case $X=\Phi(S_T)$ which is a function of $Z_1,...Z_T$. Note also that $S_T = su^Yd^{T-Y}$ where $Y$ is the number of up-moves. The sum above over all outcomes can also be written as in Björk, using binomial coefficients:

$$E^Q[f(Z_1,...,Z_T)] = \sum_{z_1,...,z_T=\text{u or d}} f(z_1,...,z_T)q_{z_1} \cdots q_{z_T} \\ = \sum_{j=0}^T {T \choose j}q_u^j q_d^{T-j}\Phi(su^kd^{T-k})$$.

I hope it all checks out, I'm used to a different notation when working with the Binomial Model!

Shown in full with attribution under the source's licence. Licence: CC BY-SA 4.0 (Stack Exchange)

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.