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

Machine learning methods for American-style path-dependent contracts

Author

Listed:
  • Matteo Gambara
  • Giulia Livieri
  • Andrea Pallavicini

Abstract

In the present work, we introduce and compare state-of-the-art algorithms, that are now classified under the name of machine learning, to price Asian and look-back products with early-termination features. These include randomized feed-forward neural networks, randomized recurrent neural networks, and a novel method based on signatures of the underlying price process. Additionally, we explore potential applications on callable certificates. Furthermore, we present an innovative approach for calculating sensitivities, specifically Delta and Gamma, leveraging Chebyshev interpolation techniques.

Suggested Citation

  • Matteo Gambara & Giulia Livieri & Andrea Pallavicini, 2023. "Machine learning methods for American-style path-dependent contracts," Papers 2311.16762, arXiv.org.
    • Handle: RePEc:arx:papers:2311.16762
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Thompson, Andrew C., 1995. "Valuation of Path-Dependent Contingent Claims with Multiple Exercise Decisions over Time: The Case of Take-or-Pay," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 30(2), pages 271-293, June.
    2. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen, 2019. "Pricing and hedging American-style options with deep learning," Papers 1912.11060, arXiv.org, revised Jul 2020.
    3. Dai, Min & Li, Peifan & Zhang, Jin E., 2010. "A lattice algorithm for pricing moving average barrier options," Journal of Economic Dynamics and Control, Elsevier, vol. 34(3), pages 542-554, March.
    Full references (including those not matched with items on IDEAS)

    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. Dong, Wenfeng & Kang, Boda, 2019. "Analysis of a multiple year gas sales agreement with make-up, carry-forward and indexation," Energy Economics, Elsevier, vol. 79(C), pages 76-96.
    2. E. Nasakkala & J. Keppo, 2008. "Hydropower with Financial Information," Applied Mathematical Finance, Taylor & Francis Journals, vol. 15(5-6), pages 503-529.
    3. Soren Christensen & Albrecht Irle & Stephan Jurgens, 2012. "Optimal multiple stopping with random waiting times," Papers 1205.1966, arXiv.org.
    4. Hainaut, Donatien & Akbaraly, Adnane, 2023. "Risk management with Local Least Squares Monte-Carlo," LIDAM Discussion Papers ISBA 2023003, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    5. Calypso Herrera & Florian Krach & Pierre Ruyssen & Josef Teichmann, 2021. "Optimal Stopping via Randomized Neural Networks," Papers 2104.13669, arXiv.org, revised Dec 2023.
    6. John Ery & Loris Michel, 2021. "Solving optimal stopping problems with Deep Q-Learning," Papers 2101.09682, arXiv.org, revised Jun 2024.
    7. Raimund M. Kovacevic, 2019. "Valuation and pricing of electricity delivery contracts: the producer’s view," Annals of Operations Research, Springer, vol. 275(2), pages 421-460, April.
    8. Liu, Xiaoran & Ronn, Ehud I., 2020. "Using the binomial model for the valuation of real options in computing optimal subsidies for Chinese renewable energy investments," Energy Economics, Elsevier, vol. 87(C).
    9. M. Dahlgren, 2005. "A Continuous Time Model to Price Commodity-Based Swing Options," Review of Derivatives Research, Springer, vol. 8(1), pages 27-47, June.
    10. Goudenège, Ludovic & Molent, Andrea & Zanette, Antonino, 2022. "Moving average options: Machine learning and Gauss-Hermite quadrature for a double non-Markovian problem," European Journal of Operational Research, Elsevier, vol. 303(2), pages 958-974.
    11. Pflug, Georg C. & Broussev, Nikola, 2009. "Electricity swing options: Behavioral models and pricing," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1041-1050, September.
    12. Lukas Gonon, 2024. "Deep neural network expressivity for optimal stopping problems," Finance and Stochastics, Springer, vol. 28(3), pages 865-910, July.
    13. Deng, S.J. & Oren, S.S., 2006. "Electricity derivatives and risk management," Energy, Elsevier, vol. 31(6), pages 940-953.
    14. repec:dau:papers:123456789/11439 is not listed on IDEAS
    15. Ivan Guo & Nicolas Langren'e & Jiahao Wu, 2023. "Simultaneous upper and lower bounds of American option prices with hedging via neural networks," Papers 2302.12439, arXiv.org, revised Apr 2024.
    16. Ludovic Gouden`ege & Andrea Molent & Antonino Zanette, 2021. "Moving average options: Machine Learning and Gauss-Hermite quadrature for a double non-Markovian problem," Papers 2108.11141, arXiv.org.
    17. Ludovic Gouden`ege & Andrea Molent & Antonino Zanette, 2023. "Backward Hedging for American Options with Transaction Costs," Papers 2305.06805, arXiv.org, revised Jun 2023.
    18. Corinne Chaton & Laure Durand‐Viel, 2013. "Real Asset Valuation under Imperfect Competition: Can We Forget About Market Fundamentals?," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 22(1), pages 125-139, March.
    19. Ling Lu & Wei Xu & Zhehui Qian, 2017. "Efficient willow tree method for European-style and American-style moving average barrier options pricing," Quantitative Finance, Taylor & Francis Journals, vol. 17(6), pages 889-906, June.
    20. Rajnish Kamat & Shmuel S. Oren, 2002. "Exotic Options for Interruptible Electricity Supply Contracts," Operations Research, INFORMS, vol. 50(5), pages 835-850, October.
    21. Marie Bernhart & Peter Tankov & Xavier Warin, 2010. "A finite dimensional approximation for pricing moving average options," Papers 1011.3599, arXiv.org.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2311.16762. 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: 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.