Related papers: An explicit solution for a multimarginal mass tran…
Many research has been conducted about quadratic programming and inverse optimization. In this paper we present the combination aspect of these subjects, applying on transportation problem. First, we obtain the inverse form of quadratic…
We present a survey on several mass transportation problems, in which a given mass dynamically moves from an initial configuration to a final one. The approach we consider is the one introduced by Benamou and Brenier in [5], where a…
Optimal transport is the problem of designing a joint distribution for two random variables with fixed marginals. In virtually the entire literature on this topic, the objective is to minimize expected cost. This paper is the first to study…
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists…
The Cauchy problem for a multidimensional linear transport equation with discontinuous coefficient is investigated. Provided the coefficient satisfies a one-sided Lipschitz condition, existence, uniqueness and weak stability of solutions…
We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…
Numerical methods for the optimal transport problem is an active area of research. Recent work of Kitagawa and Abedin shows that the solution of a time-dependent equation converges exponentially fast as time goes to infinity to the solution…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…
Motivated by a recent Diophantine transport problem about how to transport profitably a group of persons or objects, we survey classical facts about solving systems of linear Diophantine equations and inequalities in nonnegative integers.…
We study the structural properties of multi-period martingale optimal transport (MOT). We develop new tools to address these problems, and use them to prove several uniqueness and structural results on three-period martingale optimal…
We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…
In this paper we solve a L\'evy driven linear stochastic first order partial differential equation (transport equation) understood in the canonical (Marcus) form. The solution can be obtained with the help of the method of stochastic…
Let $\{\mu_k\}_{k = 1}^N$ be absolutely continuous probability measures on the real line such that every measure $\mu_k$ is supported on the segment $[l_k, r_k]$ and the density function of $\mu_k$ is nonincreasing on that segment for all…
We study the semi-discrete formulation of one-dimensional partial optimal transport with quadratic cost, where a probability density is partially transported to a finite sum of Dirac masses of smaller total mass. This problem arises…
We study the vanishing-regularization limit of entropically regularized optimal transport (EOT) for the Euclidean distance cost $c(x,y)=\|x-y\|$ in dimension $d>1$. We develop a comprehensive variational convergence framework that entails…
In this work we propose a batch version of the Greenkhorn algorithm for multimarginal regularized optimal transport problems. Our framework is general enough to cover, as particular cases, some existing algorithms like Sinkhorn and…
The purpose of this note is to show that the solution to the Kantorovich optimal transportation problem is supported on a Lipschitz manifold, provided the cost is $C^{2}$ with non-singular mixed second derivative. We use this result to…
Some classical mass transportation problems are investigated in a finitely additive setting. Let $\Omega=\prod_{i=1}^n\Omega_i$ and $\mathcal{A}=\otimes_{i=1}^n\mathcal{A}_i$, where $(\Omega_i,\mathcal{A}_i,\mu_i)$ is a ($\sigma$-additive)…
In this paper we study theoretical properties of the entropy-transport functional with repulsive cost functions. We provide sufficient conditions for the existence of a minimizer in a class of metric spaces and prove the…