IDEAS home Printed from https://ideas.repec.org/a/bpj/strimo/v26y2009i4p275-288n3.html
   My bibliography  Save this article

Upper bounds for Bermudan options on Markovian data using nonparametric regression and a reduced number of nested Monte Carlo steps

Author

Listed:
  • Kohler Michael

    (Technische Universit¨at Darmstadt, Fachbereich Mathematik, Darmstadt, Deutschland)

  • Krzyzak Adam
  • Walk Harro

    (Universität Stuttgart, Institute of Stochastics and Applications, Stuttgart, Deutschland)

Abstract

This paper is concerned with evaluation of American options in discrete time, also called Bermudan options. We use the dual approach to derive upper bounds on the price of such options using only a reduced number of nested Monte Carlo steps. The key idea is to apply nonparametric regression to estimate continuation values and all other required conditional expectations and to combine the resulting estimate with another estimate computed by using only a reduced number of nested Monte Carlo steps. The expectation of the resulting estimate is an upper bound on the option price. It is shown that the estimates of the option prices are universally consistent, i.e., they converge to the true price regardless of the structure of the continuation values. The finite sample behavior is validated by experiments on simulated data.

Suggested Citation

  • Kohler Michael & Krzyzak Adam & Walk Harro, 2009. "Upper bounds for Bermudan options on Markovian data using nonparametric regression and a reduced number of nested Monte Carlo steps," Statistics & Risk Modeling, De Gruyter, vol. 26(4), pages 275-288, July.
  • Handle: RePEc:bpj:strimo:v:26:y:2009:i:4:p:275-288:n:3
    DOI: 10.1524/stnd.2008.1014
    as

    Download full text from publisher

    File URL: https://doi.org/10.1524/stnd.2008.1014
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1524/stnd.2008.1014?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.

    References listed on IDEAS

    as
    1. Leif Andersen & Mark Broadie, 2004. "Primal-Dual Simulation Algorithm for Pricing Multidimensional American Options," Management Science, INFORMS, vol. 50(9), pages 1222-1234, September.
    2. 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.
    3. Denis Belomestny & Christian Bender & John Schoenmakers, 2009. "True Upper Bounds For Bermudan Products Via Non‐Nested Monte Carlo," Mathematical Finance, Wiley Blackwell, vol. 19(1), pages 53-71, January.
    4. Martin B. Haugh & Leonid Kogan, 2004. "Pricing American Options: A Duality Approach," Operations Research, INFORMS, vol. 52(2), pages 258-270, April.
    5. Nan Chen & Paul Glasserman, 2007. "Additive and multiplicative duals for American option pricing," Finance and Stochastics, Springer, vol. 11(2), pages 153-179, April.
    6. 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)

    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. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    2. John Schoenmakers, 2012. "A pure martingale dual for multiple stopping," Finance and Stochastics, Springer, vol. 16(2), pages 319-334, April.
    3. 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.
    4. Roger J. A. Laeven & John G. M. Schoenmakers & Nikolaus F. F. Schweizer & Mitja Stadje, 2020. "Robust Multiple Stopping -- A Pathwise Duality Approach," Papers 2006.01802, arXiv.org, revised Sep 2021.
    5. Denis Belomestny & Christian Bender & John Schoenmakers, 2009. "True Upper Bounds For Bermudan Products Via Non‐Nested Monte Carlo," Mathematical Finance, Wiley Blackwell, vol. 19(1), pages 53-71, January.
    6. Helin Zhu & Fan Ye & Enlu Zhou, 2013. "Fast Estimation of True Bounds on Bermudan Option Prices under Jump-diffusion Processes," Papers 1305.4321, arXiv.org.
    7. Christian Bender & Christian Gaertner & Nikolaus Schweizer, 2016. "Pathwise Iteration for Backward SDEs," Papers 1605.07500, arXiv.org, revised Jun 2016.
    8. 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.
    9. Christopher Beveridge & Mark Joshi, 2011. "Monte Carlo Bounds for Game Options Including Convertible Bonds," Management Science, INFORMS, vol. 57(5), pages 960-974, May.
    10. Louis Bhim & Reiichiro Kawai, 2018. "Smooth Upper Bounds For The Price Function Of American Style Options," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 1-38, February.
    11. Dragos Florin Ciocan & Velibor V. Mišić, 2022. "Interpretable Optimal Stopping," Management Science, INFORMS, vol. 68(3), pages 1616-1638, March.
    12. Jérôme Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Working Papers hal-01983115, HAL.
    13. 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.
    14. Jin, Xing & Yang, Cheng-Yu, 2016. "Efficient estimation of lower and upper bounds for pricing higher-dimensional American arithmetic average options by approximating their payoff functions," International Review of Financial Analysis, Elsevier, vol. 44(C), pages 65-77.
    15. 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.
    16. Helin Zhu & Fan Ye & Enlu Zhou, 2015. "Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes," Quantitative Finance, Taylor & Francis Journals, vol. 15(11), pages 1885-1900, November.
    17. Lukas Gonon, 2022. "Deep neural network expressivity for optimal stopping problems," Papers 2210.10443, arXiv.org.
    18. John Schoenmakers & Junbo Huang & Jianing Zhang, 2011. "Optimal dual martingales, their analysis and application to new algorithms for Bermudan products," Papers 1111.6038, arXiv.org, revised Feb 2012.
    19. Volker Krätschmer & Marcel Ladkau & Roger J. A. Laeven & John G. M. Schoenmakers & Mitja Stadje, 2018. "Optimal Stopping Under Uncertainty in Drift and Jump Intensity," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1177-1209, November.
    20. Jérôme Lelong, 2018. "Dual pricing of American options by Wiener chaos expansion," Post-Print hal-01299819, HAL.

    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:bpj:strimo:v:26:y:2009:i:4:p:275-288:n:3. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    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.