Unbiased Optimal Stopping via the MUSE

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/{\epsilon }^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.

arXiv comment39 pages, add several numerical experiments and technical results, accepted by Stochastic Processes and their Applications

References in corpus (6)

• Antithetic multilevel Monte Carlo estimation for multi-dimensional SDEs without Lévy area simulation
• Decision-making under uncertainty: using MLMC for efficient estimation of EVPPI
• Multilevel Monte Carlo estimation of the expected value of sample information
• Maximal couplings of the Metropolis-Hastings algorithm
• Unbiased Multilevel Monte Carlo methods for intractable distributions: MLMC meets MCMC
• Unbiased Multilevel Monte Carlo: Stochastic Optimization, Steady-state Simulation, Quantiles, and Other Applications