Related papers: Recombining tree approximations for Game Options i…
The Skorokhod embedding problem is to represent a given probability as the distribution of Brownian motion at a chosen stopping time. Over the last 50 years this has become one of the important classical problems in probability theory and a…
We show that the shortfall risk of binomial approximations of game (Israeli) options converges to the shortfall risk in the corresponding Black--Scholes market considering Lipschitz continuous path-dependent payoffs for both discrete- and…
In this article, we study the classical finite-horizon optimal stopping problem for multidimensional diffusions through an approach that differs from what is typically found in the literature. More specifically, we first prove a key…
We study the problem of stopping a Brownian motion at a given distribution $\nu$ while optimizing a reward function that depends on the (possibly randomized) stopping time and the Brownian motion. Our first result establishes that the set…
We solve the $n$-marginal Skorokhod embedding problem for a continuous local martingale and a sequence of probability measures $\mu_1,...,\mu_n$ which are in convex order and satisfy an additional technical assumption. Our construction is…
In this paper we study simulation based optimization algorithms for solving discrete time optimal stopping problems. This type of algorithms became popular among practioneers working in the area of quantitative finance. Using large…
We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the…
Recent work of Dupire and Carr and Lee has highlighted the importance of understanding the Skorokhod embedding originally proposed by Root for the model-independent hedging of variance options. Root's work shows that there exists a barrier…
Using spectral decomposition techniques and singular perturbation theory, we develop a systematic method to approximate the prices of a variety of options in a fast mean-reverting stochastic volatility setting. Four examples are provided in…
Motivated by the model- independent pricing of derivatives calibrated to the real market, we consider an optimization problem similar to the optimal Skorokhod embedding problem, where the embedded Brownian motion needs only to reproduce a…
We describe a variational approach to solving optimal stopping problems for diffusion processes, as an alternative to the traditional approach based on the solution of the free-boundary problem. We study smooth pasting conditions from a…
We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov…
Given a Brownian motion $B_t$ and a general target law $\mu$ (not necessarily centered or even integrable) we show how to construct an embedding of $\mu$ in $B$. This embedding is an extension of an embedding due to Perkins, and is optimal…
Considering a real-valued diffusion, a real-valued reward function and a positive discount rate, we provide an algorithm to solve the optimal stopping problem consisting in finding the optimal expected discounted reward and the optimal…
We study the approximation of certain stochastic integrals with respect to a d-dimensional diffusion by corresponding stochastic integrals with piece-wise constant integrands. In finance this corresponds to replacing a continuously adjusted…
We consider one dimensional diffusive search strategies subjected to external potentials. The location of a single target is drawn from a given probability density function (PDF) $f_G(x)$ and is fixed for each stochastic realization of the…
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion…
Optimal stopping is the problem of deciding when to stop a stochastic system to obtain the greatest reward, arising in numerous application areas such as finance, healthcare and marketing. State-of-the-art methods for high-dimensional…
Solving optimal stopping problems by backward induction in high dimensions is often very complex since the computation of conditional expectations is required. Typically, such computations are based on regression, a method that suffers from…
We construct subgame-perfect equilibria with mixed strategies for symmetric stochastic timing games with arbitrary strategic incentives. The strategies are qualitatively different for local first- or second-mover advantages, which we…