Cox, Ross & Rubinstein (1979) discretised the continuous Black-Scholes diffusion into a recombining binomial tree with up-factor $u$, down-factor $d$, and risk-neutral probability $p$. The tree prices European and American options by backwards induction, converges to Black-Scholes as the number of steps grows, and needs no PDE solver. For practitioners, it is the simplest non-trivial pricing engine that handles early exercise — something Black-Scholes cannot do.
Discrete tree, risk-neutral probabilities, backwards induction
| Symbol | Meaning |
|---|---|
| $N$ | Number of time steps |
| $\Delta t$ | Step size, $\Delta t = T/N$ |
| $u$ | Up-move factor per step |
| $d$ | Down-move factor per step; $d = 1/u$ in CRR |
| $p$ | Risk-neutral up-probability |
| $S_{n,j}$ | Underlying price at node $(n,j)$: $n$ steps, $j$ up-moves |
| $V_{n,j}$ | Option value at node $(n,j)$ |
At maturity ($n = N$), option value equals payoff: $V_{N,j} = g(S_{N,j})$ where $g(S) = (S-K)^+$ for a call, $(K-S)^+$ for a put. Step backward from $n=N-1$ to $n=0$:
As $N \to \infty$, the CRR tree converges to the Black-Scholes price at rate $O(1/N)$ (Leisen & Reimer 1996 give $O(1/N^2)$ for improved tree parameters). Practical values: $N = 100$ gives 3-4 decimal places of accuracy; $N = 10^4$ reaches machine precision for European options but takes quadratic memory without sparse tricks.
Visualise the lattice and price convergence; compare to Black-Scholes
Each node is labelled with the underlying price $S_{n,j}$. Node colour intensity encodes option value at that node (gold = high, dim = low).
Convergence: CRR European price as a function of $N$, with the Black-Scholes price as a horizontal reference. American prices appear above the BS line (early-exercise premium).
When binomial beats Black-Scholes — and when it doesn’t
Seminal papers and extensions
The two continuous-time pricing engines and one stochastic method.