Related papers: On a discrete max-plus transportation problem
We show that several decision problems originating from max-plus or tropical convexity are equivalent to zero-sum two player game problems. In particular, we set up an equivalence between the external representation of tropical convex sets…
We investigate the link between regularised self-transport problems and maximum likelihood estimation in Gaussian mixture models (GMM). This link suggests that self-transport followed by a clustering technique leads to principled estimators…
By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry…
The dual attainment of the Monge--Kantorovich transport problem is analyzed in a general setting. The spaces $X, Y$ are assumed to be polish and equipped with Borel probability measures $\mu$ and $\nu$. The transport cost function $c:\XY…
We develop a mathematical theory of entropic regularisation of unbalanced optimal transport problems. Focusing on static formulation and relying on the formalism developed for the unregularised case, we show that unbalanced optimal…
This paper exploit the equivalence between the Schr\"odinger Bridge problem and the entropy penalized optimal transport in order to find a different approach to the duality, in the spirit of optimal transport. This approach results in a…
We study the subgroup structure of the semigroup of finitary tropical matrices under multiplication. We show that every maximal subgroup is isomorphic to the full linear automorphism group of a related tropical polytope, and that each of…
We consider location problems to find the optimal sites of placement of a new facility, which minimize the maximum weighted Chebyshev or rectilinear distance to existing facilities under constraints on a feasible location domain. We examine…
This paper studies a variant of ramified/branched optimal transportation problems. Given the distributions of production capacities and market sizes, a firm looks for an allocation of productions over factories, a distribution of sales…
The purpose of this paper is to show that in a finite dimensional metric space with Alexandrov's curvature bounded below, Monge's transport problem for the quadratic cost admits a unique solution.
In this paper, we study the Maximum-Profit Routing Problem with Variable Supply (MPRP-VS). This is a more general version of the Maximum-Profit Public Transportation Route Planning Problem, or simply Maximum-Profit Routing Problem (MPRP),…
An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\mu$ and $\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology…
We present two methods to algorithmically compute both least and greatest solutions of polynomial equation systems over absorptive semirings (with certain completeness and continuity assumptions), such as the tropical semiring. Both methods…
Optimal transport maps define a one-to-one correspondence between probability distributions, and as such have grown popular for machine learning applications. However, these maps are generally defined on empirical observations and cannot be…
This paper mainly investigates the approximation of a global maximizer of the 1-D Monge-Kantorovich mass transfer problem through the approach of nonlinear differential equations with Dirichlet boundary. Using an approximation mechanism,…
This note aims to demonstrate that performing maximum-likelihood estimation for a mixture model is equivalent to minimizing over the parameters an optimal transport problem with entropic regularization. The objective is pedagogical: we seek…
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…
In this short note, we show that given a cost function $c$, any coupling $\pi$ of two probability measures where the second is a discrete measure can be associated to a certain bipartite graph containing a perfect matching, based on the…
We develop a full theory for the new class of Optimal Entropy-Transport problems between nonnegative and finite Radon measures in general topological spaces. They arise quite naturally by relaxing the marginal constraints typical of Optimal…
The optimal mass transport problem gives a geometric framework for optimal allocation, and has recently gained significant interest in application areas such as signal processing, image processing, and computer vision. Even though it can be…