2011
DOI: 10.1007/s13373-011-0002-7
|View full text |Cite
|
Sign up to set email alerts
|

Optimal transportation, topology and uniqueness

Abstract: The Monge-Kantorovich transportation problem involves optimizing with respect to a given a cost function. Uniqueness is a fundamental open question about which little is known when the cost function is smooth and the landscapes Communicated by N. Trudinger. Formerly titled Extremal doubly stochastic measures and optimal transportation.It is a pleasure to thank Nassif Ghoussoub and Herbert Kellerer, who provided early encouragement in this direction, and Pierre-Andre Chiappori, Ivar Ekeland, and Lars Nesheim, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
34
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 33 publications
(36 citation statements)
references
References 96 publications
1
34
0
Order By: Relevance
“…At the end of the preceding section we identified a natural candidate for this iso-husband set: namely the potential indifference set which divides the mass of µ in the same ratio as y divides ν; whether or not these natural candidates actually fit together to form the level sets of a function F or not depends on a subtle interaction between µ, ν and s. When they do, we say the model is nested, and in that case we show that the resulting function F : X −→ Y produces the unique optimizer γ = (id × F ) # µ for (1). Note that except in the Lorentz/Becker/Mirrlees/Spence case m = 1 = n, this nestedness depends not only on s, but also on µ and ν.…”
Section: Multi-to-one Dimensional Matchingmentioning
confidence: 84%
See 3 more Smart Citations
“…At the end of the preceding section we identified a natural candidate for this iso-husband set: namely the potential indifference set which divides the mass of µ in the same ratio as y divides ν; whether or not these natural candidates actually fit together to form the level sets of a function F or not depends on a subtle interaction between µ, ν and s. When they do, we say the model is nested, and in that case we show that the resulting function F : X −→ Y produces the unique optimizer γ = (id × F ) # µ for (1). Note that except in the Lorentz/Becker/Mirrlees/Spence case m = 1 = n, this nestedness depends not only on s, but also on µ and ν.…”
Section: Multi-to-one Dimensional Matchingmentioning
confidence: 84%
“…For example, is there a map F : X −→ Y such that γ vanishes outside Graph(F ), and if so, what can be said about its analytical and geometric properties? Such a map is called a Monge or pure solution, deterministic coupling, matching function or optimal map, and we have γ = (id×F ) # µ where id denotes the identity map on X in that case [1]. More generally, if F : X −→ Y is any µ-measurable map, we define the push-forward F # µ of µ through F by…”
Section: Setting and Background Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In particular, 2-fold stochastic measures (better known as doubly stochastic measures) represent an infinitedimensional generalization of doubly stochastic matrices and originated from an idea by Birkhoff (1948, Problem 111). Notably, such measures also appear in several problems connected with optimal transportation (Ahmad et al, 2009;Gangbo and McCann, 2000;Rachev and Rüschendorf, 1998).…”
Section: Definitions and Basic Propertiesmentioning
confidence: 99%