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

Discrete-type approximations for non-Markovian optimal stopping problems: Part II

Author

Listed:
  • S'ergio C. Bezerra
  • Alberto Ohashi
  • Francesco Russo
  • Francys de Souza

Abstract

In this paper, we present a Longstaff-Schwartz-type algorithm for optimal stopping time problems based on the Brownian motion filtration. The algorithm is based on Le\~ao, Ohashi and Russo and, in contrast to previous works, our methodology applies to optimal stopping problems for fully non-Markovian and non-semimartingale state processes such as functionals of path-dependent stochastic differential equations and fractional Brownian motions. Based on statistical learning theory techniques, we provide overall error estimates in terms of concrete approximation architecture spaces with finite Vapnik-Chervonenkis dimension. Analytical properties of continuation values for path-dependent SDEs and concrete linear architecture approximating spaces are also discussed.

Suggested Citation

  • 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.
    • Handle: RePEc:arx:papers:1707.05250
    as

    Download full text from publisher

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

    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. Ludkovski, Michael, 2009. "A simulation approach to optimal stopping under partial information," Stochastic Processes and their Applications, Elsevier, vol. 119(12), pages 4061-4087, December.
    4. repec:dau:papers:123456789/4273 is not listed on IDEAS
    5. 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.
    6. Burq, Zaeem A. & Jones, Owen D., 2008. "Simulation of Brownian motion at first-passage times," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 77(1), pages 64-71.
    7. Daniel Zanger, 2009. "Convergence of a Least-Squares Monte Carlo Algorithm for Bounded Approximating Sets," Applied Mathematical Finance, Taylor & Francis Journals, vol. 16(2), pages 123-150.
    8. Daniel Zanger, 2013. "Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing," Finance and Stochastics, Springer, vol. 17(3), pages 503-534, July.
    9. L. C. G. Rogers, 2002. "Monte Carlo valuation of American options," Mathematical Finance, Wiley Blackwell, vol. 12(3), pages 271-286, July.
    10. 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. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.
    2. 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.

    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. 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.
    2. Zhiyi Shen & Chengguo Weng, 2019. "A Backward Simulation Method for Stochastic Optimal Control Problems," Papers 1901.06715, arXiv.org.
    3. Chen Liu & Henry Schellhorn & Qidi Peng, 2019. "American Option Pricing With Regression: Convergence Analysis," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 22(08), pages 1-31, December.
    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. Garcia, Diego, 2003. "Convergence and Biases of Monte Carlo estimates of American option prices using a parametric exercise rule," Journal of Economic Dynamics and Control, Elsevier, vol. 27(10), pages 1855-1879, August.
    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. Jérôme Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Working Papers hal-01983115, HAL.
    8. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.
    9. 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.
    10. 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.
    11. Zbigniew Palmowski & Tomasz Serafin, 2020. "A Note on Simulation Pricing of π -Options," Risks, MDPI, vol. 8(3), pages 1-19, August.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Maciej Klimek & Marcin Pitera, 2014. "The least squares method for option pricing revisited," Papers 1404.7438, arXiv.org, revised Nov 2015.
    17. Daniel Z. Zanger, 2020. "General Error Estimates for the Longstaff–Schwartz Least-Squares Monte Carlo Algorithm," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 923-946, August.
    18. 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.
    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. 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.

    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:arx:papers:1707.05250. 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.