| Article ID: | iaor20021547 |
| Country: | United States |
| Volume: | 49 |
| Issue: | 3 |
| Start Page Number: | 372 |
| End Page Number: | 397 |
| Publication Date: | May 2001 |
| Journal: | Operations Research |
| Authors: | Bertsimas Dimitris, Kogan Leonid, Lo Andrew W. |
| Keywords: | programming: dynamic |
Given a European derivative security with an arbitrary payoff function and a corresponding set of underlying securities on which the derivative security is based, we solve the optimal-replication problem: Find a self-financing dynamic portfolio strategy – involving only the underlying securities – that most closely approximates the payoff function at maturity. By applying stochastic dynamic programming to the minimization of a mean-squared error loss function under Markov-state dynamics, we derive recursive expressions for the optimal-replication strategy that are readily implemented in practice. The approximation error or ‘ε’ of the optimal-replication strategy is also given recursively and may be used to quantify the ‘degree’ of market incompleteness. To investigate the practical significance of these ε-arbitrage strategies, we consider several numerical examples, including path-dependent options and options on assets with stochastic volatility and jumps.