IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01983115.html
   My bibliography  Save this paper

Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach

Author

Listed:
  • Jérôme Lelong

    (DAO - Données, Apprentissage et Optimisation - LJK - Laboratoire Jean Kuntzmann - Inria - Institut National de Recherche en Informatique et en Automatique - CNRS - Centre National de la Recherche Scientifique - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes)

Abstract

In this work, we propose a new policy iteration algorithm for pricing Bermudan options when the payoff process cannot be written as a function of a lifted Markov process. Our approach is based on a modification of the well-known Longstaff Schwartz algorithm, in which we basically replace the standard least square regression by a Wiener chaos expansion. Not only does it allow us to deal with a non Markovian setting, but it also breaks the bottleneck induced by the least square regression as the coefficients of the chaos expansion are given by scalar products on the L^2 space and can therefore be approximated by independent Monte Carlo computations. This key feature enables us to provide an embarrassingly parallel algorithm.

Suggested Citation

  • Jérôme Lelong, 2020. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Post-Print hal-01983115, HAL.
    • Handle: RePEc:hal:journl:hal-01983115
    DOI: 10.21314/JCF.2020.394
    Note: View the original document on HAL open archive server: https://hal.univ-grenoble-alpes.fr/hal-01983115v2
    as

    Download full text from publisher

    File URL: https://hal.univ-grenoble-alpes.fr/hal-01983115v2/document
    Download Restriction: no
    File URL: https://libkey.io/10.21314/JCF.2020.394?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
    ---><---

    References listed on IDEAS

    as
    1. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," The Review of Financial Studies, Society for Financial Studies, vol. 14(1), pages 113-147.
    2. Carriere, Jacques F., 1996. "Valuation of the early-exercise price for options using simulations and nonparametric regression," Insurance: Mathematics and Economics, Elsevier, vol. 19(1), pages 19-30, December.
    3. Gilles Pagès & Olivier Pironneau & Guillaume Sall, 2016. "The Parareal Algorithm for American Options [La méthode pararéelle pour les options américaines]," Post-Print hal-01320331, HAL.
    4. repec:dau:papers:123456789/4273 is not listed on IDEAS
    5. repec:dau:papers:123456789/11984 is not listed on IDEAS
    6. Jérôme Lelong, 2018. "Dual pricing of American options by Wiener chaos expansion," Post-Print hal-01299819, HAL.
    7. Philip Protter & Emmanuelle Clément & Damien Lamberton, 2002. "An analysis of a least squares regression method for American option pricing," Finance and Stochastics, Springer, vol. 6(4), pages 449-471.
    8. Doan, Viet_Dung & Gaikwad, Abhijeet & Bossy, Mireille & Baude, Françoise & Stokes-Rees, Ian, 2010. "Parallel pricing algorithms for multi-dimensional Bermudan/American options using Monte Carlo methods," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 81(3), pages 568-577.
    9. Gilles Pages & Olivier Pironneau & Guillaume Sall, 2016. "The Parareal Algorithm for American Options
      [La méthode pararéelle pour les options américaines]      ," Working Papers hal-01320331, HAL.
    10. Gilles Pag`es & Benedikt Wilbertz, 2011. "GPGPUs in computational finance: Massive parallel computing for American style options," Papers 1101.3228, arXiv.org.
    11. Longstaff, Francis A & Schwartz, Eduardo S, 2001. "Valuing American Options by Simulation: A Simple Least-Squares Approach," University of California at Los Angeles, Anderson Graduate School of Management qt43n1k4jb, Anderson Graduate School of Management, UCLA.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Henrique Guerreiro & Jo~ao Guerra, 2021. "Least squares Monte Carlo methods in stochastic Volterra rough volatility models," Papers 2105.04511, arXiv.org.
    2. Henrique Guerreiro & João Guerra, 2021. "Least squares Monte Carlo methods in stochastic Volterra rough volatility models," Working Papers REM 2021/0176, ISEG - Lisbon School of Economics and Management, REM, Universidade de Lisboa.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jérôme Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Working Papers hal-01983115, HAL.
    2. J'er^ome Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Papers 1901.05672, arXiv.org, revised Jul 2020.
    3. Zineb El Filali Ech-Chafiq & Pierre Henry-Labordere & Jérôme Lelong, 2021. "Pricing Bermudan options using regression trees/random forests," Working Papers hal-03436046, HAL.
    4. Denis Belomestny & Grigori Milstein & Vladimir Spokoiny, 2009. "Regression methods in pricing American and Bermudan options using consumption processes," Quantitative Finance, Taylor & Francis Journals, vol. 9(3), pages 315-327.
    5. Ikefuji, Masako & Laeven, Roger J.A. & Magnus, Jan R. & Muris, Chris, 2020. "Expected utility and catastrophic risk in a stochastic economy–climate model," Journal of Econometrics, Elsevier, vol. 214(1), pages 110-129.
    6. Ammann, Manuel & Kind, Axel & Wilde, Christian, 2008. "Simulation-based pricing of convertible bonds," Journal of Empirical Finance, Elsevier, vol. 15(2), pages 310-331, March.
    7. S'ergio C. Bezerra & Alberto Ohashi & Francesco Russo & Francys de Souza, 2017. "Discrete-type approximations for non-Markovian optimal stopping problems: Part II," Papers 1707.05250, arXiv.org, revised Dec 2019.
    8. Calypso Herrera & Louis Paulot, 2014. "Parallel American Monte Carlo," Papers 1404.1180, arXiv.org.
    9. Katarzyna Toporek, 2012. "Simple is better. Empirical comparison of American option valuation methods," Ekonomia journal, Faculty of Economic Sciences, University of Warsaw, vol. 29.
    10. Michael A. Kouritzin & Anne Mackay, 2020. "Branching Particle Pricers With Heston Examples," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 23(01), pages 1-29, February.
    11. Burcu Aydoğan & Ümit Aksoy & Ömür Uğur, 2018. "On the methods of pricing American options: case study," Annals of Operations Research, Springer, vol. 260(1), pages 79-94, January.
    12. Zhiyi Shen & Chengguo Weng, 2019. "A Backward Simulation Method for Stochastic Optimal Control Problems," Papers 1901.06715, arXiv.org.
    13. Jérôme Lelong, 2016. "Dual pricing of American options by Wiener chaos expansion," Working Papers hal-01299819, HAL.
    14. Axel Kind, 2005. "Pricing American-Style Options By Simulation," Financial Markets and Portfolio Management, Springer;Swiss Society for Financial Market Research, vol. 19(1), pages 109-116, June.
    15. Christian Fries, 2005. "The Foresight Bias in Monte-Carlo Pricing of Options with Early," Finance 0511002, University Library of Munich, Germany, revised 08 Nov 2005.
    16. Joseph Y. J. Chow & Hamid R. Sayarshad, 2016. "Reference Policies for Non-myopic Sequential Network Design and Timing Problems," Networks and Spatial Economics, Springer, vol. 16(4), pages 1183-1209, December.
    17. Zhongkai Liu & Tao Pang, 2016. "An efficient grid lattice algorithm for pricing American-style options," International Journal of Financial Markets and Derivatives, Inderscience Enterprises Ltd, vol. 5(1), pages 36-55.
    18. Zineb El Filali Ech-Chafiq & Pierre Henry Labordère & Jérôme Lelong, 2023. "Pricing Bermudan options using regression trees/random forests," Post-Print hal-03436046, HAL.
    19. Maximilian Mair & Jan Maruhn, 2013. "On the primal-dual algorithm for callable Bermudan options," Review of Derivatives Research, Springer, vol. 16(1), pages 79-110, April.
    20. Sérgio C. Bezerra & Alberto Ohashi & Francesco Russo & Francys Souza, 2020. "Discrete-type Approximations for Non-Markovian Optimal Stopping Problems: Part II," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 1221-1255, September.

    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:hal:journl:hal-01983115. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.