A Rockafellar-type theorem for non-traditional costs
Shiri Artstein-Avidan, Shay Sadovsky, Katarzyna Wyczesany
TL;DR
The paper addresses the existence of a $c$-potential in optimal transport when costs may take infinite values, introducing the key concept of $c$-path-boundedness. It reduces the problem to solvability of a (potentially infinite) system of linear inequalities and distinguishes between countable and uncountable index sets, with an additional no-infinite-black-hole condition in the latter. The main result shows that a $c$-path-bounded set $G$ (countable, or without infinite black holes) is contained in the $c$-subgradient of a $c$-class function, thus extending Rockafellar-type theory to non-traditional costs; in the finite-valued case this recovers the classical Rockafellar-Rochet-Rüschendorf theorem. The work also provides an elementary proof pathway for the classical results and discusses special cases, including polar costs, clarifying when $c$-cyclic monotonicity suffices to guarantee a $c$-potential.
Abstract
In this note, we present a unified approach to the problem of existence of a potential for the optimal transport problem with respect to non-traditional cost functions, that is, costs that assume infinite values. We establish a new method that relies on proving solvability of a special (possibly infinite) family of linear inequalities. When the index set of this family is countable, we give a necessary and sufficient condition on the coefficients that assures the existence of a solution, and which, in the setting of transport theory, we call $c$-path-boundedness. In the case of an uncountable index set, one needs an additional assumption for solvability. We propose a sufficient condition in this case. We note that any set admitting a potential must be $c$-path-bounded, and this condition replaces $c$-cyclic monotonicity from the classical theory, i.e. when the cost is real-valued. Our method also gives a new and elementary proof for the classical results of Rockafellar, Rochet and Rüschendorf.
