Journal of Computational Finance

Robbins–Monro algorithms and variance reduction in finance

Bouhari Arouna


In this article we present a variance-reduction technique for Monte Carlo methods. By an elementary version of the Girsanov theorem, we introduce a drift term into the computation of a security's price via Monte Carlo simulation. Subsequently, the basic idea is to use a truncated version of the Robbins–Monro algorithms to find the optimal drift that reduces the variance. We prove that, for a large class of payoff functions, this version of the Robbins–Monro algorithms converges a.s. to the optimal drift. Finally, we illustrate the method by applications to options pricing.

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 View our subscription options

You need to sign in to use this feature. If you don’t have a 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