Optimal transportation for the determinant

Abstract

Among ${\mathbb{R}}^3$-valued triples of random vectors $(X,Y,Z)$ having fixed marginal probability laws, what is the best way to jointly draw $(X,Y,Z)$ in such a way that the simplex generated by $(X,Y,Z)$ has maximal average volume? Motivated by this simple question, we study optimal transportation problems with several marginals when the objective function is the determinant or its absolute value.

Cited by in corpus (14)

• Smoothing of transport plans with fixed marginals and rigorous semiclassical limit of the Hohenberg-Kohn functional
• Remarks on the semi-classical Hohenberg-Kohn functional
• Optimal Transportation Theory with Repulsive Costs
• Hardness results for Multimarginal Optimal Transport problems
• An explicit solution for a multimarginal mass transportation problem
• Multi-marginal optimal transport on Riemannian manifolds
• Geometry of Kantorovich Polytopes and Support of Optimizers for Repulsive Multi-Marginal Optimal Transport on Finite State Spaces
• Optimal transport with Coulomb cost and the semiclassical limit of Density Functional Theory
• Convergence rate of entropy-regularized multi-marginal optimal transport costs
• Optimal Transportation of Vector-Valued Measures
• Solutions to multi-marginal optimal transport problems concentrated on several graphs
• A general condition for Monge solutions in the multi-marginal optimal transport problem
• A class of multi-marginal c-cyclically monotone sets with explicit c-splitting potentials
• Multi-marginal maximal monotonicity and convex analysis