, Volume 6, Issue 4, pp 449-471

An analysis of a least squares regression method for American option pricing

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

Manuscript received: April 2001; final version received: January 2002