Unbiased optimal stopping via the MUSE

From MaRDI portal
Publication:6184922

DOI10.1016/J.SPA.2022.12.007arXiv2106.02263OpenAlexW3169494828MaRDI QIDQ6184922FDOQ6184922


Authors: Zhengqing Zhou, Guanyang Wang, Jose Blanchet, Peter W. Glynn Edit this on Wikidata


Publication date: 29 January 2024

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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 epsilon-accuracy with O(1/epsilon2) 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.


Full work available at URL: https://arxiv.org/abs/2106.02263







Cites Work






This page was built for publication: Unbiased optimal stopping via the MUSE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184922)