On the Stability the Least Squares Monte Carlo
AbstractConsider Least Squares Monte Carlo (LSM) algorithm, which is proposed by Longstaff and Schwartz (2001) for pricing American style securities. This algorithm is based on the projection of the value of continuation onto a certain set of basis functions via the least squares problem. We analyze the stability of the algorithm when the number of exercise dates increases and prove that, if the underlying process for the stock price is continuous, then the regression problem is ill-conditioned for small values of the time parameter.
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.
Bibliographic InfoPaper provided by arXiv.org in its series Papers with number 1102.3218.
Date of creation: Feb 2011
Date of revision: Jul 2011
Contact details of provider:
Web page: http://arxiv.org/
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If references are entirely missing, you can add them using this form.