Binomial Tree Model - American Options Pricing
Last reviewed: by Options Analysis Suite Research.
What Is the Binomial Tree Model?
The binomial model is a discrete-time approximation to continuous-time options pricing,
introduced by Cox, Ross, and Rubinstein in 1979. The underlying is modeled as a recombining
tree where, at each step, the price either moves up by a factor u or down by
a factor d. Risk-neutral probabilities p and 1-p
are chosen so that the expected return matches the risk-free rate. As the number of steps
grows, the binomial price converges to Black-Scholes.
The binomial model's defining strength is that it handles American exercise naturally. At every node in the tree you can compare the value of holding versus the value of exercising immediately. The option's price at that node is simply the maximum. This makes the binomial tree the canonical numerical method for American options on dividend-paying stocks, where early exercise can be optimal.
The CRR Parameterization
u = e^(σ·√Δt): up factor, set so that the variance per step matches σ.d = 1/u: down factor, ensuring the tree is symmetric in log-space and recombines.p = (e^(r·Δt) − d) / (u − d): risk-neutral up probability.
Variants like Jarrow-Rudd and Tian use slightly different parameterizations to improve convergence behaviour, particularly for OTM options or near barriers.
What Does the Binomial Tree Capture?
- American exercise on any underlying, including dividend-paying stocks where early exercise of calls just before ex-dividend can be optimal.
- Discrete dividends: model the dividend as a known cash flow at a specific time and adjust the tree accordingly.
- Bermudan exercise: restrict early exercise to a discrete set of dates rather than continuous.
- Path-independent exotics like compound options where the standard binomial roll-back works.
What Doesn't the Binomial Tree Capture?
- Path-dependent payoffs (Asians, lookbacks, barriers with continuous monitoring): the tree's recombining structure breaks under path dependence; non-recombining trees grow exponentially.
- Stochastic volatility: vanilla binomial uses constant σ. Trinomial trees with stochastic vol exist but are heavier than just running PDE or Monte Carlo.
- Jumps: same continuous-path limitation as Black-Scholes.
Convergence
Binomial trees converge to Black-Scholes at order 1/N in the number of steps,
with oscillatory behaviour near at-the-money and around barriers. For pricing a typical
American option, 200-500 steps gives reasonable accuracy; 1000+ for tighter convergence.
Smoothing methods (Broadie-Detemple) and control variates can improve this materially.
When Should You Use the Binomial Tree?
- American calls on dividend-paying stocks where early exercise can be optimal.
- American puts where the optimal early-exercise boundary is the whole point.
- Bermudan exotics with a fixed schedule of exercise dates.
- Sanity-checking analytical pricers: the binomial tree converges to Black-Scholes for European options as a built-in test.
When Should You Not Use the Binomial Tree?
- Path-dependent exotics: Monte Carlo or PDE methods are better tools.
- Smile-aware pricing: binomial uses constant σ; if you need a smile, calibrate Heston/SABR/LV and price from the calibrated surface.
- Speed-critical pricing of vanilla Europeans: Black-Scholes closed-form is faster.
Trinomial Trees and Other Lattice Methods
Beyond the binomial tree, lattice methods include trinomial trees (where the underlying can move up, down, or stay flat at each step) and explicit-time-step finite-difference lattices that approximate PDE solutions. Trinomial trees converge faster than binomial for the same number of nodes because the additional middle branch reduces the effective grid spacing. Adaptive-mesh trees concentrate nodes near the strike and barriers to improve accuracy where it matters most. For most retail use cases, the standard Cox-Ross-Rubinstein binomial tree is sufficient; the more sophisticated lattice methods are mostly relevant for institutional pricing of exotic American-style products.
The Linear Complementarity Formulation
For American options, at each node in the tree the option value is the maximum of two quantities: (a) the discounted expected continuation value computed by rolling back from the next time step, and (b) the immediate exercise value (intrinsic). The optimal exercise policy chooses the larger at each node, which produces a linear complementarity problem (LCP) when the discrete-time formulation is interpreted as a constrained optimization. The binomial tree solves the LCP node-by-node working backward from expiration; PDE solvers solve a similar LCP in continuous time using projected SOR or penalty methods. The early-exercise boundary (the curve in (spot, time) space that separates "hold" from "exercise") emerges naturally from this dynamic programming.
How OAS Uses the Binomial Tree
The platform exposes the binomial tree as one of the supported model surfaces, primarily for American-style pricing where early exercise can be optimal. It's also the cross-check pricer used internally to validate Black-Scholes and Heston outputs on European equivalents. Convergence of the tree to the analytical price is a sanity-test gate on every model release. The platform's binomial implementation uses the standard CRR parameterization with configurable step counts; users who want tighter convergence can increase the step count at the cost of compute time. For research, the Python SDK exposes the full binomial tree node values so users can inspect the early-exercise boundary directly.
Use binomial pricing in the calculator
Related Concepts
Black-Scholes (vs) · PDE Methods (vs) · Monte Carlo · Heston · Greeks Reference · Calibration · Model Divergence · Model Landscape
Try this model in the pricing calculator
This section is part of the Options Analysis Suite Documentation. Browse the full model index or compare alternatives in the pricing calculator.