加载中…
This paper deals with a variant of the optimal transportation problem. Given f L 1 (R d , [0, 1]) and a cost function c C(R d x R d) of the form c(x, y) = k(y – x), we minimise c d among transport plans whose first marginal is f and whose second marginal is not prescribed but constrained to be smaller than 1 – f. Denoting by (f) the infimum of this problem, we then consider the maximisation problem sup{(f) : f = m} where m > 0 is given. We prove that maximisers exist under general assumptions on k, and that for k radial, increasing and coercive these maximisers are the characteristic functions of the balls of volume m.

生成讲解博客的中文版本

生成AI智能校验的中文版本