Finance & Options

The Markov Property: How Much of the Past Do You Need?

Under the risk-neutral odds every discounted price is a fair game, and carrying the running maximum in the state turns a path-dependent lookback into a small backward recursion.

What to remember

  • The risk-neutral up-probability q=(1+r−d)/(u−d)q = (1 + r - d)/(u - d) makes the discounted stock Sn/(1+r)nS_n/(1 + r)^n a martingale; the raw price still grows at rr.
  • The discounted wealth of any self-financing portfolio is then a martingale, which rules out arbitrage and gives V0=E~[VN/(1+r)N]V_0 = \tilde E[V_N/(1 + r)^N].
  • A Markov process forecasts from its current state alone, so prices become functions vn(s)v_n(s) computed backward on n+1n + 1 nodes.
  • A lookback depends on the path; the pair (Sn,Mn)(S_n, M_n) is Markov, so price it with vn(s,m)v_n(s, m).
  • The augmented state stays small: 2,601 states at step 100 against 21002^{100} paths.
  • Markov is a property of the chosen state: the P&L In=12Zn2−n2I_n = \tfrac12 Z_n^2 - \tfrac n2 needs only itself, (Sn,Mn)(S_n, M_n) folds 1,024 paths into 36 states, but the Asian's (Sn,Yn)(S_n, Y_n) barely merges (79,680 states at 20 steps against 121 for the lookback).
Read the lessonFair Games and the Markov Property, with a checkpoint at the end.