Optimal Pricing for Optimal Transport

被引:0
作者
Sedi Bartz
Simeon Reich
机构
[1] The Technion – Israel Institute of Technology,Department of Mathematics
来源
Set-Valued and Variational Analysis | 2014年 / 22卷
关键词
Abstract convexity; -convex function; Convex antiderivative; Cyclic monotonicity; Kantorovich duality; Lipschitz extension; Monopoly; Optimal price; Optimal transport; Principal-agent; Subdifferential; Transport plan; 26A16; 26A51; 47H04; 49N15; 49Q20; 52A01; 58E30; 90B06; 91B24;
D O I
暂无
中图分类号
学科分类号
摘要
Suppose that c(x, y) is the cost of transporting a unit of mass from x ∈ X to y ∈ Y and suppose that a mass distribution μ on X is transported optimally (so that the total cost of transportation is minimal) to the mass distribution ν on Y. Then, roughly speaking, the Kantorovich duality theorem asserts that there is a price f(x) for a unit of mass sold (say by the producer to the distributor) at x and a price g(y) for a unit of mass sold (say by the distributor to the end consumer) at y such that for any x ∈ X and y ∈ Y, the price difference g(y) − f(x) is not greater than the cost of transportation c(x, y) and such that there is equality g(y) − f(x) = c(x, y) if indeed a nonzero mass was transported (via the optimal transportation plan) from x to y. We consider the following optimal pricing problem: suppose that a new pricing policy is to be determined while keeping a part of the optimal transportation plan fixed and, in addition, some prices at the sources of this part are also kept fixed. From the producers’ side, what would then be the highest compatible pricing policy possible? From the consumers’ side, what would then be the lowest compatible pricing policy possible? We have recently introduced and studied settings in c-convexity theory which gave rise to families of c-convex c-antiderivatives, and, in particular, we established the existence of optimal c-convex c-antiderivatives and explicit constructions of these optimizers were presented. In applications, it has turned out that this is a unifying language for phenomena in analysis which used to be considered quite apart. In the present paper we employ optimal c-convex c-antiderivatives and conclude that these are natural solutions to the optimal pricing problems mentioned above. This type of problems drew attention in the past and existence results were previously established in the case where X = Y = ℝn under various specifications. We solve the above problem for general spaces X, Y and real-valued, lower semicontinuous cost functions c. Furthermore, an explicit construction of solutions to the general problem is presented.
引用
收藏
页码:467 / 481
页数:14
相关论文
共 16 条
  • [1] Bartz S(2011)Minimal antiderivatives and monotonicity Nonlinear Anal. 74 59-66
  • [2] Reich S(2012)Abstract convex optimal antiderivatives Ann. Inst. Henri Poincaré 29 435-454
  • [3] Bartz S(1986)Harmonic maps with defects Commun. Math. Phys. 107 649-705
  • [4] Reich S(2010)Optimal spatial pricing strategies with transportation costs Contemp. Math. 514 105-121
  • [5] Brezis H(2011)When is multidimensional screening a convex program? J. Econ. Theory 146 454-478
  • [6] Coron J-M(1934)Extension of range of functions Bull. Am. Math. Soc. 40 837-842
  • [7] Lieb EH(1970)Inf-convolution, sous-additivité, convexité des fonctions numériques J. Math. Pure Appl. 49 109-154
  • [8] Buttazzo G(1966)Characterization of the subdifferentials of convex functions Pac. J. Math. 17 497-510
  • [9] Carlier G(1934)Analytic extensions of differentiable functions defined in closed sets Trans. Am. Math. Soc. 36 63-89
  • [10] Figalli A(undefined)undefined undefined undefined undefined-undefined