Convergence of a Least-Squares Monte Carlo Algorithm for Bounded Approximating Sets
AbstractWe analyse the convergence properties of the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems that arise in the pricing of American (Bermudan) financial options. Based on a new approximate dynamic programming principle error propagation inequality, we prove sample complexity error estimates for this algorithm for the case in which the corresponding approximation spaces may not necessarily possess any linear structure at all and may actually be any arbitrary sets of functions, each of which is uniformly bounded and possesses finite VC-dimension, but is not required to satisfy any further material conditions. In particular, we do not require that the approximation spaces be convex or closed, and we thus significantly generalize the results of Egloff, Clement et al., and others. Using our error estimation theorems, we also prove convergence, up to any desired probability, of the algorithm for approximating sets defined using L2 orthonormal bases, within a framework depending subexponentially on the number of time steps. In addition, we prove estimates on the overall convergence rate of the algorithm for approximation spaces defined by polynomials.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Taylor & Francis Journals in its journal Applied Mathematical Finance.
Volume (Year): 16 (2009)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.tandfonline.com/RAMF20
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Maciej Klimek & Marcin Pitera, 2014. "The least squares method for option pricing revisited," Papers 1404.7438, arXiv.org, revised May 2014.
- Daniel Zanger, 2013. "Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing," Finance and Stochastics, Springer, vol. 17(3), pages 503-534, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty).
If references are entirely missing, you can add them using this form.