3.1 Arrow s Theorem. We study now the general case in which the society has to choose among a number of alternatives
|
|
- Bartholomew Morton
- 5 years ago
- Views:
Transcription
1 3.- Social Choice and Welfare Economics 3.1 Arrow s Theorem We study now the general case in which the society has to choose among a number of alternatives Let R denote the set of all preference relations on X that are complete, reflexive, and transitive Let P be the set of linear orders in R, that is, P = { R x y x = y} Definition. Social Welfare Aggregator A Social welfare aggregator defined on A R I is a rule F : A R that assigns a preference relation R to every possible profile ( 1,..., I ) A Example: F : P I R Notation: In general, ( 1,..., I ) A F ( 1,..., I ) R IDEA - Microeconomics II
2 Properties [P] Pareto A Social welfare aggregator F satisfies the Pareto property if {x, y} X and ( 1,..., I ) A we have that i I x i y x y [PI] Pairwise Independence A Social welfare aggregator F satisfies the Pairwise Independence property if the social preference between any two alternatives depends only on the individual preferences between these two alternatives, that is, {x, y} X and ( 1,..., I ), ( ˆ 1,..., ˆ I ) A such that i I x i y x ˆ i y and y i x y ˆ i x then x y x ˆ y and y x y ˆ x IDEA - Microeconomics II
3 [ND] Non Dictatorship A Social welfare aggregator F satisfies the Non Dictatorship property if there is no agent h I such that {x, y} X and ( 1,..., I ) A x h y x y IDEA - Microeconomics II
4 Example: Borda Count Consider n alternatives, X = {x 1, x 2,..., x n }, and (for simplicity) assume that all preferences are linear orders: i P i I. The Borda Count social welfare aggregator consists of: (i) Each individual assigns n points to the most preferred alternative n 1 points to the second preferred alternative... 1 point to the less preferred alternative Let c i (x) be the points assigned to alternative x X by individual i I (ii) The Social aggregator assigns a social score to each alternative x X according to the following rule c(x) = i I c i (x) (iii) Alternatives in X are socially ordered according to the scores c(x) IDEA - Microeconomics II
5 Ex: X = {x, y, z}, I = {1, 2, 3} X Society x y z Hence, y x z It is clear that the Borda count satisfies the [ND] property Also, it is easy to verify that the Borda count satisfies the [P] property. Indeed, {x, y} X such that x i y i I then c i (x) > c i (y) i I and, hence, i I ci (x) > i I ci (y). Therefore, x y The Borda count, though, does not satisfy the [PI] condition IDEA - Microeconomics II
6 Ex: X = {x, y, z}, I = {1, 2} (a) Suppose preferences i are such that x 1 y 1 z and y 2 z 2 x X 1 2 Society x y z Hence, y x z IDEA - Microeconomics II
7 Ex: (continued) (b) Suppose now that preferences change to ˆ i, where x ˆ 1 z ˆ 1 y and y ˆ 2 x ˆ 2 z X 1 2 Society x y z Now, x ˆ y ˆ z So, the social preference between x and y has reversed yet x 1 y and x ˆ 1 y y 2 x and y ˆ 2 x IDEA - Microeconomics II
8 Nevertheless, the [PI] condition (besides being intuitively reasonable) has the additional appealing that if it were true then we could proceed by steps to determine the social preference by mean of iterative pairwise comparisons between alternatives. This could be helpful because of the good properties of the Majority voting rule. Unfortunately, this is not possible Example: The Condorcet Paradox Let X = {x, y, z}, preferences I = {1, 2, 3} and consider the x 1 y 1 z y 2 z 2 x z 3 x 3 y By majority voting between pairs of alternatives we would have {x, y} x y {y, x} y z {x, z} z x Therefore, the iterated majority voting between pairs of alternatives does not always result in a transitive social preference relation (as in this example) IDEA - Microeconomics II
9 Arrow s Impossibility Theorem Definition. Satisfactory Social Welfare Aggregators F A = {F : A R F satisfies [P], [PI], and [ND]} Theorem Arrow s Impossibility Theorem Let #X > 2. Then, A = R or A = P F A = IDEA - Microeconomics II
10 Definitions Given F : A R, we say that a coalition S I is (i) Decisive for x over y if i S i / S x i y y i x } x y (ii) Decisive if for any {x, y} X, S is decisive for x over y (iii) Completely decisive for x over y if i S x i y x y IDEA - Microeconomics II
11 Proof of Arrow s Theorem Proof. (1) If for some {x, y} X, S I is decisive for x over y, then z x and z y S is decisive for x over z and S is decisive for z over y Assume z y. Consider the profile ( 1,..., I ) A such that x i y i z i S y i z i x i / S Then, S decisive for x over y x y F satisfies [P] y z } x z Hence, by [PI] we have that S is decisive for x over z (Similarly, if z y, we can prove that S is decisive for z over y) IDEA - Microeconomics II
12 (2) If for some {x, y} X, S I is decisive for x over y and z X is a third alternative (z x, z y), then S is decisive for z over w and S is decisive for w over z, where w z From (1) we know that S is decisive for x over z and for z over y Apply (1) to the pair {x, z} and the alternative w to conclude that S is decisive for w over z Apply (1) to the pair {z, y} and the alternative w to conclude that S is decisive for z over w (3) If for some {x, y} X, S I is decisive for x over y, then S is decisive Consider any pair {v, w} X and recall that, besides x and y, there is at least one more alternative z in X (i) If v = z or w = z, then step (2) can be applied directly to conclude that S is decisive for v over w (ii) If v z and w z then, by (2), S is decisive for z over w. We can then apply (1) to the pair {z, w} and the alternative v to conclude that S is decisive for v over w IDEA - Microeconomics II
13 (4) If S I and T I are decisive, then S T is decisive Let {x, y, z} X. Consider the profile ( 1,..., I ) A such that z i y i x i S \ (S T ) x i z i y i S T y i x i z i T \(S T ) y i z i x i I\(S T ) Then, S = (S\(S T )) (S T ) is decisive T = (T \(S T )) (S T ) is decisive z y x z Hence, by Transitivity, x y. Finally, by [PI], we conclude that S T is decisive for x over y. Therefore, by (3), we have that (S T ) is decisive IDEA - Microeconomics II
14 (5) For any S I, either S or I\S is decisive Let {x, y, z} X. Consider the profile ( 1,..., I ) A such that x i z i y y i x i z i S i / S (i) If x y then, by [PI], we have that S is decisive for x over y and, because of (3) we conclude that S is decisive. (ii) If y x then, since by [P] x z, we have that y z (by transitivity). Then, by [PI], we have that I\S is decisive for y over z and, because of (3) we conclude that I\S is decisive. (6) If S is decisive and S T then T is decisive Suppose T is not decisive. Then, because of (5), I\T is decisive and, therefore, S (I\T ) is decisive because of (4). But if S T, S (I\T ) =, and can not be decisive because of [P]. Hence, T must be decisive. IDEA - Microeconomics II
15 (7) If S is decisive and #S > 1 then S S, (S S) such that S is decisive Take any h S (i) If S\{h} is decisive we are done. (ii) If S\{h} is not decisive then, because of (5), I\(S\{h}) = (I\S) {h} is decisive. Hence, because of (4) {h} = S ((I\S) {h}) is decisive. (8) h I such that S = {h} is decisive Iterate (7) starting with S = I taking into account that, by [P], I is decisive and that I is finite IDEA - Microeconomics II
Voting. José M Vidal. September 29, Abstract. The problems with voting.
Voting José M Vidal Department of Computer Science and Engineering, University of South Carolina September 29, 2005 The problems with voting. Abstract The Problem The Problem The Problem Plurality The
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 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 informationLecture Notes, Lectures 22, 23, 24. Voter preferences: Majority votes A > B, B > C. Transitivity requires A > C but majority votes C > A.
Lecture Notes, Lectures 22, 23, 24 Social Choice Theory, Arrow Possibility Theorem Paradox of Voting (Condorcet) Cyclic majority: Voter preferences: 1 2 3 A B C B C A C A B Majority votes A > B, B > C.
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 informationSurvey of Voting Procedures and Paradoxes
Survey of Voting Procedures and Paradoxes Stanford University ai.stanford.edu/ epacuit/lmh Fall, 2008 :, 1 The Voting Problem Given a (finite) set X of candidates and a (finite) set A of voters each of
More informationArrow s Impossibility Theorem and Experimental Tests of Preference Aggregation
Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation Todd Davies Symbolic Systems Program Stanford University joint work with Raja Shah, Renee Trochet, and Katarina Ling Decision
More informationThe Axiomatic Method in Social Choice Theory:
The Axiomatic Method in Social Choice Theory: Preference Aggregation, Judgment Aggregation, Graph Aggregation Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss
More informationGROUP DECISION MAKING
1 GROUP DECISION MAKING How to join the preferences of individuals into the choice of the whole society Main subject of interest: elections = pillar of democracy Examples of voting methods Consider n alternatives,
More informationArrow s General (Im)Possibility Theorem
Division of the Humanities and ocial ciences Arrow s General (Im)Possibility Theorem KC Border Winter 2002 Let X be a nonempty set of social alternatives and let P denote the set of preference relations
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 informationSocial Choice. Jan-Michael van Linthoudt
Social Choice Jan-Michael van Linthoudt Summer term 2017 Version: March 15, 2018 CONTENTS Remarks 1 0 Introduction 2 1 The Case of 2 Alternatives 3 1.1 Examples for social choice rules............................
More information6.207/14.15: Networks Lecture 24: Decisions in Groups
6.207/14.15: Networks Lecture 24: Decisions in Groups Daron Acemoglu and Asu Ozdaglar MIT December 9, 2009 1 Introduction Outline Group and collective choices Arrow s Impossibility Theorem Gibbard-Satterthwaite
More informationRecap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1
Social Choice Lecture 11 Social Choice Lecture 11, Slide 1 Lecture Overview 1 Recap 2 Social Choice 3 Fun Game 4 Voting Paradoxes 5 Properties Social Choice Lecture 11, Slide 2 Formal Definition Definition
More informationPartial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS
Partial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS 1 B. Preference Aggregation Rules 3. Anti-Plurality a. Assign zero points to a voter's last preference and one point to all other preferences.
More informationProbabilistic Aspects of Voting
Probabilistic Aspects of Voting UUGANBAATAR NINJBAT DEPARTMENT OF MATHEMATICS THE NATIONAL UNIVERSITY OF MONGOLIA SAAM 2015 Outline 1. Introduction to voting theory 2. Probability and voting 2.1. Aggregating
More informationSocial choice theory, Arrow s impossibility theorem and majority judgment
Université Paris-Dauphine - PSL Cycle Pluridisciplinaire d Etudes Supérieures Social choice theory, Arrow s impossibility theorem and majority judgment Victor Elie supervised by Miquel Oliu Barton June
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 informationSocial Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives. Donald E. Campbell College of William and Mary
Social Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives Donald E. Campbell College of William and Mary Jerry S. Kelly Syracuse University College of William
More informationArrow s Paradox. Prerna Nadathur. January 1, 2010
Arrow s Paradox Prerna Nadathur January 1, 2010 Abstract In this paper, we examine the problem of a ranked voting system and introduce Kenneth Arrow s impossibility theorem (1951). We provide a proof sketch
More informationUsing a hierarchical properties ranking with AHP for the ranking of electoral systems
Università di Pisa Dipartimento di Informatica Technical Report: TR-08-26 Using a hierarchical properties ranking with AHP for the ranking of electoral systems Lorenzo Cioni lcioni@di.unipi.it September
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 informationAPPLIED MECHANISM DESIGN FOR SOCIAL GOOD
APPLIED MECHANISM DESIGN FOR SOCIAL GOOD JOHN P DICKERSON Lecture #21 11/8/2016 CMSC828M Tuesdays & Thursdays 12:30pm 1:45pm IMPOSSIBILITY RESULTS IN VOTING THEORY / SOCIAL CHOICE Thanks to: Tuomas Sandholm
More information"Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001),
February 25, 2015 "Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001), 99-105. Also recommended: M. A. Satterthwaite, "Strategy-Proof
More informationThe Beach Party Problem: An informal introduction to continuity problems in group choice *
The Beach Party Problem: An informal introduction to continuity problems in group choice * by Nick Baigent Institute of Public Economics, Graz University nicholas.baigent@kfunigraz.ac.at Fax: +44 316 3809530
More informationPolitical Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models
14.773 Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models Daron Acemoglu MIT February 7 and 12, 2013. Daron Acemoglu (MIT) Political Economy Lectures 2 and 3 February
More informationStrategy-Proofness on the Condorcet Domain
College of William and Mary W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2008 Strategy-Proofness on the Condorcet Domain Lauren Nicole Merrill College of William
More informationSocial Choice Theory for Logicians Lecture 5
Social Choice Theory for Logicians Lecture 5 Eric Pacuit Department of Philosophy University of Maryland, College Park ai.stanford.edu/ epacuit epacuit@umd.edu June 22, 2012 Eric Pacuit: The Logic Behind
More informationVolume 31, Issue 1. Manipulation of the Borda rule by introduction of a similar candidate. Jérôme Serais CREM UMR 6211 University of Caen
Volume 31, Issue 1 Manipulation of the Borda rule by introduction of a similar candidate Jérôme Serais CREM UMR 6211 University of Caen Abstract In an election contest, a losing candidate a can manipulate
More informationarxiv: v2 [math.co] 14 Apr 2011
Complete Characterization of Functions Satisfying the Conditions of Arrow s Theorem Elchanan Mossel and Omer Tamuz arxiv:0910.2465v2 [math.co] 14 Apr 2011 April 15, 2011 Abstract Arrow s theorem implies
More informationSocial Choice and Mechanism Design - Part I.2. Part I.2: Social Choice Theory Summer Term 2011
Social Choice and Mechanism Design Part I.2: Social Choice Theory Summer Term 2011 Alexander Westkamp April 2011 Introduction Two concerns regarding our previous approach to collective decision making:
More information14.770: Introduction to Political Economy Lectures 1 and 2: Collective Choice and Voting
14.770: Introduction to Political Economy Lectures 1 and 2: Collective Choice and Voting Daron Acemoglu MIT September 6 and 11, 2017. Daron Acemoglu (MIT) Political Economy Lectures 1 and 2 September 6
More informationSet-Rationalizable Choice and Self-Stability
Set-Rationalizable Choice and Self-Stability Felix Brandt and Paul Harrenstein Technische Universität München 85748 Garching bei München, Germany {brandtf,harrenst}@in.tum.de Rationalizability and similar
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 informationPoints-based rules respecting a pairwise-change-symmetric ordering
Points-based rules respecting a pairwise-change-symmetric ordering AMS Special Session on Voting Theory Karl-Dieter Crisman, Gordon College January 7th, 2008 A simple idea Our usual representations of
More informationIntro to Economic analysis
Intro to Economic analysis Alberto Bisin - NYU 1 Rational Choice The central gure of economics theory is the individual decision-maker (DM). The typical example of a DM is the consumer. We shall assume
More informationFinite Dictatorships and Infinite Democracies
Finite Dictatorships and Infinite Democracies Iian B. Smythe October 20, 2015 Abstract Does there exist a reasonable method of voting that when presented with three or more alternatives avoids the undue
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 informationMajority Decision Rules with Minority Protections: Cost Assignments for Public Projects
Majority Decision Rules with Minority Protections: Cost Assignments for Public Projects by M. Kaneko, July 7, Warsaw (based with a paper with Ryohei Shimoda) 1 Majority decision making is basic for democracy.
More informationNontransitive Dice and Arrow s Theorem
Nontransitive Dice and Arrow s Theorem Undergraduates: Arthur Vartanyan, Jueyi Liu, Satvik Agarwal, Dorothy Truong Graduate Mentor: Lucas Van Meter Project Mentor: Jonah Ostroff 3 Chapter 1 Dice proofs
More informationMechanism Design for Bounded Agents
Chapter 8 Mechanism Design for Bounded Agents Any fool can tell the truth, but it requires a man of some sense to know how to lie well. Samuel Butler Mechanism design has traditionally taken the conservative
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 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 informationBinary Aggregation with Integrity Constraints
Binary Aggregation with Integrity Constraints Umberto Grandi and Ulle Endriss Institute for Logic, Language and Computation, University of Amsterdam u.grandi@uva.nl, ulle.endriss@uva.nl Abstract We consider
More informationOn the Strategy-proof Social Choice of Fixed-sized Subsets
Nationalekonomiska institutionen MASTER S THESIS, 30 ECTS On the Strategy-proof Social Choice of Fixed-sized Subsets AUTHOR: ALEXANDER REFFGEN SUPERVISOR: LARS-GUNNAR SVENSSON SEPTEMBER, 2006 Contents
More information7 INDIVIDUAL AND GROUP DECISION MAKING
93 7 INDIVIDUAL AND GROUP DECISION MAKING 7.1 INDIVIDUAL DECISION UNDER UNCERTAINTY Laplace Principle suggests choosing a strategy which is optimal in a situation where the opponent chooses all strategies
More informationVoting and Mechanism Design
José M Vidal Department of Computer Science and Engineering, University of South Carolina March 26, 2010 Abstract Voting, Mechanism design, and distributed algorithmics mechanism design. Chapter 8. Voting
More informationCMU Social choice 2: Manipulation. Teacher: Ariel Procaccia
CMU 15-896 Social choice 2: Manipulation Teacher: Ariel Procaccia Reminder: Voting Set of voters Set of alternatives Each voter has a ranking over the alternatives means that voter prefers to Preference
More informationStrategic Manipulation and Regular Decomposition of Fuzzy Preference Relations
Strategic Manipulation and Regular Decomposition of Fuzzy Preference Relations Olfa Meddeb, Fouad Ben Abdelaziz, José Rui Figueira September 27, 2007 LARODEC, Institut Supérieur de Gestion, 41, Rue de
More informationCoalitional Structure of the Muller-Satterthwaite Theorem
Coalitional Structure of the Muller-Satterthwaite Theorem Pingzhong Tang and Tuomas Sandholm Computer Science Department Carnegie Mellon University {kenshin,sandholm}@cscmuedu Abstract The Muller-Satterthwaite
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 informationSPATIAL VOTING (MULTIPLE DIMENSIONS)
SPATIAL VOTING (MULTIPLE DIMENSIONS) 1 Assumptions Alternatives are points in an n-dimensional space. Examples for 2D: Social Issues and Economic Issues Domestic Spending and Foreign Spending Single-peaked
More informationDiscrete Math. Background Knowledge/Prior Skills Commutative and associative properties Solving systems of equations
Discrete Math Numbers and Operations Standard: Understands and applies concepts of numbers and operations. Power 1: Understands numbers, ways of representing numbers, relationships among numbers, and number
More informationThe problem of judgment aggregation in the framework of boolean-valued models
The problem of judgment aggregation in the framework of boolean-valued models Daniel Eckert 1 and Frederik Herzberg 23 1 Institut für Finanzwissenschaft, Universität Graz 2 Institut für Mathematische Wirtschaftsforschung,
More informationSet-Rationalizable Choice and Self-Stability
Set-Rationalizable Choice and Self-Stability Felix Brandt and Paul Harrenstein Ludwig-Maximilians-Universität München 80538 Munich, Germany {brandtf,harrenst}@tcs.ifi.lmu.de arxiv:0910.3580v3 [cs.ma] 24
More informationChapter 12: Social Choice Theory
Chapter 12: Social Choice Theory Felix Munoz-Garcia School of Economic Sciences Washington State University 1 1 Introduction In this chapter, we consider a society with I 2 individuals, each of them endowed
More informationParticipation Incentives in Randomized Social Choice
Participation Incentives in Randomized Social Choice Haris Aziz Data61 and UNSW, Sydney, Australia arxiv:1602.02174v2 [cs.gt] 8 Nov 2016 Abstract When aggregating preferences of agents via voting, two
More informationSingle-peaked consistency and its complexity
Bruno Escoffier, Jérôme Lang, Meltem Öztürk Abstract A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known
More informationOn the Chacteristic Numbers of Voting Games
On the Chacteristic Numbers of Voting Games MATHIEU MARTIN THEMA, Departments of Economics Université de Cergy Pontoise, 33 Boulevard du Port, 95011 Cergy Pontoise cedex, France. e-mail: mathieu.martin@eco.u-cergy.fr
More informationLogic and Social Choice Theory. A Survey. ILLC, University of Amsterdam. November 16, staff.science.uva.
Logic and Social Choice Theory A Survey Eric Pacuit ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl November 16, 2007 Setting the Stage: Logic and Games Game Logics Logics
More informationDependence and Independence in Social Choice Theory
Dependence and Independence in Social Choice Theory Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu March 4, 2014 Eric Pacuit 1 Competing desiderata
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 informationAntipodality in committee selection. Abstract
Antipodality in committee selection Daniel Eckert University of Graz Christian Klamler University of Graz Abstract In this paper we compare a minisum and a minimax procedure as suggested by Brams et al.
More informationDr. Y. İlker TOPCU. Dr. Özgür KABAK web.itu.edu.tr/kabak/
Dr. Y. İlker TOPCU www.ilkertopcu.net www.ilkertopcu.org www.ilkertopcu.info facebook.com/yitopcu twitter.com/yitopcu instagram.com/yitopcu Dr. Özgür KABAK web.itu.edu.tr/kabak/ Decision Making? Decision
More informationTHREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116
THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM BY JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connecticut 06520-8281
More informationEC487 Advanced Microeconomics, Part I: Lecture 5
EC487 Advanced Microeconomics, Part I: Lecture 5 Leonardo Felli 32L.LG.04 27 October, 207 Pareto Efficient Allocation Recall the following result: Result An allocation x is Pareto-efficient if and only
More informationarxiv: v1 [cs.gt] 1 May 2017
Rank Maximal Equal Contribution: a Probabilistic Social Choice Function Haris Aziz and Pang Luo and Christine Rizkallah arxiv:1705.00544v1 [cs.gt] 1 May 2017 1 Data61, CSIRO and UNSW, Sydney, NSW 2033,
More informationAn axiomatic characterization of the prudent order preference function
An axiomatic characterization of the prudent order preference function Claude Lamboray Abstract In this paper, we are interested in a preference function that associates to a profile of linear orders the
More informationSet-Monotonicity Implies Kelly-Strategyproofness
Set-Monotonicity Implies Kelly-Strategyproofness arxiv:1005.4877v5 [cs.ma] 5 Feb 2015 Felix Brandt Technische Universität München Munich, Germany brandtf@in.tum.de This paper studies the strategic manipulation
More informationStackelberg Voting Games: Computational Aspects and Paradoxes
Stackelberg Voting Games: Computational Aspects and Paradoxes Lirong Xia Department of Computer Science Duke University Durham, NC 7708, USA lxia@cs.duke.edu Vincent Conitzer Department of Computer Science
More informationCondorcet Efficiency: A Preference for Indifference
Condorcet Efficiency: A Preference for Indifference William V. Gehrlein Department of Business Administration University of Delaware Newark, DE 976 USA Fabrice Valognes GREBE Department of Economics The
More informationInstituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra
Instituto de Engenharia de Sistemas e Computadores de Coimbra Institute of Systems Engineering and Computers INESC - Coimbra Claude Lamboray Luis C. Dias Pairwise support maximization methods to exploit
More informationComment on The Veil of Public Ignorance
Comment on The Veil of Public Ignorance Geoffroy de Clippel February 2010 Nehring (2004) proposes an interesting methodology to extend the utilitarian criterion defined under complete information to an
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 informationReference-based Preferences Aggregation Procedures in Multicriteria Decision Making
Reference-based Preferences Aggregation Procedures in Multicriteria Decision Making Antoine Rolland Laboratoire ERIC - Université Lumière Lyon 2 5 avenue Pierre Mendes-France F-69676 BRON Cedex - FRANCE
More informationBinary Aggregation with Integrity Constraints
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Binary Aggregation with Integrity Constraints Umberto Grandi and Ulle Endriss Institute for Logic, Language and
More informationA Borda Count for Collective Sentiment Analysis
A Borda Count for Collective Sentiment Analysis Umberto Grandi Department of Mathematics University of Padova 10 February 2014 Joint work with Andrea Loreggia (Univ. Padova), Francesca Rossi (Univ. Padova)
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.
More informationRecap Social Choice Functions Fun Game Mechanism Design. Mechanism Design. Lecture 13. Mechanism Design Lecture 13, Slide 1
Mechanism Design Lecture 13 Mechanism Design Lecture 13, Slide 1 Lecture Overview 1 Recap 2 Social Choice Functions 3 Fun Game 4 Mechanism Design Mechanism Design Lecture 13, Slide 2 Notation N is the
More informationQuantifying the Classical Impossibility Theorems from Social Choice
Quantifying the Classical Impossibility Theorems from Social Choice Frank Feys October 21, 2015 TU Delft Applied Logic Seminar 0 Outline 2/26 Introduction Part 1: Quantifying the Classical Impossibility
More informationMicroeconomic foundations of representative agent models by means of ultraproducts
Working Papers Center for Mathematical Economics 514 July 2014 Microeconomic foundations of representative agent models by means of ultraproducts Geghard Bedrosian and Frederik Herzberg IMW Bielefeld University
More informationMATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018
MATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018 As we ve discussed, a move favorable to X is one in which some voters change their preferences so that X is raised, while the relative
More informationChabot College Fall Course Outline for Mathematics 47 MATHEMATICS FOR LIBERAL ARTS
Chabot College Fall 2013 Course Outline for Mathematics 47 Catalog Description: MATHEMATICS FOR LIBERAL ARTS MTH 47 - Mathematics for Liberal Arts 3.00 units An introduction to a variety of mathematical
More informationJudgment Aggregation: June 2018 Project
Judgment Aggregation: June 2018 Project Sirin Botan Institute for Logic, Language and Computation University of Amsterdam June 5, 2018 Judgment Aggregation, June 2018: Lecture 2 Sirin Botan 1 / 21 Plan
More informationPositively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives
Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives Sean Horan, Martin J. Osborne, and M. Remzi Sanver December 24, 2018 Abstract May
More informationAn Analytical and Experimental Comparison of Maximal Lottery Schemes
An Analytical and Experimental Comparison of Maximal Lottery Schemes Florian Brandl Felix Brandt Christian Stricker Technische Universität München {brandlfl,brandtf,stricker}@in.tum.de Abstract Randomized
More informationInequality of Representation
Inequality of Representation Hannu Nurmi Public Choice Research Centre University of Turku Institutions in Context: Inequality (HN/PCRC) Inequality of Representation June 3 9, 2013 1 / 31 The main points
More informationFrom Sentiment Analysis to Preference Aggregation
From Sentiment Analysis to Preference Aggregation Umberto Grandi Department of Mathematics University of Padova 22 November 2013 [Joint work with Andrea Loreggia, Francesca Rossi and Vijay Saraswat] What
More informationCMU Social choice: Advanced manipulation. Teachers: Avrim Blum Ariel Procaccia (this time)
CMU 15-896 Social choice: Advanced manipulation Teachers: Avrim Blum Ariel Procaccia (this time) Recap A Complexity-theoretic barrier to manipulation Polynomial-time greedy alg can successfully decide
More informationarxiv: v1 [cs.ce] 2 Apr 2014
Thermodynamic Hypothesis as Social Choice: An Impossibility Theorem for Protein Folding arxiv:1404.0672v1 [cs.ce] 2 Apr 2014 Hammurabi Mendes, Sorin Istrail {hmendes,sorin}@cs.brown.edu Brown University
More informationAPPLIED MECHANISM DESIGN FOR SOCIAL GOOD
APPLIED MECHANISM DESIGN FOR SOCIAL GOOD JOHN P DICKERSON Lecture #3 09/06/2016 CMSC828M Tuesdays & Thursdays 12:30pm 1:45pm REMINDER: SEND ME TOP 3 PRESENTATION PREFERENCES! I LL POST THE SCHEDULE TODAY
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 informationHans Peters, Souvik Roy, Ton Storcken. Manipulation under k-approval scoring rules RM/08/056. JEL code: D71, D72
Hans Peters, Souvik Roy, Ton Storcken Manipulation under k-approval scoring rules RM/08/056 JEL code: D71, D72 Maastricht research school of Economics of TEchnology and ORganizations Universiteit Maastricht
More informationNotes on Social Choice Theory
Notes on Social Choice Theory Arunava Sen February 21, 2017 1 Binary Relations and Orderings Let A = {a, b, c,..., x, y, z,...} be a finite set of alternatives. Let N = {1,..., n} be a finite set of agents.
More informationMechanism Design: Basic Concepts
Advanced Microeconomic Theory: Economics 521b Spring 2011 Juuso Välimäki Mechanism Design: Basic Concepts The setup is similar to that of a Bayesian game. The ingredients are: 1. Set of players, i {1,
More informationA BORDA COUNT FOR PARTIALLY ORDERED BALLOTS JOHN CULLINAN, SAMUEL K. HSIAO, AND DAVID POLETT
A BORDA COUNT FOR PARTIALLY ORDERED BALLOTS JOHN CULLINAN, SAMUEL K. HSIAO, AND DAVID POLETT ABSTRACT. The application of the theory of partially ordered sets to voting systems is an important development
More informationStatistical Significance of Ranking Paradoxes
Statistical Significance of Ranking Paradoxes Anna E. Bargagliotti and Raymond N. Greenwell 1 February 28, 2009 1 Anna E. Bargagliotti is an Assistant Professor in the Department of Mathematical Sciences
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 informationSocial Choice and Networks
Social Choice and Networks Elchanan Mossel UC Berkeley All rights reserved Logistics 1 Different numbers for the course: Compsci 294 Section 063 Econ 207A Math C223A Stat 206A Room: Cory 241 Time TuTh
More informationChapter 1 - Preference and choice
http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set
More information