Robbins–Monro algorithms and variance reduction in finance

Bouhari Arouna

Journal of Computational Finance

Abstract: ABSTRACT 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.

References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.risk.net/journal-of-computational-fina ... reduction-in-finance (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rsk:journ0:2160468

Access Statistics for this article

More articles in Journal of Computational Finance from Journal of Computational Finance
Bibliographic data for series maintained by Thomas Paine ().