×

Extreme points and majorization: economic applications. (English) Zbl 1480.91074

Summary: We characterize the set of extreme points of monotonic functions that are either majorized by a given function \(f\) or themselves majorize \(f\) and show that these extreme points play a crucial role in many economic design problems. Our main results show that each extreme point is uniquely characterized by a countable collection of intervals. Outside these intervals the extreme point equals the original function \(f\) and inside the function is constant. Further consistency conditions need to be satisfied pinning down the value of an extreme point in each interval where it is constant. We apply these insights to a varied set of economic problems: equivalence and optimality of mechanisms for auctions and (matching) contests, Bayesian persuasion, optimal delegation, and decision making under uncertainty.

MSC:

91B03 Mechanism design theory
91B26 Auctions, bargaining, bidding and selling, and other market models
91B68 Matching models
Full Text: DOI

References:

[1] Akbarpour, M., P.Dworczak, and S. D.Kominers (2020): “Redistributive Allocation Mechanisms,” Available at SSRN.
[2] Alonso, R., and N.Matouschek (2008): “Optimal Delegation,” The Review of Economic Studies, 75 (1), 259-293. · Zbl 1141.91354
[3] Amador, M., and K.Bagwell (2013): “The Theory of Optimal Delegation With an Application to Tariff Caps,” Econometrica, 81 (4), 1541-1599. · Zbl 1287.91106
[4] Arieli, I., Y.Babichenko, R.Smorodinsky, and T.Yamashita (2020): “Optimal Persuasion via bi‐Pooling,” Discussion paper.
[5] Border, K. (1991): “Implementation of Reduced Form Auctions: A Geometric Approach,” Econometrica, 59 (4), 1175-1187. · Zbl 0754.90018
[6] Candogan, O. (2019): “Optimality of Double Intervals in Persuasion: A Convex Programming Framework,” Available at SSRN 3452145.
[7] Che, Y. K., J.Kim, and K.Mierendorff (2013): “Generalized Reduced Form Auctions: A Network‐Flow Approach,” Econometrica, 81 (6), 2487-2520. · Zbl 1310.91069
[8] Condorelli, D. (2012): “What Money Can”t Buy: Efficient Mechanism Design With Costly Signals,” Games & Economic Behavior, 75 (2), 613-624. · Zbl 1239.91111
[9] Dahl, G. (2001): “Principal Majorization Ideals and Optimization,” Linear Algebra and its Applications, 331 (1‐3), 113-130. · Zbl 0997.52009
[10] Dahl, G. (2010): “Majorization Permutahedra and \((0, 1)\)‐Matrices,” Linear Algebra and its Applications, 432, 3265-3271. · Zbl 1218.05090
[11] Damiano, E., and H.Li (2007): “Price Discrimination and Efficient Matching,” Economic Theory, 30 (2), 243-263. · Zbl 1109.91393
[12] Dizdar, D., and E.Kovac (2020): “A Simple Proof of Strong Duality in the Linear Persuasion Problem,” Games and Economic Behavior. · Zbl 1447.91042
[13] Dworczak, P., and G.Martini (2019): “The Simple Economics of Optimal Persuasion,” Journal of Political Economy, 127 (5), 1993-2048.
[14] Fan, K., and G. G.Lorentz (1954): “An Integral Inequality,” The American Mathematical Monthly, 61 (9), 626-631. · Zbl 0057.04704
[15] Fink, A. M., and M.Jr.Jodeit (1984): “On Chebyshev”s Other Inequality,” Lecture Notes‐Monograph Series, 5. Inequalities in Statistics and Probability.
[16] Gentzkow, M., and E.Kamenica (2016): “A Rothschild‐Stiglitz Approach to Bayesian Persuasion,” American Economic Review: Papers & Proceedings, 106 (5), 597-601.
[17] Gershkov, A., and B.Moldovanu (2010): “Efficient Sequential Assignment With Incomplete Information,” Games and Economic Behavior, 68 (1), 144-154. · Zbl 1197.90277
[18] Gershkov, A., J.Goeree, A.Kushnir, B.Moldovanu, and X.Shi (2013): “On the Equivalence of Bayesian and Dominant Strategy Implementation,” Econometrica, 81 (1), 197-220. · Zbl 1274.91175
[19] Gershkov, A., B.Moldovanu, P.Strack, and M.Zhang (2019): “A Theory of Auctions With Endogenous Valuations,” Journal of Political Economy. (Forthcoming).
[20] Goeree, J., and A.Kushnir (2020): “A Geometric Approach to Mechanism Design,” Working Paper.
[21] Hardy, G. H., J. E.Littlewood, and G.Polya (1929): “Some Simple Inequalities Satisfied by Convex Functions,” Messenger Math, 58, 145-152. · JFM 55.0740.04
[22] Hart, S., and P.Reny (2015): “Implementation of Reduced Form Mechanisms: A Simple Approach and a New Characterization,” Economic Theory Bulletin, 3 (1), 1-8.
[23] Holmström, B. (1984): “On the Theory of Delegation,” in Bayesian Models in Economic Theory, ed. by M.Boyer (ed.) and R.Kihlstrom (ed.). New York: North‐Holland. · Zbl 0614.00032
[24] Hoppe, H. C., B.Moldovanu, and A.Sela (2009): “The Theory of Assortative Matching Based on Costly Signals,” The Review of Economic Studies, 76 (1), 253-281. · Zbl 1153.91690
[25] Horsley, A., and A. J.Wrobel (1987): “The Extreme Points of Some Convex Sets in the Theory of Majorization,” Investigationes Mathematicae (Proceedings A), 90 (2), 171-176. · Zbl 0632.46010
[26] Iyengar, G., and A.Kumar (2006): “Characterizing Optimal Keyword Auctions,” in Second Workshop on Sponsored Search Auctions. Ann Arbor, Michigan: Citeseer.
[27] Kartik, N., A.Kleiner, and R.Van Weelden (2020): “Delegation in Veto Bargaining,” Working Paper.
[28] Kleiner, A., B.Moldovanu, and P.Strack (2021): “Supplement to ‘Extreme Points and Majorization: Economic Applications’,” Econometrica Supplemental Material, 89, https://doi.org/10.3982/ECTA18312. · Zbl 1480.91074 · doi:10.3982/ECTA18312
[29] Kolotilin, A. (2018): “Optimal Information Disclosure: A Linear Programming Approach,” Theoretical Economics, 13, 607-635. · Zbl 1396.91040
[30] Kolotilin, A., and A.Zapechelnyuk (2019): “Persuasion Meets Delegation,” arXiv:1902.02628. Preprint.
[31] Kolotilin, A., T.Mylovanov, A.Zapechelnyuk, and M.Li (2017): “Persuasion of a Privately Informed Receiver,” Econometrica, 85, 1949-1964. · Zbl 1420.91028
[32] Kovac, E., and T.Mylovanov (2009): “Stochastic Mechanisms in Settings Without Monetary Transfers: The Regular Case,” Journal of Economic Theory, 144, 1373-1395. · Zbl 1169.91010
[33] Manelli, A., and D.Vincent (2010): “Bayesian and Dominant Strategy Implementation in the Independent, Private Values Model,” Econometrica, 78 (6), 1905-1939. · Zbl 1204.91057
[34] Maskin, E. S., and J.Riley (1984): “Optimal Auctions With Risk‐Averse Buyers,” Econometrica, 52, 1473-1518. · Zbl 0605.90043
[35] Matthews, S. A. (1984): “On the Implementability of Reduced Form Auctions,” Econometrica, 52, 1519-1522. · Zbl 0594.90020
[36] Melumad, N. D., and T.Shibano (1991): “Communication in Settings With No Transfers,” The RAND Journal of Economics, 173-198.
[37] Myerson, R. B. (1981): “Optimal Auction Design,” Mathematics of Operations Research, 6 (1), 58-73. · Zbl 0496.90099
[38] Olszewski, W., and R.Siegel (2018): “Pareto Improvements in the Contest for College Admissions,” Working Paper, Northwestern University.
[39] Phelps, R. R. (2001): Lectures on Choquet’s Theorem. Springer Science & Business Media. · Zbl 0997.46005
[40] Ryff, J. V. (1967): “Extreme Points of Some Convex Subsets of \(L_1(0, 1)\),” Proceedings of the American Mathematical Society, 18 (6), 1026-1034. · Zbl 0184.34503
[41] Saeedi, M., and A.Shourideh (2020): “Optimal Rating Design,” Working Paper.
[42] Shaked, M., and J. G.Shanthikumar (2007): Stochastic Orders. New York: Springer. · Zbl 1111.62016
[43] Strassen, V. (1965): “The Existence of Probability Measures With Given Marginals,” Mathematical Statistics, 36, 423-439. · Zbl 0135.18701
[44] Toikka, J. (2011): “Ironing Without Control,” Journal of Economic Theory, 146, 2510-2526. · Zbl 1243.91058
[45] Ülkü, L. (2013): “Optimal Combinatorial Mechanism Design,” Economic Theory, 53 (2), 473-498. · Zbl 1282.90159
[46] Vohra, R. V. (2011): Mechanism Design: A Linear Programming Approach (Vol. 47). Cambridge: Cambridge University Press. · Zbl 1233.91004
[47] Winkler, G. (1988): “Extreme Points of Moment Sets,” Mathematics of Operations Research, 13 (4), 581-587. · Zbl 0669.60009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.