Related papers: Geometry of Distribution-Constrained Optimal Stopp…
It has been shown recently that the optimal fluctuation method -- essentially geometrical optics -- provides a valuable insight into large deviations of Brownian motion. Here we extend the geometrical optics formalism to two-sided,…
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…
A new pairwise cost function is proposed for the optimal transport barycenter problem, adopting the form of the minimal action between two points, with a Lagrangian that takes into account an underlying probability distribution. Under this…
Among various rare events, the effective computation of transition paths connecting metastable states in a stochastic model is an important problem. This paper proposes a stochastic optimal control formulation for transition path problems…
We study an inverse first-passage-time problem for Wiener process $X(t)$ subject to hold and jump from a boundary $c.$ Let be given a threshold $S>X(0) \ge c,$ and a distribution function $F$ on $[0, + \infty ).$ The problem consists in…
We obtain the first probabilistic proof of continuous differentiability of time-dependent optimal boundaries in optimal stopping problems. The underlying stochastic dynamics is a one-dimensional, time-inhomogeneous diffusion. The gain…
We consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow,…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
We consider a stochastic transportation problem between two prescribed probability distributions (a source and a target) over processes with general drift dependence and with free end times. First, and in order to establish a dual…
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…
We analyze an optimal stopping problem with a series of inequality-type and equality-type expectation constraints in a general non-Markovian framework. We show that the optimal stopping problem with expectation constraints (OSEC) in an…
Consider the motion of a Brownian particle in three dimensions, whose two spatial coordinates are standard Brownian motions with zero drift, and the remaining (unknown) spatial coordinate is a standard Brownian motion with a non-zero drift.…
In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is…
We investigate a class of optimal stopping problems arising in, for example, studies considering the timing of an irreversible investment when the underlying follows a skew Brownian motion. Our results indicate that the local directional…
We consider a reflected backward stochastic differential equations with default time and an optional barrier in a filtration generated by a one-dimensional Brownian motion and a defaultable process. We suppose that the barrier have…
In this paper we study the problem of stopping a Brownian bridge $X$ in order to maximise the expected value of an exponential gain function. In particular, we solve the stopping problem $$\sup_{0\le \tau\le…
In machine learning and computer vision, optimal transport has had significant success in learning generative models and defining metric distances between structured and stochastic data objects, that can be cast as probability measures. The…
We introduce a Benamou-Brenier formulation for the continuous-time martingale optimal transport problem as a weak length relaxation of its discrete-time counterpart. By the correspondence between classical martingale problems and…
In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…