Roberts Theorem with Neutrality. A Social Welfare Ordering Approach
|
|
- Valentine Walton
- 5 years ago
- Views:
Transcription
1 : A Approach Indian Statistical Institute (ISI) joint work with Arunava Sen, ISI
2 Introduction The Problem Reformulating the Problem Main Result Objectives of this research Characterize (dominant strategy) implementable social choice functions in quasi-linear environments when agents have multidimensional types. Restricted domains. Motivations Auctioning multiple objects. Choosing a public facility for a city from various possibilities - opera house, park, school, museum etc.
3 Introduction The Problem Reformulating the Problem Main Result Objectives of this research Characterize (dominant strategy) implementable social choice functions in quasi-linear environments when agents have multidimensional types. Restricted domains. Motivations Auctioning multiple objects. Choosing a public facility for a city from various possibilities - opera house, park, school, museum etc.
4 Basic Notation The Problem Reformulating the Problem Main Result Finite set of m alternatives: A = {a,b,c,...}. Assume m 3. Set of agents N = {1,2,...,n}. Type (private information) of agent i: t i = (ti a,tb i,...,) - a vector in R m. Type profile of agents: t (n m matrix) - n vectors in R m. The column vector t a is called the utility vector for alternative a.
5 The Problem Reformulating the Problem Main Result The Domain - m-dimensional Open Interval We assume that the type of agent i lies in T i = (α i,β i ) m, where α i R { } and β i R { }. This implies that the domain of type profile of agents is T n = i N T i = i N (α i,β i ) m R m n. Let D R n be the set of all possible utility vectors for any allocation - note that it is an open rectangle in R n. If T i = R m for all i (or equivalently, D = R n ), we call it the unrestricted domain.
6 An Illustration The Problem Reformulating the Problem Main Result Agent 2 - (1,3) m Domain of utility vectors: D (1,3) (1,1) a c b (4,3) (4,1) Agent 1 - (1,4) m
7 Dominant Strategy Implementation The Problem Reformulating the Problem Main Result A social choice function (SCF) is a mapping f : T n A. A payment function (of agent i) is a mapping p i : T n R, where p i (t) denotes the payment of agent i at t T n. Definition A social choice function f is implementable if there exists payment functions (p 1,...,p n ) such that for all i N and for all t i T i t f (t) i + p i (t) t f (s i,t i ) i + p i (s i,t i ) s i,t i T i. What social choice functions are implementable?
8 Dominant Strategy Implementation The Problem Reformulating the Problem Main Result A social choice function (SCF) is a mapping f : T n A. A payment function (of agent i) is a mapping p i : T n R, where p i (t) denotes the payment of agent i at t T n. Definition A social choice function f is implementable if there exists payment functions (p 1,...,p n ) such that for all i N and for all t i T i t f (t) i + p i (t) t f (s i,t i ) i + p i (s i,t i ) s i,t i T i. What social choice functions are implementable?
9 Monotonicity Characterizations The Problem Reformulating the Problem Main Result Rochet (1987, J. Math. Econ.) gave a characterization in terms of cycle monotonicity - works in any domain. Bikhchandani et al. (2006, Econometrica) gave a characterization in terms of a weak monotonicity (2-cycle monotonicity) - works in convex domains (auction domains are covered). Monotonicity characterizations do not say much about the functional form of the implementable SCF.
10 A Property of Implementable SCFs The Problem Reformulating the Problem Main Result Definition A social choice function f satisfies positive association of differences (PAD) if for every s,t T n such that f (t) = a with s a t a s b t b for all b a, we have f (s) = a. Lemma (Roberts, 1979, Book Chapter) Every implementable social choice function satisfies PAD. Weak monotonicity implies PAD - but the converse is not true in general. In auction domains, every SCF satisfies PAD - so PAD does not imply implementability in restricted domains.
11 Roberts Theorem - Affine Maximizers The Problem Reformulating the Problem Main Result Definition A social choice function f satisfies non-imposition if for every a A, there exists t T n such that f (t) = a. Theorem (Roberts, 1979, Book Chapter) Suppose D = R n (unrestricted domain). If f is an implementable social choice function which satisfies non-imposition, then there exists weights λ R n + \ {0} and a deterministic real-valued function κ : A R such that for all t T n, [ f (t) arg max λ i ti a κ(a) ] a A i N
12 The Problem Reformulating the Problem Main Result Payment Functions - Generalized Groves Payments If f is an affine maximizer (λ,κ), then consider the payment rule p as follows. For every i N and every t T n, if λ i = 0 then p i (t) = 0, else, p i (t) = h i (t i ) 1 λ i [ j i λ j t f (t) i + κ(f (t)) ], where h i : T i R is any arbitrary function.
13 Main Open Question The Problem Reformulating the Problem Main Result Under what subdomains can one derive a functional form of implementable social choice functions?
14 The Problem Reformulating the Problem Main Result Non-Affine Maximizers in Bounded Domains Let N = {1,2} and A = {a,b,c}. Suppose T 1 = T 2 = (0,1) 3 (alternatively, suppose D = (0,1) 2 ). Consider the following allocation rule f. Let T g = {(t 1,t 2 ) T 2 : t c 1 < tb } {(t 1,t 2 ) T 2 : t c 2 > tb 2 0.5}. Then, { arg max{ t a f (t 1,t 2 ) = 1 + t2 a,tb 1 + tb 2,tc 1 + tc 2 } (t 1,t 2 ) T g c otherwise. f satisfies non-imposition and is implementable but not an affine maximizer.
15 The Problem Reformulating the Problem Main Result Neutrality and Weighted Welfare Maximizers Definition A social choice function f is neutral if for every type profile t T n and for all permutations on A such that t s, where s is the type profile due to permutation, we have (f (t)) = f (s). Neutrality implies non-imposition. Theorem (Roberts, 1979, Book Chapter) Suppose T i = R m for all i N (unrestricted domain). If f is an implementable and neutral social choice function, then there exists weights λ R n + \ {0} such that for all t Tn, f (t) arg max a A [ λ i ti a ] i N
16 New Open Question The Problem Reformulating the Problem Main Result Under what subdomains does Roberts theorem with neutrality hold?
17 Our Answer The Problem Reformulating the Problem Main Result Theorem Suppose T i is an m-dimensional open interval and f is a neutral social choice function. The SCF f is implementable if and only if there exists weights λ R n + \ {0} such that for all t T n, f (t) arg max a A [ λ i ti a ] i N
18 A Plausible Conjecture is False The Problem Reformulating the Problem Main Result Every domain where every neutral and implementable SCF is a weighted welfare maximizer is also a domain where every implementable SCF is an affine maximizer. This is false - earlier example and our result.
19 A Plausible Conjecture is False The Problem Reformulating the Problem Main Result Every domain where every neutral and implementable SCF is a weighted welfare maximizer is also a domain where every implementable SCF is an affine maximizer. This is false - earlier example and our result.
20 Auction Domains not Covered The Problem Reformulating the Problem Main Result Our results do not apply to auction domains because of many reasons: Auction domains are not open - not even full-dimensional. Neutrality is not appropriate in auction domains.
21 A Possible Application The Problem Reformulating the Problem Main Result A city plans to choose one of the public facilities from a finite set of possibilities (building a park, opera house, or museum). The city planner is neutral about the project to choose. Each agent (citizen) has value for each project, which may respect our domain assumption.
22 A Approach Step 1 Every implementable and neutral SCF induces an ordering on D. Step 2 This ordering satisfies three axioms: weak Pareto, invariance, and continuity. Step 3 Every ordering which satisfies these axioms can be represented as weighted welfare maximizers.
23 Illustration of the Approach Agent 2 - (1,3) m Domain of utility vectors: D a c b Agent 1 - (1,4) m
24 Illustration of the Approach Agent 2 - (1,3) m Domain of utility vectors: D a c b Agent 1 - (1,4) m
25 Illustration of the Approach Agent 2 - (1,3) m Domain of utility vectors: D a c b Agent 1 - (1,4) m
26 Illustration of the Approach Agent 2 - (1,3) m Domain of utility vectors: D Neutral SCF: λ 1 = 1,λ 2 = 2 a c b Agent 1 - (1,4) m
27 Final Comments Using the proof with neutrality, we prove the general (affine maximizer) version of Roberts theorem. Main idea: to generate from any SCF a new SCF which is neutral. Anonymity gives efficiency.
28 Many Proofs of Roberts Theorem (for Unrestricted Domains) Roberts original proof (Roberts, 1979, Book Chapter). Lavi, Mualem, Nisan (2009, Soc. Cho. Welfare; 2003 Conference Paper) - similar to but simpler than Roberts original proof. Dobzinski and Nisan (2009 Conference Paper) - in the spirit of Barbera and Peleg s proof of Gibbard-Satterthwaite Theorem. Vohra (2008, Mimeo) - similar to Roberts original proof. Jehiel, Meyer-ter-Vehn, and Moldovanu (2008, Econ. Theory) - for interdependent values model. Carbajal and Tourky (2009, Mimeo) - for arbitrary continuous value functions.
29 Explaining Step 1 Step 1 Every implementable and neutral SCF induces an ordering on D. Step 2 This ordering satisfies three axioms: weak Pareto, invariance, and continuity. Step 3 Every ordering which satisfies these axioms can be represented as weighted welfare maximizers.
30 A Choice Set Definition The choice set of an SCF f at every type profile t is C f (t) = {a A : ε 0,f (t a + ε,t a ) = a}. Lemma If f is implementable and D is open from above, then for all type profiles t, f (t) C f (t).
31 Definition A social welfare ordering (SWO) R f induced by a social choice function f is a binary relation on D defined as follows. The symmetric component of R f is denoted by I f and the antisymmetric component of R f is denoted by P f. Pick x,y D. We say xp f y if and only if there exists a profile t with t a = x and t b = y for some a,b A such that a C f (t) but b / C f (t). We say xi f y if and only if there exists a profile t with t a = x and t b = y for some a,b A such that a,b C f (t).
32 R f is an Ordering Proposition Suppose f is an implementable and neutral social choice function and D is open from above and a meet semi-lattice. Then, R f induced by f on D is an ordering.
33 Explaining Step 2 Step 1 Every implementable and neutral SCF induces an ordering on D. Step 2 This ordering satisfies three axioms: weak Pareto, invariance, and continuity. Step 3 Every ordering which satisfies these axioms can be represented as weighted welfare maximizers.
34 Three Axioms for an Ordering Definition An ordering R on D satisfies weak Pareto (WP) if for all x,y D with x y we have xpy. Definition An ordering R on D satisfies invariance (INV) if for all x,y D and all z R n such that (x + z),(y + z) D we have xpy implies (x + z)p(y + z) and xiy implies (x + z)i(y + z). Definition An ordering R on D satisfies continuity (C) if for all x D, the sets U x = {y D : yrx} and L x = {y D : xry} are closed in R n.
35 Three Axioms for an Ordering Definition An ordering R on D satisfies weak Pareto (WP) if for all x,y D with x y we have xpy. Definition An ordering R on D satisfies invariance (INV) if for all x,y D and all z R n such that (x + z),(y + z) D we have xpy implies (x + z)p(y + z) and xiy implies (x + z)i(y + z). Definition An ordering R on D satisfies continuity (C) if for all x D, the sets U x = {y D : yrx} and L x = {y D : xry} are closed in R n.
36 Three Axioms for an Ordering Definition An ordering R on D satisfies weak Pareto (WP) if for all x,y D with x y we have xpy. Definition An ordering R on D satisfies invariance (INV) if for all x,y D and all z R n such that (x + z),(y + z) D we have xpy implies (x + z)p(y + z) and xiy implies (x + z)i(y + z). Definition An ordering R on D satisfies continuity (C) if for all x D, the sets U x = {y D : yrx} and L x = {y D : xry} are closed in R n.
37 An SWO Satisfies these Axioms Proposition Suppose f is an implementable and neutral social choice function and D is open from above and a meet semi-lattice. Then the social welfare ordering R f induced by f on D satisfies weak Pareto, invariance, and continuity.
38 Explaining Step 3 Step 1 Every implementable and neutral SCF induces an ordering on D. Step 2 This ordering satisfies three axioms: weak Pareto, invariance, and continuity. Step 3 Every ordering which satisfies these axioms can be represented as weighted welfare maximizers.
39 Characterizing the Ordering Suppose an ordering on D satisfies WP, INV, and C. Can we say anything about the ordering? When D = R n, there is ample literature - see d Aspremont and Gevers (2002, Book Chapter). Proposition (Blackwell and Girshick (1954, Book)) Suppose an ordering R on R n satisfies weak Pareto, invariance, and continuity. Then there exists weights λ R n + \ {0} and for all x,y R n xry i N λ i x i i N λ i y i.
40 Characterizing the Ordering Suppose an ordering on D satisfies WP, INV, and C. Can we say anything about the ordering? When D = R n, there is ample literature - see d Aspremont and Gevers (2002, Book Chapter). Proposition (Blackwell and Girshick (1954, Book)) Suppose an ordering R on R n satisfies weak Pareto, invariance, and continuity. Then there exists weights λ R n + \ {0} and for all x,y R n xry i N λ i x i i N λ i y i.
41 Our Ordering Characterization in Restricted Domains Proposition Suppose D is open and convex and let R be an ordering on D which satisfies weak Pareto, invariance, and continuity. Then there exists weights λ R n + \ {0} and for all x,y D xry i N λ i x i i N λ i y i.
Roberts Theorem with Neutrality. A Social Welfare Ordering Approach
: A Social Welfare Ordering Approach Indian Statistical Institute joint work with Arunava Sen, ISI Outline Objectives of this research Characterize (dominant strategy) implementable social choice functions
More informationMechanism Design with Two Alternatives in Quasi-Linear Environments
Mechanism Design with Two Alternatives in Quasi-Linear Environments Thierry Marchant and Debasis Mishra June 25, 2013 Abstract We study mechanism design in quasi-linear private values environments when
More informationMechanism Design with Two Alternatives in Quasi-Linear Environments
Mechanism Design with Two Alternatives in Quasi-Linear Environments Thierry Marchant and Debasis Mishra July 7, 2014 Abstract We study mechanism design in quasi-linear private values environments when
More informationRoberts Theorem with Neutrality: A Social Welfare Ordering Approach
Roberts Theorem with Neutrality: A Social Welfare Ordering Approach arxiv:1003.1550v1 [cs.gt] 8 Mar 2010 Debasis Mishra and Arunava Sen May 25, 2018 Abstract We consider dominant strategy implementation
More informationSeparability and decomposition in mechanism design with transfers
Separability and decomposition in mechanism design with transfers Debasis Mishra, Swaprava Nath, and Souvik Roy August 9, 2017 Abstract In private values quasi-linear environment, we consider problems
More informationMonotonicity and Implementability
Monotonicity and Implementability Itai Ashlagi Mark Braverman Avinatan Hassidim Dov Monderer Abstract Consider an environment with a finite number of alternatives, and agents with private values and quasi-linear
More informationMechanism Design and Truthful Algorithms
Mechanism Design and Truthful Algorithms Ocan Sankur 13/06/2013 Ocan Sankur (ULB) Mechanism Design and Truthful Algorithms June 13, 2013 1 / 25 Mechanism Design Mechanism design is about designing games
More informationIntroduction to Mechanism Design
Introduction to Mechanism Design Xianwen Shi University of Toronto Minischool on Variational Problems in Economics September 2014 Introduction to Mechanism Design September 2014 1 / 75 Mechanism Design
More informationOn the Equivalence of Bayesian and Dominant Strategy Implementation in a General Class of Social Choice Problems
University of Zurich Department of Economics Working Paper Series ISSN 664-704 print) ISSN664-705Xonline) Working Paper No. On the Equivalence of Bayesian and Dominant Strategy Implementation in a General
More informationCowles Foundation for Research in Economics at Yale University
Cowles Foundation for Research in Economics at Yale University Cowles Foundation Discussion Paper No. 1846 EFFICIENT AUCTIONS AND INTERDEPENDENT TYPES Dirk Bergemann, Stephen Morris, and Satoru Takahashi
More informationVickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer
More informationAffine Maximizers in Domains with Selfish Valuations
Affine Maximizers in Domains with Selfish Valuations Swaprava Nath 1 and Arunava Sen 1 1 Indian Statistical Institute, New Delhi February 25, 2015 Abstract We consider the domain of selfish and continuous
More informationMAXIMAL POSSIBILITY AND MINIMAL DICTATORIAL COVERS OF DOMAINS
MAXIMAL POSSIBILITY AND MINIMAL DICTATORIAL COVERS OF DOMAINS Gopakumar Achuthankutty 1 and Souvik Roy 1 1 Economic Research Unit, Indian Statistical Institute, Kolkata Abstract In line with the works
More informationContinuous Cardinal Incentive Compatible Mechanisms are Ordinal
Continuous Cardinal Incentive Compatible Mechanisms are Ordinal Lars Ehlers, Dipjyoti Majumdar, Debasis Mishra, and Arunava Sen October 25, 2014 Abstract We show that every cardinal incentive compatible
More informationIndividual and Social Choices
Individual and Social Choices Ram Singh Lecture 17 November 07, 2016 Ram Singh: (DSE) Social Choice November 07, 2016 1 / 14 Preferences and Choices I Let X be the set of alternatives R i be the weak preference
More informationMechanism Design without Quasilinearity
Mechanism Design without Quasilinearity Tomoya Kazumura Graduate School of Economics, Osaka University Debasis Mishra Indian Statistical Institute, Delhi Shigehiro Serizawa ISER, Osaka University September
More informationNOTES AND COMMENTS WEAK MONOTONICITY CHARACTERIZES DETERMINISTIC DOMINANT-STRATEGY IMPLEMENTATION
Econometrica, Vol. 74, No. 4 (July, 2006), 1109 1132 NOTES AND COMMENTS WEAK MONOTONICITY CHARACTERIZES DETERMINISTIC DOMINANT-STRATEGY IMPLEMENTATION BY SUSHIL BIKHCHANDANI,SHUROJIT CHATTERJI,RON LAVI,
More informationA Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations
A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations Swaprava Nath a, Onno Zoeter b a Indian Institute of Science, Bangalore b Xerox Research Centre Europe, Meylan, France Abstract
More informationIncentive-Compatible Voting Rules with Positively Correlated Beliefs
Incentive-Compatible Voting Rules with Positively Correlated Beliefs Mohit Bhargava, Dipjyoti Majumdar and Arunava Sen August 13, 2014 Abstract We study the consequences of positive correlation of beliefs
More informationComparing impossibility theorems
Comparing impossibility theorems Randy Calvert, for Pol Sci 507 Spr 2017 All references to A-S & B are to Austen-Smith and Banks (1999). Basic notation X set of alternatives X set of all nonempty subsets
More informationMechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization
1 Mechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization 2 Outline Classical mechanism design Preliminaries (DRMs, revelation
More informationA Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations
A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations Swaprava Nath 1 and Onno Zoeter 2 1 Indian Institute of Science, Bangalore 2 Xerox Research Centre Europe, Meylan, France May
More informationContinuity and Incentive Compatibility in Cardinal Voting Mechanisms
Continuity and Incentive Compatibility in Cardinal Voting Mechanisms Lars Ehlers Dipjyoti Majumdar Debasis Mishra and Arunava Sen November 11, 2016 Abstract We show that every cardinal incentive compatible
More informationArrow s Impossibility Theorem: Preference Diversity in a Single-Profile World
Arrow s Impossibility Theorem: Preference Diversity in a Single-Profile World Brown University Department of Economics Working Paper No. 2007-12 Allan M. Feldman Department of Economics, Brown University
More informationNon-Manipulable Domains for the Borda Count
Non-Manipulable Domains for the Borda Count Martin Barbie, Clemens Puppe * Department of Economics, University of Karlsruhe D 76128 Karlsruhe, Germany and Attila Tasnádi ** Department of Mathematics, Budapest
More informationOptimal Mechanism Design without Money
Optimal Mechanism Design without Money Alex Gershkov, Benny Moldovanu and Xianwen Shi January, 013 Abstract We consider the standard mechanism design environment with linear utility but without monetary
More information2 Making the Exponential Mechanism Exactly Truthful Without
CIS 700 Differential Privacy in Game Theory and Mechanism Design January 31, 2014 Lecture 3 Lecturer: Aaron Roth Scribe: Aaron Roth Privacy as a Tool for Mechanism Design for arbitrary objective functions)
More informationCoalitionally strategyproof functions depend only on the most-preferred alternatives.
Coalitionally strategyproof functions depend only on the most-preferred alternatives. H. Reiju Mihara reiju@ec.kagawa-u.ac.jp Economics, Kagawa University, Takamatsu, 760-8523, Japan April, 1999 [Social
More informationTheory of Mechanism Design
Theory of Mechanism Design Debasis Mishra 1 October 28, 2015 1 Economics and Planning Unit, Indian Statistical Institute, 7 Shahid Jit Singh Marg, New Delhi 110016, India, E-mail: dmishra@isid.ac.in 2
More informationExtending characterizations of truthful mechanisms from subdomains to domains.
Extending characterizations of truthful mechanisms from subdomains to domains. Angelina Vidali angelina.vidali@univie.ac.at Theory and Applications of Algorithms Research Group University of Vienna, Austria
More informationHans Peters, Souvik Roy, Soumyarup Sadhukhan, Ton Storcken
Hans Peters, Souvik Roy, Soumyarup Sadhukhan, Ton Storcken An Extreme Point Characterization of Strategyproof and Unanimous Probabilistic Rules over Binary Restricted Domains RM/16/012 An Extreme Point
More informationTighter Bounds for Facility Games
Tighter Bounds for Facility Games Pinyan Lu 1, Yajun Wang 1, and Yuan Zhou 1 Microsoft Research Asia {pinyanl, yajunw}@microsoft.com Carnegie Mellon University yuanzhou@cs.cmu.edu Abstract. In one dimensional
More informationMicro II. Benny Moldovanu. Summer Term University of Bonn. Benny Moldovanu (University of Bonn) Micro II Summer Term / 109
Micro II Benny Moldovanu University of Bonn Summer Term 2015 Benny Moldovanu (University of Bonn) Micro II Summer Term 2015 1 / 109 Quasi-Linear Utility x = (k, t 1,.., t I ), where: k K (physical outcomes,
More informationGame Theory: Spring 2017
Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise
More informationOn Domains That Admit Well-behaved Strategy-proof Social Choice Functions
On Domains That Admit Well-behaved Strategy-proof Social Choice Functions Shurojit Chatterji, Remzi Sanver and Arunava Sen May 2010 Paper No. 07-2010 ANY OPINIONS EXPRESSED ARE THOSE OF THE AUTHOR(S) AND
More informationMotivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred.
Motivation Game Theory 24. Mechanism Design Preference relations contain no information about by how much one candidate is preferred. Idea: Use money to measure this. Albert-Ludwigs-Universität Freiburg
More informationThe Dimensions of Consensus
The Dimensions of Consensus Alex Gershkov Benny Moldovanu Xianwen Shi Hebrew and Surrey Bonn Toronto February 2017 The Dimensions of Consensus February 2017 1 / 1 Introduction Legislatures/committees vote
More informationVickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference
More informationOrdinal Bayesian Incentive Compatibility in Restricted Domains
Ordinal Bayesian Incentive Compatibility in Restricted Domains Debasis Mishra October 12, 2015 Abstract We study deterministic voting mechanisms by considering an ordinal notion of Bayesian incentive compatibility
More informationEfficiency and converse reduction-consistency in collective choice. Abstract. Department of Applied Mathematics, National Dong Hwa University
Efficiency and converse reduction-consistency in collective choice Yan-An Hwang Department of Applied Mathematics, National Dong Hwa University Chun-Hsien Yeh Department of Economics, National Central
More informationMechanism Design. Christoph Schottmüller / 27
Mechanism Design Christoph Schottmüller 2015-02-25 1 / 27 Outline 1 Bayesian implementation and revelation principle 2 Expected externality mechanism 3 Review questions and exercises 2 / 27 Bayesian implementation
More informationCharacterization of Revenue Equivalence
Characterization of Revenue Equivalence Birgit Heydenreich 1 Rudolf Müller 1 Marc Uetz 2 Rakesh Vohra 3 January 9, 2008 Abstract The property of an allocation rule to be implementable in dominant strategies
More informationA General Impossibility Result on Strategy-Proof Social Choice Hyperfunctions
A General Impossibility Result on Strategy-Proof Social Choice Hyperfunctions Selçuk Özyurt and M. Remzi Sanver May 22, 2008 Abstract A social choice hyperfunction picks a non-empty set of alternatives
More informationThe Gibbard random dictatorship theorem: a generalization and a new proof
SERIEs (2011) 2:515 527 DOI 101007/s13209-011-0041-z ORIGINAL ARTICLE The Gibbard random dictatorship theorem: a generalization and a new proof Arunava Sen Received: 24 November 2010 / Accepted: 10 January
More informationDICTATORIAL DOMAINS. Navin Aswal University of Minnesota, Minneapolis, USA Shurojit Chatterji Indian Statistical Institute, New Delhi, India and
DICTATORIAL DOMAINS Navin Aswal University of Minnesota, Minneapolis, USA Shurojit Chatterji Indian Statistical Institute, New Delhi, India and Arunava Sen Indian Statistical Institute, New Delhi, India
More informationAnonymous Single-Profile Welfarism
2004-03 Anonymous Single-Profile Welfarism BLACKORBY, Charles BOSSERT, Walter DONALDSON, David Département de sciences économiques Université de Montréal Faculté des arts et des sciences C.P. 6128, succursale
More informationStrategy-Proofness and the Core in House Allocation Problems
Strategy-Proofness and the Core in House Allocation Problems Eiichi Miyagawa Department of Economics, Columbia University 420 West 118th Street, New York, NY 10027 Email: em437@columbia.edu July 28, 1999
More informationImplementability, Walrasian Equilibria, and Efficient Matchings
Implementability, Walrasian Equilibria, and Efficient Matchings Piotr Dworczak and Anthony Lee Zhang Abstract In general screening problems, implementable allocation rules correspond exactly to Walrasian
More informationRedistribution Mechanisms for Assignment of Heterogeneous Objects
Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept
More informationCharacterizing Vickrey allocation rule by anonymity
Soc Choice Welf (2012) 38:531 542 DOI 10.1007/s00355-011-0535-4 ORIGINAL PAPER Characterizing Vickrey allocation rule by anonymity Itai Ashlagi Shigehiro Serizawa Received: 19 June 2009 / Accepted: 2 February
More informationEfficiency and strategy-proofness in object assignment problems with multi-demand preferences
Efficiency and strategy-proofness in object assignment problems with multi-demand preferences Tomoya Kazumura and Shigehiro Serizawa February 23, 2016 Abstract We consider the problem of allocating sets
More informationFollow links for Class Use and other Permissions. For more information send to:
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More informationSocial Choice Theory. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS Advanced Microeconomics II
Social Choice Theory Felix Munoz-Garcia School of Economic Sciences Washington State University EconS 503 - Advanced Microeconomics II Social choice theory MWG, Chapter 21. JR, Chapter 6.2-6.5. Additional
More informationA lower bound of 1 + ϕ for truthful scheduling mechanisms
Noname manuscript No. (will be inserted by the editor) A lower bound of 1 + ϕ for truthful scheduling mechanisms Elias Koutsoupias Angelina Vidali Abstract We study the mechanism design version of the
More informationA Theory of Robust Hardness for Truthful Mechanism Design
A Theory of Robust Hardness for Truthful Mechanism Design Dave Buchfuhrer Abstract Truthful mechanisms are important to mechanism design. Unfortunately, requiring that they also be computationally efficient
More informationImplementation in undominated strategies by bounded mechanisms: The Pareto Correspondence
Implementation in undominated strategies by bounded mechanisms: The Pareto Correspondence Saptarshi Mukherjee Eve Ramaekers Arunava Sen September 5, 2016 Preliminary and Incomplete Abstract We show that
More informationMechanism Design: Dominant Strategies
May 20, 2014 Some Motivation Previously we considered the problem of matching workers with firms We considered some different institutions for tackling the incentive problem arising from asymmetric information
More informationClassic Mechanism Design (III)
Parkes Mechanism Design 1 Classic Mechanism Design (III) David C. Parkes Division of Engineering and Applied Science, Harvard University CS 286r Spring 2002 Parkes Mechanism Design 2 Vickrey-Clarke-Groves
More informationStrategy-proof divisible public goods. for quasi-linear preferences.
Strategy-proof divisible public goods for quasi-linear preferences. Pasha Andreyanov et al. (Preliminary Draft) October 27, 2016 Abstract When agents are risk-neutral and costs are linear, allocating a
More informationAntonio Quesada Universidad de Murcia. Abstract
From social choice functions to dictatorial social welfare functions Antonio Quesada Universidad de Murcia Abstract A procedure to construct a social welfare function from a social choice function is suggested
More informationEpsilon Ex Post Implementation
Epsilon Ex Post Implementation Mehmet Barlo Nuh Aygün Dalkıran January 30, 2015 Abstract We provide necessary and sufficient conditions for epsilon ex post implementation. Our analysis extends Bergemann
More informationLecture 10: Mechanism Design
Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have
More informationMichel Le Breton and John A. Weymark
ARROVIAN SOCIAL CHOICE THEORY ON ECONOMIC DOMAINS by Michel Le Breton and John A. Weymark Working Paper No. 02-W06R April 2002 Revised September 2003 DEPARTMENT OF ECONOMICS VANDERBILT UNIVERSITY NASHVILLE,
More informationAlgorithmic Game Theory Introduction to Mechanism Design
Algorithmic Game Theory Introduction to Mechanism Design Makis Arsenis National Technical University of Athens April 216 Makis Arsenis (NTUA) AGT April 216 1 / 41 Outline 1 Social Choice Social Choice
More informationMechanism Design: Bayesian Incentive Compatibility
May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.
More informationMarket Outcomes: Efficient or Fair?
Market Outcomes: Efficient or Fair? Ram Singh Microeconomic Theory Lecture 14 Ram Singh: (DSE) Market Equilibrium Lecture 14 1 / 16 Fair Versus Efficient Question 1 What is a fair allocation? 2 Is a fair
More informationCharacterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems Çağatay Kayı and Eve Ramaekers For updated version: http://troi.cc.rochester.edu/ ckyi/kr2006.pdf This
More informationMonotonic extensions on economic domains
Rev. Econ. Design 4, 13 33 (1999) c Springer-Verlag 1999 Monotonic extensions on economic domains William Thomson Department of Economics, University of Rochester, Rochester, NY 14627, USA (e-mail: wth2@db1.cc.rochester.edu)
More informationEconomic Core, Fair Allocations, and Social Choice Theory
Chapter 9 Nathan Smooha Economic Core, Fair Allocations, and Social Choice Theory 9.1 Introduction In this chapter, we briefly discuss some topics in the framework of general equilibrium theory, namely
More informationSecond Welfare Theorem
Second Welfare Theorem Econ 2100 Fall 2015 Lecture 18, November 2 Outline 1 Second Welfare Theorem From Last Class We want to state a prove a theorem that says that any Pareto optimal allocation is (part
More informationSufficient Conditions for Weak Group-Strategy-Proofness
Sufficient Conditions for Weak Group-Strategy-Proofness T.C.A. Madhav Raghavan 31 July, 2014 Abstract In this note we study group-strategy-proofness, which is the extension of strategy-proofness to groups
More informationOn the Measurement of Inequality under Uncertainty*
journal of economic theory 75, 194204 (1997) article no. ET962280 On the Measurement of Inequality under Uncertainty* Elchanan Ben-Porath Tel-Aviv University, Ramit-Aviv, 69 978 Tel-Aviv, Israel; and Northwestern
More informationWhen is manipulation all about the ones and twos?
When is manipulation all about the ones and twos? Samson Alva University of Texas at San Antonio samson.alva@gmail.com December 5, 2017 Abstract A rule is pairwise strategy-proof if groups of size one
More informationQuasi-transitive and Suzumura consistent relations
Quasi-transitive and Suzumura consistent relations Walter Bossert Department of Economics and CIREQ, University of Montréal P.O. Box 6128, Station Downtown, Montréal QC H3C 3J7, Canada FAX: (+1 514) 343
More informationAsymptotically Optimal Strategy-proof Mechanisms for Two-Facility Games
Asymptotically Optimal Strategy-proof Mechanisms for Two-Facility Games Pinyan Lu Xiaorui Sun Yajun Wang Zeyuan Allen Zhu Abstract We consider the problem of locating facilities in a metric space to serve
More informationAlgorithmic Game Theory and Applications
Algorithmic Game Theory and Applications Lecture 18: Auctions and Mechanism Design II: a little social choice theory, the VCG Mechanism, and Market Equilibria Kousha Etessami Reminder: Food for Thought:
More informationExtending characterizations of truthful mechanisms from subdomains to domains
Extending characterizations of truthful mechanisms from subdomains to domains Angelina Vidali University of Vienna, Department of Informatics December 2011 Angelina Vidali (Uni. Wien) Extending characterizations
More informationStrategy-proof allocation of indivisible goods
Soc Choice Welfare (1999) 16: 557±567 Strategy-proof allocation of indivisible goods Lars-Gunnar Svensson Department of Economics, Lund University, P.O. Box 7082, SE-220 07 of Lund, Sweden (e-mail: lars-gunnar.svensson@nek.lu.se)
More informationMechanism Design in the Presence of Externalities
Mechanism Design in the Presence of Externalities Sebastian Kodritsch London School of Economics and Political Science January 14, 2011 Sebastian Kodritsch (LSE) Mechanism Design in the Presence of Externalities
More informationRevenue Maximization in Multi-Object Auctions
Revenue Maximization in Multi-Object Auctions Benny Moldovanu April 25, 2017 Revenue Maximization in Multi-Object Auctions April 25, 2017 1 / 1 Literature Myerson R. (1981): Optimal Auction Design, Mathematics
More informationA Characterization of Single-Peaked Preferences via Random Social Choice Functions
A Characterization of Single-Peaked Preferences via Random Social Choice Functions Shurojit Chatterji, Arunava Sen and Huaxia Zeng September 2014 Paper No. 13-2014 ANY OPINIONS EXPRESSED ARE THOSE OF THE
More informationGraph Theoretic Characterization of Revenue Equivalence
Graph Theoretic Characterization of University of Twente joint work with Birgit Heydenreich Rudolf Müller Rakesh Vohra Optimization and Capitalism Kantorovich [... ] problems of which I shall speak, relating
More informationPareto efficient combinatorial auctions: dichotomous preferences without quasilinearity
Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity Komal Malik and Debasis Mishra May 17, 2018 Abstract We consider a combinatorial auction model where preferences
More informationWinner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games Dimitris Fotakis and Christos Tzamos School of Electrical and Computer Engineering, National Technical University of Athens,
More informationThe Review of Economic Studies, Ltd.
The Review of Economic Studies, Ltd. Oxford University Press http://www.jstor.org/stable/2297086. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at.
More informationOn the Impossibility of Black-Box Truthfulness Without Priors
On the Impossibility of Black-Box Truthfulness Without Priors Nicole Immorlica Brendan Lucier Abstract We consider the problem of converting an arbitrary approximation algorithm for a singleparameter social
More informationAn axiomatization of the mixed utilitarian-maximin social welfare orderings
An axiomatization of the mixed utilitarian-maximin social welfare orderings Walter Bossert and Kohei Kamaga November 16, 2018 Abstract We axiomatize the class of mixed utilitarian-maximin social welfare
More informationPHIL 308S: Voting Theory and Fair Division
PHIL 308S: Voting Theory and Fair Division Lecture 12 Eric Pacuit Department of Philosophy University of Maryland, College Park ai.stanford.edu/ epacuit epacuit@umd.edu October 18, 2012 PHIL 308S: Voting
More informationOn the Maximal Domain Theorem
On the Maximal Domain Theorem Yi-You Yang April 28, 2016 Abstract The maximal domain theorem by Gul and Stacchetti (J. Econ. Theory 87 (1999), 95-124) shows that for markets with indivisible objects and
More informationSetting Lower Bounds on Truthfulness
Setting Lower Bounds on Truthfulness Ahuva Mu alem Michael Schapira Abstract We present and discuss general techniques for proving inapproximability results for truthful mechanisms. We make use of these
More informationRobert Gary-Bobo. NOTES ON MECHANISM DESIGN Implementation of Choice Rules
Robert Gary-Bobo NOTES ON MECHANISM DESIGN Implementation of Choice Rules ENSAE 218-219, revised in November 217 Some Implementation Theory We consider, as usual, a population of agents i = 1,..., n. Each
More informationMechanisms for Multi-Unit Auctions
Journal of Artificial Intelligence Research 37 (2010) 85-98 Submitted 10/09; published 2/10 Mechanisms for Multi-Unit Auctions Shahar Dobzinski Computer Science Department, Cornell University Ithaca, NY
More informationThe Arrow Impossibility Theorem Of Social Choice Theory In An Infinite Society And Limited Principle Of Omniscience
Applied Mathematics E-Notes, 8(2008), 82-88 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ The Arrow Impossibility Theorem Of Social Choice Theory In An Infinite
More informationOn Random Sampling Auctions for Digital Goods
On Random Sampling Auctions for Digital Goods Saeed Alaei Azarakhsh Malekian Aravind Srinivasan Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan Random Sampling Auctions... 1 Outline Background 1 Background
More informationEconomics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries
1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social
More informationTHE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS
THE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS AN EFFICIENCY CHARACTERIZATION OF PLURALITY SOCIAL CHOICE ON SIMPLE PREFERENCE DOMAINS Biung-Ghi Ju University of Kansas
More informationCombinatorial Agency of Threshold Functions
Combinatorial Agency of Threshold Functions Shaili Jain 1 and David C. Parkes 2 1 Yale University, New Haven, CT shaili.jain@yale.edu 2 Harvard University, Cambridge, MA parkes@eecs.harvard.edu Abstract.
More informationFair Divsion in Theory and Practice
Fair Divsion in Theory and Practice Ron Cytron (Computer Science) Maggie Penn (Political Science) Lecture 6-b: Arrow s Theorem 1 Arrow s Theorem The general question: Given a collection of individuals
More informationThe Sample Complexity of Revenue Maximization in the Hierarchy of Deterministic Combinatorial Auctions
The Sample Complexity of Revenue Maximization in the Hierarchy of Deterministic Combinatorial Auctions Ellen Vitercik Joint work with Nina Balcan and Tuomas Sandholm Theory Lunch 27 April 2016 Combinatorial
More information13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}
13 Social choice So far, all of our models involved a single decision maker. An important, perhaps the important, question for economics is whether the desires and wants of various agents can be rationally
More information