We investigate a new method for pricing high-dimensional American options. The method is of finite difference type but is also related to Monte Carlo techniques in that it involves a representative sampling of the underlying variables. An approximating Markov chain is built using this sampling and linear programming is used to satisfy local consistency conditions at each point related to the infinitesimal generator or transition density. The algorithm for constructing the matrix can be parallelised easily; moreover once it has been obtained it can be reused to generate quick solutions for a large class of related problems. We provide pricing results for geometric average options in up to ten dimensions, and compare these with accurate benchmarks.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
19.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: