IDEAS home Printed from https://ideas.repec.org/a/wsi/ijtafx/v08y2005i05ns0219024905003177.html
   My bibliography  Save this article

Localized Monte Carlo Algorithm To Compute Prices Of Path Dependent Options On Trees

Author

Listed:
  • SEBASTIAN E. FERRANDO

    (Department of Mathematics, Physics and Computer Science, Ryerson University, 350 Victoria St., Toronto, Ontario M5B 2K3, Canada)

  • ARIEL J. BERNAL

    (Department of Computer Science, Caece University, Olavarria 2464, Mar del Plata 7600, Argentina)

Abstract

A new simulation based algorithm to approximate prices of path dependent European options is introduced. The algorithm is defined for tree-like approximations to the underlying process and makes extensive use of structural properties of the discrete approximation. We indicate the advantages of the new algorithm in comparison to standard Monte Carlo algorithms. In particular, we prove a probabilistic error bound that compares the quality of both approximations. The algorithm is of general applicability and, for a large class of options, it has the same computational complexity as Monte Carlo.

Suggested Citation

  • Sebastian E. Ferrando & Ariel J. Bernal, 2005. "Localized Monte Carlo Algorithm To Compute Prices Of Path Dependent Options On Trees," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 8(05), pages 553-574.
    • Handle: RePEc:wsi:ijtafx:v:08:y:2005:i:05:n:s0219024905003177
    DOI: 10.1142/S0219024905003177
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219024905003177
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219024905003177?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:ijtafx:v:08:y:2005:i:05:n:s0219024905003177. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijtaf/ijtaf.shtml .

    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.