Related papers: Existence, Duality, and Cyclical monotonicity for …
We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…
We consider the modified Monge-Kantorovich problem with additional restriction: admissible transport plans must vanish on some fixed functional subspace. Different choice of the subspace leads to different additional properties optimal…
This article connects the theory of extremal doubly stochastic measures to the geometry and topology of optimal transportation. We begin by reviewing an old question (# 111) of Birkhoff in probability and statistics [4], which is to give a…
For the basic case of $L_2$ optimal transport between two probability measures on a Euclidean space, the regularity of the coupling measure and the transport map in the tail regions of these measures is studied. For this purpose, Robert…
The classical Kantorovich-Rubinstein duality theorem establishes a significant connection between Monge optimal transport and maximization of a linear form on the set of 1-Lipschitz functions. This result has been widely used in various…
We study the optimal transport problem on globally hyperbolic spacetimes associated with Orlicz-type Lorentzian cost functions of the form $u \circ \ell$, where $u$ is a suitable monotonically increasing and concave function, and $\ell$ is…
The optimal transport problem with quadratic regularization is useful when sparse couplings are desired. The density of the optimal coupling is described by two functions called potentials; equivalently, potentials can be defined as a…
A new approach to linear programming duality is proposed which relies on quadratic penalization, so that the relation between solutions to the penalized primal and dual problems becomes affine. This yields a new proof of Levin's duality…
The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of…
We study the consequences of the equivalence between the least gradient problem and a boundary-to-boundary optimal transport problem in two dimensions. We extend the relationship between the two problems to their respective dual problems,…
Optimal transportation theory and the related $p$-Wasserstein distance ($W_p$, $p\geq 1$) are widely-applied in statistics and machine learning. In spite of their popularity, inference based on these tools has some issues. For instance, it…
In this paper, we introduce a primal-dual algorithm for solving (martingale) optimal transportation problems, with cost functions satisfying the twist condition, close to the one that has been used recently for training generative…
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dL is a geodesic Borel distance which makes (X,dL) a non branching geodesic space. We show that under the assumption that geodesics are…
We present a general duality result for Wasserstein distributionally robust optimization that holds for any Kantorovich transport cost, measurable loss function, and nominal probability distribution. Assuming an interchangeability principle…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
We investigate existence of dual optimizers in one-dimensional martingale optimal transport problems. While [BNT16] established such existence for weak (quasi-sure) duality, [BHP13] showed existence for the natural stronger pointwise…
We investigate the problem of pairwise multi-marginal optimal transport, that is, given a collection of probability distributions $\{P_\alpha\}$ on a Polish space $\mathcal{X}$, to find a coupling $\{X_\alpha\}$, $X_\alpha\sim P_\alpha$,…
In the semi-discrete version of Monge's problem one tries to find a transport map $T$ with minimum cost from an absolutely continuous measure $\mu$ on $\mathbb{R}^d$ to a discrete measure $\nu$ that is supported on a finite set in…
We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…