Related papers: An explicit solution for a multimarginal mass tran…
Mass transport problems are ubiquitous in diverse fields of physics and engineering. With the development of fractional calculus, many have taken to studying problems of fractional mass transport either through numerical simulations or…
We study the complexity of approximating the multimarginal optimal transport (MOT) distance, a generalization of the classical optimal transport distance, considered here between $m$ discrete probability distributions supported each on $n$…
Semi-discrete transport can be characterized in terms of real-valued shifts. Often, but not always, the solution to the shift-characterized problem partitions the continuous region. This paper gives examples of when partitioning fails, and…
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…
The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
We establish dual attainment for the multimarginal, multi-asset martingale optimal transport (MOT) problem, a fundamental question in the mathematical theory of model-independent pricing and hedging in quantitative finance. Our main result…
We give an example of an absolutely continuous measure $\mu$ on $\mathbb R^d$, for any $d \ge 1$, such that no minimizer of the $3$-marginal harmonic repulsive cost with all marginals equal to $\mu$ is supported on a graph over the first…
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 focus on Optimal Transport PDE on the unit sphere $\mathbb{S}^2$ with a particular type of cost function $c(x,y) = F(x \cdot y, x \cdot \hat{e}, y \cdot \hat{e})$ which we call cost functions with preferential direction, where $\hat{e}…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
We formulate and study an optimal transportation problem with infinitely many marginals; this is a natural extension of the multi-marginal problem studied by Gangbo and Swiech (1998). We prove results on the existence, uniqueness and…
This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in…
This article reviews the use of first order convex optimization schemes to solve the discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier. We develop a staggered grid discretization that is well adapted…
The Optimal transport (OT) problem is rapidly finding its way into machine learning. Favoring its use are its metric properties. Many problems admit solutions with guarantees only for objects embedded in metric spaces, and the use of…
Many causal and structural parameters in economics can be identified and estimated by computing the value of an optimization program over all distributions consistent with the model and the data. Existing tools apply when the data is…
Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into…
In the optimal partial transport problem, one is asked to transport a fraction $0<m \leq \min\{||f||_{L^1}, ||g||_{L^1}\}$ of the mass of $f=f \chi_\Omega$ onto $g=g\chi_\Lambda$ while minimizing a transportation cost. If $f$ and $g$ are…
In this paper we introduce a new class of finite element discretizations of the quadratic optimal transport problem based on its dynamical formulation. These generalize to the finite element setting the finite difference scheme proposed by…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…