IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0904.1157.html
   My bibliography  Save this paper

Addressing the bias in Monte Carlo pricing of multi-asset options with multiple barriers through discrete sampling

Author

Listed:
  • P. V. Shevchenko

Abstract

An efficient conditioning technique, the so-called Brownian Bridge simulation, has previously been applied to eliminate pricing bias that arises in applications of the standard discrete-time Monte Carlo method to evaluate options written on the continuous-time extrema of an underlying asset. It is based on the simple and easy to implement analytic formulas for the distribution of one-dimensional Brownian Bridge extremes. This paper extends the technique to the valuation of multi-asset options with knock-out barriers imposed for all or some of the underlying assets. We derive formula for the unbiased option price estimator based on the joint distribution of the multi-dimensional Brownian Bridge dependent extrema. As analytic formulas are not available for the joint distribution in general, we develop upper and lower biased option price estimators based on the distribution of independent extrema and the Fr\'echet lower and upper bounds for the unknown distribution. All estimators are simple and easy to implement. They can always be used to bind the true value by a confidence interval. Numerical tests indicate that our biased estimators converge rapidly to the true option value as the number of time steps for the asset path simulation increases in comparison to the estimator based on the standard discrete-time method. The convergence rate depends on the correlation and barrier structures of the underlying assets.

Suggested Citation

  • P. V. Shevchenko, 2009. "Addressing the bias in Monte Carlo pricing of multi-asset options with multiple barriers through discrete sampling," Papers 0904.1157, arXiv.org.
  • Handle: RePEc:arx:papers:0904.1157
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0904.1157
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:0904.1157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.