Multilevel dual approach for pricing American style derivatives
Please always quote using this URN:urn:nbn:de:0296-matheon-10176
- In this article we propose a novel approach to reduce the computational complexity of the dual method for pricing American options. We consider a sequence of martingales that converges to a given target martingale and decompose the original dual representation into a sum of representations that correspond to di� erent levels of approximation to the target martingale. By next replacing in each representation true conditional expectations with their Monte Carlo estimates, we arrive at what one may call a multilevel dual Monte Carlo algorithm. The analysis of this algorithm reveals that the computational complexity of getting the corresponding target upper bound, due to the target martingale, can be signi� cantly reduced. In particular, it turns out that using our new approach, we may construct a multilevel version of the well-known nested Monte Carlo algorithm of Andersen and Broadie (2004) that is, regarding complexity, virtually equivalent to a non-nested algorithm. The performance of this multilevel algorithm is illustrated by a numerical example.
Author: | Denis Belomestny, John Schoenmakers |
---|---|
URN: | urn:nbn:de:0296-matheon-10176 |
Referee: | Dirk Becherer |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2012/01/27 |
Release Date: | 2012/01/27 |
Institute: | Weierstraß-Institut für Angewandte Analysis und Stochastik (WIAS) |
MSC-Classification: | 65-XX NUMERICAL ANALYSIS / 65Cxx Probabilistic methods, simulation and stochastic differential equations (For theoretical aspects, see 68U20 and 60H35) / 65C05 Monte Carlo methods |
Preprint Number: | 899 |