Related papers: The multi-marginal optimal partial transport probl…
The Monge-Kantorovich problem for the infinite Wasserstein distance presents several peculiarities. Among them the lack of convexity and then of a direct duality. We study in dimension 1 the dual problem introduced by Barron, Bocea and…
The fundamental theorem of classical optimal transport establishes strong duality and characterizes optimizers through a complementary slackness condition. Milestones such as Brenier's theorem and the Kantorovich-Rubinstein formula are…
We introduce a Benamou-Brenier formulation for the continuous-time martingale optimal transport problem as a weak length relaxation of its discrete-time counterpart. By the correspondence between classical martingale problems and…
We present a minimization problem with a horizontal divergence-type constraint in the Heisenberg group. Our study explores its dual formulation and examines its relationship with the congested optimal transport problem, for $1 < p <…
In the setting of optimal transport with $N\ge 2$ marginals, a necessary condition for transport plans to be optimal is that they are $c$-cyclically monotone. For $N=2$ there exist several proofs that in very general settings $c$-cyclical…
In the Monge-Kantorovich transport problem, the transport cost is expressed in terms of transport maps or transport plans, which play crucial roles there. A variant of the Monge-Kantorovich problem is the ramified (branching) transport…
We determine the optimal structure of couplings for the \emph{Martingale transport problem} between radially symmetric initial and terminal laws $\mu, \nu$ on $\R^d$ and show the uniqueness of optimizer. Here optimality means that such…
We explore the structure of solutions to a family of non-linear martingale optimal transport (MOT) problems that involve conditional expectations in the objective functional. En route general results concerning optimization over…
We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set. It leads to dual equalities and characterizations of the…
The theory of Optimal Transport (OT) and Martingale Optimal Transport (MOT) were inspired by problems in economics and finance and have flourished over the past decades, making significant advances in theory and practice. MOT considers the…
The multistochastic $ (n,k)$-Monge--Kantorovich problem on a product space $\prod_{i=1}^n X_i$ is an extension of the classical Monge--Kantorovich problem. This problem is considered on the space of measures with fixed projections onto…
It is well-known that the optimal transport problem on the real line for the classical distance cost may not have a unique solution. In this paper we recover uniqueness by considering the transport problems where the costs are a power…
We study the inverse optimal transport problem of recovering the ground cost from an optimal transport plan. In discrete settings, this problem reduces to inverse linear programming and is intrinsically ill-posed, exhibiting…
We consider the optimal mass transportation problem in $\RR^d$ with measurably parameterized marginals, for general cost functions and under conditions ensuring the existence of a unique optimal transport map. We prove a joint measurability…
We construct an explicit solution for the multimarginal transportation problem on the unit cube $[0,1]^3$ with the cost function $xyz$ and one-dimensional uniform projections. We show that the primal problem is concentrated on a set with…
Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…
We consider the optimal transportation problem on a globally hyperbolic spacetime for some cost function $c_2$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is the…
The inverse optimal transport problem is to find the underlying cost function from the knowledge of optimal transport plans. While this amounts to solving a linear inverse problem, in this work we will be concerned with the nonlinear…
We extend the Benamou-Brenier formula from classical optimal transport to weak optimal transport and show that the barycentric optimal transport problem studied by Gozlan and Juillet has a dynamic analogue. We also investigate a martingale…
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…