Journal of Computational Finance

Risk.net

American options and the LSM algorithm: quasi-random sequences and Brownian bridges

Suneal K. Chaudhary

ABSTRACT

The least-squares Monte Carlo (LSM) algorithm of Longstaff and Schwartz (2001) is a method for Monte Carlo valuation of the price of American options. We use quasi-random sequences to generate asset prices which follow geometric Brownian motions, and obtain a significant increase in the rate of convergence of American min-puts and American–Bermuda–Asian calls. Using the Brownian-bridge formula, we present a method for reducing the memory requirements from O(N ×M × d) to O(Nd log(M)) for quasi-random sequences, where N is the number of paths, M is the number of timesteps and d is the number of assets, for example, in a min-put.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to Risk.net? View our subscription options

If you already have an account, please sign in here.

You need to sign in to use this feature. If you don’t have a Risk.net account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here: