2000 character limit reached
Transport Problems and Disintegration Maps
Published 17 Jul 2012 in math.OC | (1207.4026v1)
Abstract: By disintegration of transport plans it is introduced the notion of transport class. This allows to consider the Monge problem as a particular case of the Kantorovich transport problem, once a transport class is fixed. The transport problem constrained to a fixed transport class is equivalent to an abstract Monge problem over a Wasserstein space of probability measures. Concerning solvability of this kind of constrained problems, it turns out that in some sense the Monge problem corresponds to a lucky case.
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.