Optimal transportation, topology and uniqueness
نویسندگان
چکیده
منابع مشابه
Uniqueness and Approximate Computation of Optimal Incomplete Transportation Plans∗
For α ∈ (0, 1) an α−trimming, P ∗, of a probability P is a new probability obtained by re-weighting the probability of any Borel set, B, according to a positive weight function, f ≤ 1 1−α , in the way P ∗(B) = R B f(x)P (dx). If P,Q are probability measures on Euclidean space, we consider the problem of obtaining the best L2−Wasserstein approximation between: a) a fixed probability and trimmed ...
متن کاملUniqueness and Monge Solutions in the Multimarginal Optimal Transportation Problem
We study a multimarginal optimal transportation problem. Under certain conditions on the cost function and the first marginal, we prove that the solution to the relaxed, Kantorovich version of the problem induces a solution to the Monge problem and that the solutions to both problems are unique. We also exhibit several examples of cost functions under which our conditions are satisfied, includi...
متن کاملUniqueness in Classical Absolute Topology
Let us suppose we are given an embedded element acting globally on a locally super-p-adic isometry Φ. It is well known that Z is not smaller than C . We show that Q is larger than ρ. It was Kronecker who first asked whether pointwise meromorphic, locally degenerate algebras can be studied. Is it possible to study sub-normal subgroups?
متن کاملHedonic price equilibria , stable matching , and optimal transport : equivalence , topology , and uniqueness
Hedonic pricing with quasilinear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings, and to hedonic equilibria. These assignments are shown to exist in great generality; their marginal ...
متن کاملHedonic price equilibria , stable matching , and optimal transport : equivalence , topology , and uniqueness 1
Hedonic pricing with quasilinear preferences is shown to be equivalent to stable matching with transferable utilities and a participation constraint, and to an optimal transportation (Monge-Kantorovich) linear programming problem. Optimal assignments in the latter correspond to stable matchings, and to hedonic equilibria. These assignments are shown to exist in great generality; their marginal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Sciences
سال: 2011
ISSN: 1664-3607,1664-3615
DOI: 10.1007/s13373-011-0002-7