Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 49, No. 6, November-December 2001, pp. 923-937
DOI: 10.1287/opre.49.6.923.10018
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Glasserman, P.
Right arrow Articles by Staum, J.
Right arrow Search for Related Content

Conditioning on One-Step Survival for Barrier Option Simulations

Paul Glasserman, Jeremy Staum

Graduate School of Business, Columbia University, New York, New York 10027
226 Rhodes Hall, Cornell University, Ithaca, New York 14853

pglasser{at}research.gsb.columbia.edu
staum{at}orie.cornell.edu

Pricing financial options often requires Monte Carlo methods. One particular case is that of barrier options, whose payoff may be zero depending on whether or not an underlying asset crosses a barrier during the life of the option. This paper develops variance reduction techniques that take advantage of the special structure of barrier options, and are appropriate for general simulation problems with similar structure. We use a change of measure at each step of the simulation to reduce the variance arising from the possibility of a barrier crossing at each monitoring date. The paper details the theoretical underpinnings of this method, and evaluates alternative implementations when exact distributions conditional on one-step survival are available and when not available. When these one-step conditional distributions are unavailable, we introduce algorithms that combine change of measure and estimation of conditional probabilities simultaneously. The methods proposed are more generally applicable to terminal reward problems on Markov processes with absorbing states.

Subject classifications: Simulation, efficiency: Variance reduction; Finance, asset pricing: Computational methods.






HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.