G T ] 2 5 A pr 2 01 8 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 make positive transfers to the agents. By Roberts’ theorem, with three or more alternatives, the weighted VCG mechanisms are essentially unique for domains with quasilinear 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 utility 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]  Brian Baisa,et al.  Efficient Multi-Unit Auctions for Normal Goods , 2019 .

[2]  C. Horioka,et al.  Marginal Returns to Schooling and Education Policy Change in Japan , 2012 .

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

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

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

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

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

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

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

[10]  Shigehiro Serizawa,et al.  Strategy-Proofness and Efficiency with Nonquasi-Linear Preferences: A Characterization of Minimum Price Walrasian Rule , 2012 .

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

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

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

[14]  Noam Nisan,et al.  Multi-unit Auctions with Budget Limits , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

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

[17]  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.

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

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

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

[21]  M. Hellwig Risk Aversion in the Small and in the Large. When Outcomes are Multidimensional , 2004 .

[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]  Rakesh V. Vohra,et al.  Strategy-proof Location on a Network , 2002, J. Econ. Theory.

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

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

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

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

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

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

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

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

[32]  M. Satterthwaite,et al.  Strategy-proofness and single-peakedness , 1976 .

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

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

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

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

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

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

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

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

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