no code implementations • 6 Dec 2023 • Christian Bayer, Luca Pelizzari, John Schoenmakers
We propose two signature-based methods to solve the optimal stopping problem - that is, to price American options - in non-Markovian frameworks.
no code implementations • 1 Oct 2022 • Denis Belomestny, John Schoenmakers
As a result, our method allows for the construction of tight upper and lower biased approximations of the value functions, and, provides tight approximations to the optimal policy.
no code implementations • 2 Mar 2022 • Christian Bayer, Denis Belomestny, Oleg Butkovsky, John Schoenmakers
Motivated by the challenges related to the calibration of financial models, we consider the problem of numerically solving a singular McKean-Vlasov equation $$ d X_t= \sigma(t, X_t) X_t \frac{\sqrt v_t}{\sqrt {E[v_t|X_t]}}dW_t, $$ where $W$ is a Brownian motion and $v$ is an adapted diffusion process.
no code implementations • 2 Feb 2021 • Denis Belomestny, John Schoenmakers
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.
Probability Optimization and Control Computational Finance 91G60, 65C05, 60G40
no code implementations • 24 Nov 2020 • Christian Bayer, Denis Belomestny, Paul Hager, Paolo Pigato, John Schoenmakers, Vladimir Spokoiny
Least squares Monte Carlo methods are a popular numerical approximation method for solving stochastic control problems.
no code implementations • 7 Aug 2018 • Denis Belomestny, John Schoenmakers, Vladimir Spokoiny, Bakhyt Zharkynbay
In this note we propose a new approach towards solving numerically optimal stopping problems via reinforced regression based Monte Carlo algorithms.