Scinovex
articleTop 1% cited

Regression methods for pricing complex American-style options

IEEE Transactions on Neural Networks · 2001 · Vol. 12(4) · pp. 694–703
John N. TsitsiklisBenjamin Van Roy

Abstract

We introduce and analyze a simulation-based approximate dynamic programming method for pricing complex American-style options, with a possibly high-dimensional underlying state space. We work within a finitely parameterized family of approximate value functions, and introduce a variant of value iteration, adapted to this parametric setting. We also introduce a related method which uses a single (parameterized) value function, which is a function of the time-state pair, as opposed to using a separate (independently parameterized) value function for each time. Our methods involve the evaluation of value functions at a finite set, consisting of "representative" elements of the state space. We show that with an arbitrary choice of this set, the approximation error can grow exponentially with the time horizon (time to expiration). On the other hand, if representative states are chosen by simulating the state process using the underlying risk-neutral probability distribution, then the approximation error remains bounded.

Stochastic processes and financial applicationsEconomic theories and modelsCapital Investment and Risk AnalysisParameterized complexityBellman equationState spaceMathematical optimizationComputer scienceFunction (biology)Bounded functionApplied mathematicsFunction approximationMathematics
Citations
638
FWCI
18.14
field-weighted impact
References
28
Percentile
99%
vs. same field & year
Citations per year
Cited by
The Linear Programming Approach to Approximate Dynamic Programming
Operations Research · 2003 · 701 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.