7 results
Search Results
Now showing 1 - 7 of 7
- ItemFrom optimal martingales to randomized dual optimal stopping(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Belomestny, Denis; Schoenmakers, John G. M.In this article we study and classify optimal martingales in the dual formulation of optimal stopping problems. In this respect we distinguish between weakly optimal and surely optimal martingales. It is shown that the family of weakly optimal and surely optimal martingales may be quite large. On the other hand it is shown that the Doob-martingale, that is, the martingale part of the Snell envelope, is in a certain sense the most robust surely optimal martingale under random perturbations. This new insight leads to a novel randomized dual martingale minimization algorithm that does`nt require nested simulation. As a main feature, in a possibly large family of optimal martingales the algorithm efficiently selects a martingale that is as close as possible to the Doob martingale. As a result, one obtains the dual upper bound for the optimal stopping problem with low variance.
- ItemReinforced optimal control(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Bayer, Christian; Belomestny, Denis; Hager, Paul; Pigato, Paolo; Schoenmakers, John G. M.; Spokoiny, VladimirLeast squares Monte Carlo methods are a popular numerical approximation method for solving stochastic control problems. Based on dynamic programming, their key feature is the approximation of the conditional expectation of future rewards by linear least squares regression. Hence, the choice of basis functions is crucial for the accuracy of the method. Earlier work by some of us [Belomestny, Schoenmakers, Spokoiny, Zharkynbay, Commun. Math. Sci., 18(1):109?121, 2020] proposes to reinforce the basis functions in the case of optimal stopping problems by already computed value functions for later times, thereby considerably improving the accuracy with limited additional computational cost. We extend the reinforced regression method to a general class of stochastic control problems, while considerably improving the method?s efficiency, as demonstrated by substantial numerical examples as well as theoretical analysis.
- ItemRobust multiple stopping -- A path-wise duality approach(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Laeven, Roger J. A.; Schoenmakers, John G. M.; Schweizer, Nikolaus F. F.; Stadje, MitjaIn this paper we develop a solution method for general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model uncertainty, and for general reward processes driven by multi-dimensional jump-diffusions. Our approach relies on first establishing robust martingale dual representation results for the multiple stopping problem which satisfy appealing path-wise optimality (almost sure) properties. Next, we exploit these theoretical results to develop upper and lower bounds which, as we formally show, not only converge to the true solution asymptotically, but also constitute genuine upper and lower bounds. We illustrate the applicability of our general approach in a few examples and analyze the impact of model uncertainty on optimal multiple stopping strategies.
- ItemSolving optimal stopping problems via randomization and empirical dual optimization(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Belomestny, Denis; Bender, Christian; Schoenmakers, John G. M.In this paper we consider optimal stopping problems in their dual form. In this way we reformulate the optimal stopping problem as a problem of stochastic average approximation (SAA) which can be solved via linear programming. By randomizing the initial value of the underlying process, we enforce solutions with zero variance while preserving the linear programming structure of the problem. A careful analysis of the randomized SAA algorithm shows that it enjoys favorable properties such as faster convergence rates and reduced complexity as compared to the non randomized procedure. We illustrate the performance of our algorithm on several benchmark examples.
- ItemOptimal stopping with signatures(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Bayer, Christian; Hager, Paul; Riedel, Sebastian; Schoenmakers, John G. M.We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process. We consider classic and randomized stopping times represented by linear functionals of the associated rough path signature, and prove that maximizing over the class of signature stopping times, in fact, solves the original optimal stopping problem. Using the algebraic properties of the signature, we can then recast the problem as a (deterministic) optimization problem depending only on the (truncated) expected signature. The only assumption on the process is that it is a continuous (geometric) random rough path. Hence, the theory encompasses processes such as fractional Brownian motion which fail to be either semi-martingales or Markov processes.
- ItemRandomized optimal stopping algorithms and their convergence analysis(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Bayer, Christian; Belomestny, Denis; Hager, Paul; Pigato, Paolo; Schoenmakers, John G. M.In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimization algorithms. In particular we prove the convergence of the proposed algorithms and derive the corresponding convergence rates.
- ItemRKHS regularization of singular local stochastic volatility McKean--Vlasov models(Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Bayer, Christian; Belomestny, Denis; Butkovsky, Oleg; Schoenmakers, John G. M.Motivated by the challenges related to the calibration of financial models, we consider the problem of solving numerically a singular McKean-Vlasov equation, which represents a singular local stochastic volatility model. Whilst such models are quite popular among practitioners, unfortunately, its well-posedness has not been fully understood yet and, in general, is possibly not guaranteed at all. We develop a novel regularization approach based on the reproducing kernel Hilbert space (RKHS) technique and show that the regularized model is well-posed. Furthermore, we prove propagation of chaos. We demonstrate numerically that a thus regularized model is able to perfectly replicate option prices due to typical local volatility models. Our results are also applicable to more general McKean--Vlasov equations.