Related papers: Optimal transportation, topology and uniqueness
The purpose of this paper is to show that in a finite dimensional metric space with Alexandrov's curvature bounded below, Monge's transport problem for the quadratic cost admits a unique solution.
We consider Kantorovich optimal transportation problem in the case where the cost function and marginal distributions continuously depend on a parameter with values in a metric space. We prove the existence of approximate optimal Monge…
We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
A remarkable connection between optimal design and Monge transport was initiated in the years 1997 in the context of the minimal elastic compliance problem and where the euclidean metric cost was naturally involved. In this paper we present…
We consider the Monge-Kantorovich problem between two random measuress. More precisely, given probability measures $\mathbb{P}_1,\mathbb{P}_2\in\mathcal{P}(\mathcal{P}(M))$ on the space $\mathcal{P}(M)$ of probability measures on a smooth…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
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…
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…
A fundamental concept in optimal transport is c-cyclical monotonicity: it allows to link the optimality of transport plans to the geometry of their support sets. Recently, related concepts have been successfully applied in the…
We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
This note establishes that a generalization of $c$-cyclical monotonicity from the Monge-Kantorovich problem with two marginals gives rise to a sufficient condition for optimality also in the multi-marginal version of that problem. To obtain…
We study Kantorovich type optimal transportation problems with nonlinear cost functions, including dependence on conditional measures of transport plans. A range of nonlinear Kantorovich problems for cost functions of a special form is…
We exhibit a surprising relationship between elliptic gradient systems of PDEs, multi-marginal Monge-Kantorovich optimal transport problem, and multivariable Hardy-Littlewood inequalities. We show that the notion of an orientable elliptic…
For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
We study optimal transport plans from $m$ equally weighted points (with weights $1/m$) to $n$ equally weighted points (with weights $1/n$). The Birkhoff-von Neumann Theorem implies that if $m=n$, then the optimal transport plan can be…
We study the transportation problem on the unit sphere $S^{n-1}$ for symmetric probability measures and the cost function $c(x,y) = \log \frac{1}{\langle x, y \rangle}$. We calculate the variation of the corresponding Kantorovich functional…
In this paper we analyze a mass transportation problem in a bounded domain with the possibility to transport mass to/from the boundary, paying the transport cost, that is given by the Euclidean distance plus an extra cost depending on the…