IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v166y2023ics0304414922002654.html

Unbiased Optimal Stopping via the MUSE

Author

Listed:
  • Zhou, Zhengqing
  • Wang, Guanyang
  • Blanchet, Jose H.
  • Glynn, Peter W.

Abstract

We propose a new unbiased estimator for estimating the utility of the optimal stopping problem. The MUSE, short for ‘Multilevel Unbiased Stopping Estimator’, constructs the unbiased Multilevel Monte Carlo (MLMC) estimator at every stage of the optimal stopping problem in a backward recursive way. In contrast to traditional sequential methods, the MUSE can be implemented in parallel. We prove the MUSE has finite variance, finite computational complexity, and achieves ɛ-accuracy with O(1/ɛ2) computational cost under mild conditions. We demonstrate MUSE empirically in an option pricing problem involving a high-dimensional input and the use of many parallel processors.

Suggested Citation

  • Zhou, Zhengqing & Wang, Guanyang & Blanchet, Jose H. & Glynn, Peter W., 2023. "Unbiased Optimal Stopping via the MUSE," Stochastic Processes and their Applications, Elsevier, vol. 166(C).
    • Handle: RePEc:eee:spapps:v:166:y:2023:i:c:s0304414922002654
    DOI: 10.1016/j.spa.2022.12.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414922002654
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2022.12.007?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

    for a different version of it.

    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. Michael B. Giles, 2008. "Multilevel Monte Carlo Path Simulation," Operations Research, INFORMS, vol. 56(3), pages 607-617, June.
    3. McLeish, Don, 2011. "A general method for debiasing a Monte Carlo estimator," Monte Carlo Methods and Applications, De Gruyter, vol. 17(4), pages 301-315, December.
    4. Michael B. Giles & Lukasz Szpruch, 2012. "Antithetic multilevel Monte Carlo estimation for multi-dimensional SDEs without L\'{e}vy area simulation," Papers 1202.6283, arXiv.org, revised May 2014.
    5. 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.
    6. J Heng & P E Jacob, 2019. "Unbiased Hamiltonian Monte Carlo with couplings," Biometrika, Biometrika Trust, vol. 106(2), pages 287-302.
    7. 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.
    8. Chang-Han Rhee & Peter W. Glynn, 2015. "Unbiased Estimation with Square Root Convergence for SDE Models," Operations Research, INFORMS, vol. 63(5), pages 1026-1043, October.
    9. Broadie, Mark & Glasserman, Paul, 1997. "Pricing American-style securities using simulation," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1323-1352, June.
    10. Pierre E. Jacob & John O’Leary & Yves F. Atchadé, 2020. "Unbiased Markov chain Monte Carlo methods with couplings," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 82(3), pages 543-600, July.
    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)

    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. Zhengqing Zhou & Guanyang Wang & Jose Blanchet & Peter W. Glynn, 2021. "Unbiased Optimal Stopping via the MUSE," Papers 2106.02263, arXiv.org, revised Dec 2022.
    2. Yasa Syed & Guanyang Wang, 2023. "Optimal randomized multilevel Monte Carlo for repeatedly nested expectations," Papers 2301.04095, arXiv.org, revised May 2023.
    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. 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.
    5. Matti Vihola & Jouni Helske & Jordan Franks, 2020. "Importance sampling type estimators based on approximate marginal Markov chain Monte Carlo," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 47(4), pages 1339-1376, December.
    6. Goda, Takashi & Kitade, Wataru, 2023. "Constructing unbiased gradient estimators with finite variance for conditional stochastic optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 743-763.
    7. 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.
    8. Andrea Della Vecchia & Damir Filipovi'c, 2025. "Error Propagation in Dynamic Programming: From Stochastic Control to Option Pricing," Papers 2509.20239, arXiv.org.
    9. Denis Belomestny & Fabian Dickmann & Tigran Nagapetyan, 2013. "Pricing American options via multi-level approximation methods," Papers 1303.1334, arXiv.org, revised Dec 2013.
    10. 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.
    11. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    12. Joshi, Mark & Yang, Chao, 2011. "Fast delta computations in the swap-rate market model," Journal of Economic Dynamics and Control, Elsevier, vol. 35(5), pages 764-775, May.
    13. Vladislav Kargin, 2005. "Lattice Option Pricing By Multidimensional Interpolation," Mathematical Finance, Wiley Blackwell, vol. 15(4), pages 635-647, October.
    14. Ruzayqat Hamza M. & Jasra Ajay, 2020. "Unbiased estimation of the solution to Zakai’s equation," Monte Carlo Methods and Applications, De Gruyter, vol. 26(2), pages 113-129, June.
    15. O. Samimi & Z. Mardani & S. Sharafpour & F. Mehrdoust, 2017. "LSM Algorithm for Pricing American Option Under Heston–Hull–White’s Stochastic Volatility Model," Computational Economics, Springer;Society for Computational Economics, vol. 50(2), pages 173-187, August.
    16. Hatem Ben-Ameur & Michèle Breton & Pierre L'Ecuyer, 2002. "A Dynamic Programming Procedure for Pricing American-Style Asian Options," Management Science, INFORMS, vol. 48(5), pages 625-643, May.
    17. Muthuraman, Kumar, 2008. "A moving boundary approach to American option pricing," Journal of Economic Dynamics and Control, Elsevier, vol. 32(11), pages 3520-3537, November.
    18. Chi H. Truong, 2014. "A Two Factor Model for Water Prices and Its Implications for Evaluating Real Options and Other Water Price Derivatives," Canadian Journal of Agricultural Economics/Revue canadienne d'agroeconomie, Canadian Agricultural Economics Society/Societe canadienne d'agroeconomie, vol. 62(1), pages 23-45, March.
    19. Augusto Castillo, 2004. "Firm and Corporate Bond Valuation: A Simulation Dynamic Programming Approach," Latin American Journal of Economics-formerly Cuadernos de Economía, Instituto de Economía. Pontificia Universidad Católica de Chile., vol. 41(124), pages 345-360.
    20. repec:hum:wpaper:sfb649dp2006-051 is not listed on IDEAS
    21. Leonardo Kanashiro Felizardo & Elia Matsumoto & Emilio Del-Moral-Hernandez, 2022. "Solving the optimal stopping problem with reinforcement learning: an application in financial option exercise," Papers 2208.00765, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:spapps:v:166:y:2023:i:c:s0304414922002654. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.