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

Pricing American options via multi-level approximation methods

Author

Listed:
  • Denis Belomestny
  • Fabian Dickmann
  • Tigran Nagapetyan

Abstract

In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level low biased estimate for the price of an American option. It turns out that the resulting complexity gain can be rather high and can even reach the order (\varepsilon^{-1}) with (\varepsilon) denoting the desired precision. The performance of the proposed multilevel algorithm is illustrated by a numerical example of pricing Bermudan max-call options.

Suggested Citation

  • Denis Belomestny & Fabian Dickmann & Tigran Nagapetyan, 2013. "Pricing American options via multi-level approximation methods," Papers 1303.1334, arXiv.org, revised Dec 2013.
    • Handle: RePEc:arx:papers:1303.1334
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Denis Belomestny & John Schoenmakers & Fabian Dickmann, 2013. "Multilevel dual approach for pricing American style derivatives," Finance and Stochastics, Springer, vol. 17(4), pages 717-742, October.
    3. Denis Belomestny, 2009. "Pricing Bermudan options using nonparametric regression: optimal rates of convergence for lower estimates," Papers 0907.5599, arXiv.org.
    4. 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.
    5. 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.
    6. Michael B. Giles, 2008. "Multilevel Monte Carlo Path Simulation," Operations Research, INFORMS, vol. 56(3), pages 607-617, June.
    7. Denis Belomestny, 2011. "Pricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimates," Finance and Stochastics, Springer, vol. 15(4), pages 655-683, December.
    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. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    2. Christian Bayer & Juho Happola & Ra'ul Tempone, 2017. "Implied Stopping Rules for American Basket Options from Markovian Projection," Papers 1705.00558, arXiv.org, revised Jun 2017.
    3. Ankush Agarwal & Sandeep Juneja, 2015. "Nearest Neighbor Based Estimation Technique for Pricing Bermudan Options," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-31.
    4. Fabozzi, Frank J. & Paletta, Tommaso & Tunaru, Radu, 2017. "An improved least squares Monte Carlo valuation method based on heteroscedasticity," European Journal of Operational Research, Elsevier, vol. 263(2), pages 698-706.
    5. Michael Ludkovski, 2015. "Kriging Metamodels and Experimental Design for Bermudan Option Pricing," Papers 1509.02179, arXiv.org, revised Oct 2016.

    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. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    2. Sebastian Becker & Patrick Cheridito & Arnulf Jentzen & Timo Welti, 2019. "Solving high-dimensional optimal stopping problems using deep learning," Papers 1908.01602, arXiv.org, revised Aug 2021.
    3. Jérôme Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Working Papers hal-01983115, HAL.
    4. Pascal Létourneau & Lars Stentoft, 2019. "Bootstrapping the Early Exercise Boundary in the Least-Squares Monte Carlo Method," JRFM, MDPI, vol. 12(4), pages 1-21, December.
    5. Fabozzi, Frank J. & Paletta, Tommaso & Tunaru, Radu, 2017. "An improved least squares Monte Carlo valuation method based on heteroscedasticity," European Journal of Operational Research, Elsevier, vol. 263(2), pages 698-706.
    6. Zhiyi Shen & Chengguo Weng, 2019. "A Backward Simulation Method for Stochastic Optimal Control Problems," Papers 1901.06715, arXiv.org.
    7. Wei, Wei & Zhu, Dan, 2022. "Generic improvements to least squares monte carlo methods with applications to optimal stopping problems," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1132-1144.
    8. Nan Chen & Yanchu Liu, 2014. "American Option Sensitivities Estimation via a Generalized Infinitesimal Perturbation Analysis Approach," Operations Research, INFORMS, vol. 62(3), pages 616-632, June.
    9. 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.
    10. Mark S. Joshi, 2016. "Analysing the bias in the primal-dual upper bound method for early exercisable derivatives: bounds, estimation and removal," Quantitative Finance, Taylor & Francis Journals, vol. 16(4), pages 519-533, April.
    11. Ruimeng Hu, 2019. "Deep Learning for Ranking Response Surfaces with Applications to Optimal Stopping Problems," Papers 1901.03478, arXiv.org, revised Mar 2020.
    12. Denis Belomestny & G. Milstein & John Schoenmakers, 2010. "Sensitivities for Bermudan options by regression methods," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 33(2), pages 117-138, November.
    13. 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.
    14. Denis Belomestny & John Schoenmakers & Fabian Dickmann, 2013. "Multilevel dual approach for pricing American style derivatives," Finance and Stochastics, Springer, vol. 17(4), pages 717-742, October.
    15. Stentoft, Lars, 2005. "Pricing American options when the underlying asset follows GARCH processes," Journal of Empirical Finance, Elsevier, vol. 12(4), pages 576-611, September.
    16. 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.
    17. Calypso Herrera & Florian Krach & Pierre Ruyssen & Josef Teichmann, 2021. "Optimal Stopping via Randomized Neural Networks," Papers 2104.13669, arXiv.org, revised Dec 2023.
    18. Rongju Zhang & Nicolas Langren'e & Yu Tian & Zili Zhu & Fima Klebaner & Kais Hamza, 2018. "Local Control Regression: Improving the Least Squares Monte Carlo Method for Portfolio Optimization," Papers 1803.11467, arXiv.org, revised Sep 2018.
    19. Gilles Pag`es & Benedikt Wilbertz, 2011. "GPGPUs in computational finance: Massive parallel computing for American style options," Papers 1101.3228, arXiv.org.
    20. Lokman A. Abbas-Turki & Stéphane Crépey & Babacar Diallo, 2018. "Xva Principles, Nested Monte Carlo Strategies, And Gpu Optimizations," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 21(06), pages 1-40, September.

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