pith. sign in

arxiv: 1303.1334 · v2 · pith:2WSQJC3Tnew · submitted 2013-03-06 · 💱 q-fin.CP

Pricing American options via multi-level approximation methods

classification 💱 q-fin.CP
keywords americanapproximationoptionspricingcomplexitymethodsmulti-levelpropose
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.