Related papers: On a problem of optimal mixing
Stability of the value function and the set of minimizers w.r.t. the given data is a desirable feature of optimal transport problems. For the classical Kantorovich transport problem, stability is satisfied under mild assumptions and in…
We propose the use of the Kantorovich-Rubinstein norm from optimal transport in imaging problems. In particular, we discuss a variational regularisation model endowed with a Kantorovich-Rubinstein discrepancy term and total variation…
We study measurable dependence of measures on a parameter in the following two classical problems: constructing conditional measures and the Kantorovich optimal transportation. We obtain broad sufficient conditions for the existence of…
We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the…
We introduce the optimal transportation interpretation of the Kantorovich norm on thespace of signed Radon measures with finite mass, based on a generalized Wasserstein distancefor measures with different masses.With the formulation and the…
We prove uniqueness and Monge solution results for multi-marginal optimal transportation problems with a certain class of surplus functions; this class arises naturally in multi-agent matching problems in economics. This result generalizes…
Adapted or causal transport theory aims to extend classical optimal transport from probability measures to stochastic processes. On a technical level, the novelty is to restrict to couplings which are bicausal, i.e. satisfy a property which…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
In the current book I suggest an off-road path to the subject of optimal transport. I tried to avoid prior knowledge of analysis, PDE theory and functional analysis, as much as possible. Thus I concentrate on discrete and semi-discrete…
This paper connects discrete optimal transport to a certain class of multi-objective optimization problems. In both settings, the decision variables can be organized into a matrix. In the multi-objective problem, the notion of Pareto…
In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…
Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…
We develop a general condition on the cost function which is sufficient to imply Monge solution and uniqueness results in the multi-marginal optimal transport problem. This result unifies and generalizes several results in the rather…
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p…
There are well-established connections between combinatorial optimization, optimal transport theory and Hydrodynamics, through the linear assignment problem in combinatorics, the Monge-Kantorovich problem in optimal transport theory and the…
We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
We propose an optimal solution to a deterministic dynamic assignment problem by leveraging connections to the theory of discrete optimal transport to convert the combinatorial assignment problem into a tractable linear program. We seek to…
Coupling probability measures lies at the core of many problems in statistics and machine learning, from domain adaptation to transfer learning and causal inference. Yet, even when restricted to deterministic transports, such couplings are…
We introduce a one-parameter family of metrics on the space of Borel probability measures on Euclidean space with finite $p$th moment for $1\leq p <\infty$, called the $\textit{sliced Monge--Kantorovich metrics}$, which include the sliced…
Existence of solution of the logarithmic Minkowski problem is proved for the case where the discrete measures on the unit sphere satisfy the subspace concentration condition with respect to some special proper subspaces. In order to…