2000 character limit reached
Kantorovich's Mass Transport Problem for Capacities
Published 7 Jul 2019 in math.CA | (1907.03749v4)
Abstract: The aim of the present paper is to extend Kantorovich's mass transport problem to the framework of upper/lower continuous capacities and to prove the cyclic monotonicity of the supports of optimal supermodular plans. As in the probabilistic case, this easily yields the corresponding extension of the Kantorovich duality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.