Abstract

In this paper we are interested in Monte Carlo pricing of American options via the Longstaff–Schwartz algorithm. In particular, we show that it is possible to obtain a variance reduction technique based on importance sampling by means of Girsanov theorem. The almost sure convergence of the modified algorithm and a central limit theorem were proved. Here, we summarise the theoretical results and some numerical outcomes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call