Finance & Options
A Coin-Flip Tree That Becomes Black-Scholes
Paths that end at the same price fold into one node, so a 252-step tree prices in well under a millisecond, and as the steps shrink its price settles on the Black-Scholes number.
What to remember
- Any fixed and give a recombining tree: final nodes where the path tree has leaves.
- Backward induction: , one average per node, so the work grows like .
- CRR sets and so that steps add up to variance .
- The CRR price zig-zags onto Black-Scholes with error roughly proportional to ; averaging and steps smooths it.
- A path-dependent payoff needs a bigger state, such as (price, running max) for a lookback.
Read the lessonA Coin-Flip Tree That Becomes Black-Scholes, with a checkpoint at the end.