An analysis of a least squares regression method for American option pricing
Recently, various authors proposed Monte-Carlo methods for the computation of American option prices, based on least squares regression. The purpose of this paper is to analyze an algorithm due to Longstaff and Schwartz. This algorithm involves two types of approximation. Approximation one: replace the conditional expectations in the dynamic programming principle by projections on a finite set of functions. Approximation two: use Monte-Carlo simulations and least squares regression to compute the value function of approximation one. Under fairly general conditions, we prove the almost sure convergence of the complete algorithm. We also determine the rate of convergence of approximation two and prove that its normalized error is asymptotically Gaussian.
Volume (Year): 6 (2002)
Issue (Month): 4 ()
|Note:||received: April 2001; final version received: January 2002|
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/mathematics/quantitative+finance/journal/780/PS2|
When requesting a correction, please mention this item's handle: RePEc:spr:finsto:v:6:y:2002:i:4:p:449-471. See general 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.