Optimal measure transportation with respect to non-traditional costs
Shiri Artstein-Avidan, Shay Sadovsky, Katarzyna Wyczesany

TL;DR
This paper investigates optimal mass transport problems with non-traditional costs that can be infinite, establishing conditions for the existence of optimal plans and potentials, and providing proofs under different assumptions including a novel approach for discrete measures.
Contribution
It introduces the notions of $c$-compatibility and strong-$c$-compatibility, and proves the existence of potentials for optimal plans under these conditions, including a new constructive method using Hall polytopes.
Findings
Finite-cost plans imply $c$-compatibility of measures.
Strong $c$-compatibility ensures the existence of a potential for optimal plans.
A new constructive proof using Hall polytopes is provided for discrete measures.
Abstract
We study optimal mass transport problems between two measures with respect to a non-traditional cost function, i.e. a cost which can attain the value . We define the notion of -compatibility and strong--compatibility of two measures, and prove that if there is a finite-cost plan between the measures then the measures must be -compatible, and if in addition the two measures are strongly -compatible, then there is an optimal plan concentrated on a -subgradient of a -class function. This function is the so-called potential of the plan. We give two proofs of this theorem, under slightly different assumptions. In the first we utilize the notion of -path-boundedness, showing that strong -compatibility implies a strong connectivity result for a directed graph associated with an optimal map. Strong connectivity of the graph implies that the -cyclic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Facility Location and Emergency Management · Fixed Point Theorems Analysis
