Social Choice with Non Quasi-linear Utilities

Without monetary payments, the Gibbard-Satterthwaite theorem proves that under mild requirements all truthful social choice mechanisms must be dictatorships. When payments are allowed, the Vickrey-Clarke-Groves (VCG) mechanism implements the value-maximizing choice, and has many other good properties: it is strategy-proof, onto, deterministic, individually rational, and does not not make positive transfers to the agents. By Roberts' theorem, with three or more alternatives, the weighted VCG mechanisms are essentially unique for domains with quasi-linear utilities. The goal of this paper is to characterize domains of non-quasi-linear utilities where "reasonable'' mechanisms (with VCG-like properties) exist. Our main result is a tight characterization of the maximal non quasi-linear utility domain, which we call the largest parallel domain. We extend Roberts' theorem to parallel domains, and use the generalized theorem to prove two impossibility results. First, any reasonable mechanism must be dictatorial when the type domain is quasi-linear together with any single non-parallel type. Second, for richer utility domains that still differ very slightly from quasi-linearity, every strategy-proof, onto and deterministic mechanism must be a dictatorship.

[1]  Arunava Sen,et al.  Dictatorial domains , 2003 .

[2]  Ehud Kalai,et al.  Social welfare functions when preferences are convex, strictly monotonic, and continuous , 1979 .

[3]  Michal Feldman,et al.  Mechanism design on discrete lines and cycles , 2012, EC '12.

[4]  Paul Dütting,et al.  Bidder optimal assignments for general utilities , 2013, Theor. Comput. Sci..

[5]  D. Black On the Rationale of Group Decision-making , 1948, Journal of Political Economy.

[6]  A. Gibbard Manipulation of Voting Schemes: A General Result , 1973 .

[7]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[8]  Rodney Garratt,et al.  Efficient Bilateral Trade , 2015, EAI Endorsed Trans. Serious Games.

[9]  S. Bikhchandani,et al.  Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation , 2006 .

[10]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[11]  Debasis Mishra,et al.  Mechanism Design Without Quasilinearity , 2017, Theoretical Economics.

[12]  Yvonne Schuhmacher,et al.  Mechanism Design A Linear Programming Approach , 2016 .

[13]  Shigehiro Serizawa,et al.  Efficiency and strategy-proofness in object assignment problems with multi-demand preferences , 2015, Soc. Choice Welf..

[14]  G. Loewenstein,et al.  Time Discounting and Time Preference: A Critical Review , 2002 .

[15]  Noam Nisan,et al.  Multi-unit auctions with budget limits , 2012, Games Econ. Behav..

[16]  David C. Parkes,et al.  Social Choice for Agents with General Utilities , 2016, IJCAI.

[17]  David C. Parkes,et al.  Contingent Payment Mechanisms to Maximize Resource Utilization , 2016, ArXiv.

[18]  Shigehiro Serizawa,et al.  Strategy-proofness and efficiency with non-quasi-linear preferences: A characterization of minimum price Walrasian rule: Strategy-proofness and efficiency , 2015 .

[19]  Anup Pramanik,et al.  Further results on dictatorial domains , 2014, Soc. Choice Welf..

[20]  E. Maskin,et al.  Optimal Auctions with Risk Averse Buyers , 1984 .

[21]  Valentin Robu,et al.  Incentivizing Reliability in Demand-Side Response , 2016, IJCAI.

[22]  Noam Nisan,et al.  Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[23]  Ian L. Gale,et al.  Assigning Resources to Budget-Constrained Agents , 2013 .

[24]  J. Rochet A necessary and sufficient condition for rationalizability in a quasi-linear context , 1987 .

[25]  Klaus Nehring,et al.  The structure of strategy-proof social choice - Part I: General characterization and possibility results on median spaces , 2007, J. Econ. Theory.

[26]  Kamal Jain,et al.  Competitive Equilibria in Two Sided Matching Markets with Non-transferable Utilities , 2012 .

[27]  Noam Nisan,et al.  Two simplified proofs for Roberts’ theorem , 2009, Soc. Choice Welf..

[28]  D. Gale,et al.  The Strategy Structure of Two Sided Matching Markets , 1985 .

[29]  Michael E. Saks,et al.  Weak monotonicity suffices for truthfulness on convex domains , 2005, EC '05.

[30]  S. Muthukrishnan,et al.  General auction mechanism for search advertising , 2008, WWW '09.

[31]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[32]  P. Cramton The FCC Spectrum Auctions: An Early Assessment , 1997 .

[33]  Shin Sato,et al.  Circular domains , 2010 .

[34]  E. H. Clarke Multipart pricing of public goods , 1971 .

[35]  M. Satterthwaite Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .

[36]  Salvador Barberà,et al.  An introduction to strategy-proof social choice functions , 2001, Soc. Choice Welf..

[37]  Vijay Krishna,et al.  Efficient Mechanism Design , 1998 .

[38]  Rakesh V. Vohra,et al.  Strategy-proof Location on a Network , 2002, J. Econ. Theory.

[39]  Joseph Y. Halpern,et al.  Optimizing scrip systems: efficiency, crashes, hoarders, and altruists , 2007, EC '07.

[40]  Rakesh V. Vohra,et al.  Optimal auctions with financially constrained buyers , 2008, J. Econ. Theory.

[41]  H. Moulin On strategy-proofness and single peakedness , 1980 .

[42]  Brian Baisa,et al.  Efficient Multi-Unit Auctions for Normal Goods , 2019 .

[43]  J. Pratt RISK AVERSION IN THE SMALL AND IN THE LARGE11This research was supported by the National Science Foundation (grant NSF-G24035). Reproduction in whole or in part is permitted for any purpose of the United States Government. , 1964 .

[44]  R. Vohra Mechanism Design: A Linear Programming Approach , 2011 .

[45]  Kamal Jain,et al.  Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions , 2016, Oper. Res..

[46]  Brian Baisa,et al.  Auction Design Without Quasilinear Preferences , 2013 .