Related papers: Minimal Root's embeddings for general starting and…
We show that the barrier function in Root's solution to the Skorokhod embedding problem is continuous and finite at every point where the target measure has no atom and its absolutely continuous part is locally bounded away from zero.
In this work, we investigate the problem of the boundedness of the Gross' solutions of the planar Skorokhod embedding problem, where we show that the solution is bounded under some mild conditions on the underlying probability distribution.
We solve the Skorokhod embedding problem for a class of stochastic processes satisfying an inhomogeneous stochastic differential equation (SDE) of the form $d A_t =\mu (t, A_t) d t + \sigma(t, A_t) d W_t$. We provide sufficient conditions…
We study the problem of sequential probability assignment under logarithmic loss, both with and without side information. Our objective is to analyze the minimax regret -- a notion extensively studied in the literature -- in terms of…
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…
In this paper we begin by discussing the simple bilevel programming problem (SBP) and its extension the simple mathematical programming problem under equilibrium constraints (SMPEC). Here we first define both these problems and study their…
We consider from a microscopic perspective large deviation properties of several stochastic interacting particle systems, using their mapping to integrable quantum spin systems. A brief review of recent work is given and several new results…
In this paper, we provide some results on Skorokhod embedding with local time and its applications to the robust hedging problem in finance. First we investigate the robust hedging of options depending on the local time by using the…
We prove a strong duality result for a linear programming problem which has the interpretation of being a discretised optimal Skorokhod embedding problem, and we recover this continuous time problem as a limit of the discrete problems. With…
This paper considers the problem of recovering either a low rank matrix or a sparse vector from observations of linear combinations of the vector or matrix elements. Recent methods replace the non-convex regularization with $\ell_1$ or…
In this paper we consider the Skorokhod embedding problem for general starting and target measures. In particular, we provide necessary and sufficient conditions for a stopping time to be minimal in the sense of Monroe(1972). The resulting…
When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery…
We show that the left-monotone martingale coupling is optimal for any given performance function satisfying the martingale version of the Spence-Mirrlees condition, without assuming additional structural conditions on the marginals. We also…
Switching identities have a long history in potential theory and stochastic analysis. In recent work of Cox and Wang, a switching identity was used to connect an optimal stopping problem and the Skorokhod embedding problem (SEP). Typically…
This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the…
The symmetric simple exclusion process (SEP), where diffusive particles cannot overtake each other, is a paradigmatic model of transport in the single-file geometry. In this model, the study of currents has attracted a lot of attention, but…
Necessary optimality conditions in Lagrangian form and the sequential minimization framework are extended to mixed-integer nonlinear optimization, without any convexity assumptions. Building upon a recently developed notion of local…
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given $k$ planar graphs we ask whether they can be simultaneously embedded so that the embedding of each graph is planar and common edges are drawn the same. Problems of SEFE…
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…
Entropic Optimal Transport (EOT), also referred to as the Schr\"odinger problem, seeks to find a random processes with prescribed initial/final marginals and with minimal relative entropy with respect to a reference measure. The relative…