Pricing American options via multi-level approximation methods
In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level low biased estimate for the price of an American option. It turns out that the resulting complexity gain can be rather high and can even reach the order (\varepsilon^{-1}) with (\varepsilon) denoting the desired precision. The performance of the proposed multilevel algorithm is illustrated by a numerical example of pricing Bermudan max-call options.
Year of publication: |
2013-03
|
---|---|
Authors: | Belomestny, Denis ; Dickmann, Fabian ; Nagapetyan, Tigran |
Institutions: | arXiv.org |
Saved in:
Saved in favorites
Similar items by person
-
Variance reduced multilevel path simulation: going beyond the complexity $\varepsilon^{-2}$
Belomestny, Denis, (2014)
-
Multilevel path simulation for weak approximation schemes
Belomestny, Denis, (2014)
-
Multilevel dual approach for pricing American style derivatives
Belomestny, Denis, (2013)
- More ...