Inequality of Representation

Size: px
Start display at page:

Download "Inequality of Representation"

Transcription

1 Inequality of Representation Hannu Nurmi Public Choice Research Centre University of Turku Institutions in Context: Inequality (HN/PCRC) Inequality of Representation June 3 9, / 31

2 The main points The main points proportionality is a matter of degree proportionality is often implicitly based on a choice rule what is (a reasonably) proportional outcome under one rule, may not be that under another proportionality is not only vague, but also ambiguous: what is it that we want to distribute proportionally? if it is a priori voting power (rather than seats) then we might have a major problem in our hands there are methods for composing optimal committees requiring no more than pairwise comparisons of candidates by voters (HN/PCRC) Inequality of Representation June 3 9, / 31

3 The vagueness of proportionality The recent Finnish parliamentary election Results is mainland Finland: parties votes % seats: current seats: proposed KOK SDP PS KESK Vas Vihr SFP KD (HN/PCRC) Inequality of Representation June 3 9, / 31

4 The vagueness of proportionality Three P.R. systems in action parties votes Sainte-Laguë Hamilton d Hondt A B C D E (HN/PCRC) Inequality of Representation June 3 9, / 31

5 The vagueness of proportionality Many methods of apportionment largest remainder s method (Hamilton) d Hondt s method (Jefferson) Webster s method Huntington-Hill or equal proportions (currently in use in the US) (HN/PCRC) Inequality of Representation June 3 9, / 31

6 The vagueness of proportionality Referendum paradox Example voter states opinion state 1... state 45 state state 50 total Obama Romney O-electors R-electors (HN/PCRC) Inequality of Representation June 3 9, / 31

7 The ambiguity of proportionality Pairwise victories Condorcet extensions Example Condorcet s paradox 4 voters 4 voters 4 voters A B C C A B B C A Surely, there is no winner here, or what? If so, then removing this kind of component from any larger profile or adding it to some profile should not change the winners, right? (HN/PCRC) Inequality of Representation June 3 9, / 31

8 Surprise? The ambiguity of proportionality Example A profile with a strong Condorcet winner 7 voters 4 voters A B B C C A Adding the Condorcet paradox profile to this one results in a new Condorcet winner. N.B. the Borda winner remains the same in the 11- and 23-voter profiles. (HN/PCRC) Inequality of Representation June 3 9, / 31

9 The ambiguity of proportionality Proportionality and social choice rule Problem: elect proportionally 2 candidates out of 4. Consider the following profile: 4 voters 3 voters 2 voters 1 voter A B C A C D D D D C B C B A A B Plurality choice set: {A, B} Borda choice set: {C, D} (HN/PCRC) Inequality of Representation June 3 9, / 31

10 The ambiguity of proportionality Plurality vs. Condorcet Plurality-based proportionality does not guarantee the election of an eventual Condorcet winner. 1 voter 2 voters 2 voters A B C B A A C C B The Condorcet (and Borda) winner A is not elected even if all but one candidate is elected proportionally. (HN/PCRC) Inequality of Representation June 3 9, / 31

11 The ambiguity of proportionality Borda vs. Condorcet Borda-based proportionality does not guarantee the election of (even strong) Condorcet winner. 8 voters 7 voters A B B C C D D E E A If two candidates are chosen based on Borda-proportionality, the strong Condorcet winner A is not elected, B and C are. (HN/PCRC) Inequality of Representation June 3 9, / 31

12 Optimal committees Composing optimal committees A person, A, is represented in some matter by another person, B, to the extent that B s actions in the matter reflect what might be called A s ideal preferences the choices that A would make if A were ideally informed, ideally expert, and ideally clear about his own interests. (Rogowski) A committee member M represents a voter V to the extent that 1 M makes present V s opinions in the deliberations that take place within the committee, 2 M is similarly responsive to various kinds of arguments presented in those deliberations as V, and 3 M votes in the same way as V, should V be present in the committee. (Chamberlin and Courant) (HN/PCRC) Inequality of Representation June 3 9, / 31

13 Optimal committees Optimal fuzzy representation Consider now voter i and a committee c t consisting of k candidates as required. We are interested in finding the members of c t that best represent i. Denote the set of these representatives by B(i, c t ). Several plausible ways of finding the best representatives can be envisioned: 1 B i sum (c t) = {j c t l r jl l r ql, q c t }, 2 B i min (c t) = {j c t min l r jl min l r ql, l K, q c t }, 3 B i h (c t) = {j c t h(j) h(q), q c t } where h(j) = p (max l r jl ) + (1 p)(min l r jl ), 4 B i cop (c t) = {j c t cop(j) cop(q), q c t } where cop(j) = {l c t r jl > r lj, l K } (HN/PCRC) Inequality of Representation June 3 9, / 31

14 Optimal committees 1 determines the best representatives on the basis of the sums of the preference degrees obtained by candidates in all pairwise comparisons (cf. Borda). 2 looks at the minimum preference degree of each candidate when compared with all others and picks the candidate with the largest minimum n(min-max). 3 is a version of Hurwicz s rule which maximizes the weighted sum of the smallest and largest preference degrees. 4 is motivated by Copeland s rule in social choice theory. (HN/PCRC) Inequality of Representation June 3 9, / 31

15 Optimal committees Ranking committees The most straightforward way to accomplish this is to define the score of committee c t as follows: S t = i N raj i. a c t j K Thus, the score of a committee is the sum of values given by voters to each of its members. The most representative committee RC B would then be: RC B = {c i C k S i S j, c j C k }. (HN/PCRC) Inequality of Representation June 3 9, / 31

16 A priori voting power Seats or power The Shapley-Shubik index value of player i is: (s 1)!(n s)! φ i = Σ S N [v(s) v(s \ {i})]. n! The standardized Banzhaf index value of i is defined as: β i = Σ S N[v(S) v(s \ {i})] Σ j N Σ S N [v(s) v(s \ {j})]. The absolute Penrose-Banzhaf index is defined as: β i = Σ S N[v(S) v(s \ {i})] 2 n 1. (HN/PCRC) Inequality of Representation June 3 9, / 31

17 More votes, less power Non-monotonicity of runoff 22 voters 21 voters 20 voters A B C B C A C A B Table: Additional support paradox (HN/PCRC) Inequality of Representation June 3 9, / 31

18 More votes, less power No-show paradox and runoff 5 voters 5 voters 4 voters A B C B C A C A B Table: No-Show Paradox (HN/PCRC) Inequality of Representation June 3 9, / 31

19 More votes, less power Schwartz paradox and amendment party A party B party C 23 seats 28 seats 49 seats a b c b c a c a b Table: Schwartz Paradox Motion b has been presented and that also an amendment to it c is on the table. Hence the amendment agenda: motion b vs. amendment c, the winner of the preceding vs. a (HN/PCRC) Inequality of Representation June 3 9, / 31

20 Power and proximity of outcomes Baigent s result Theorem Anonymity and respect for unanimity cannot be reconciled with proximity preservation: choices made in profiles more close to each other ought to be closer to each other than those made in profiles less close to each other (Baigent 1987). I.e. if a small group of voters changes its mind about preference ranking, the change in outcomes can be larger than had a large group of voters changed its mind. That is, smaller groups can, under any reasonable voting rule, have larger impact on outcomes than larger groups. (HN/PCRC) Inequality of Representation June 3 9, / 31

21 A toy example Power and proximity of outcomes Let us assume that there are only two voters in NATO (1 and 2) and two alternatives: impose a no-fly zone in Libya (NFZ) and refrain from military interference (R) in Libya. To simplify things even further, assume that only strict preferences are possible, i.e both decision makers have a strictly preferred policy. Four profiles are now possible: P 1 P 2 P 3 P NFZ NFZ R R R NFZ NFZ R R R NFZ NFZ NFZ R R NFZ (HN/PCRC) Inequality of Representation June 3 9, / 31

22 Power and proximity of outcomes Toy example, cont d We denote the voters rankings in various profiles by P mi where m is the number of the profile and i the voter. We consider two types of metrics: one that is defined on pairs of rankings and one defined on profiles. The former is denoted by d r an the latter by d P. They are related as follows: d P (P m, P j ) = i N d r (P mi, P ji ). In other words, the distance between two profiles is the sum of distances between the pairs of rankings of the first, second, etc. voters. (HN/PCRC) Inequality of Representation June 3 9, / 31

23 Power and proximity of outcomes Toy example, cont d Take now two profiles, P 1 and P 3, from the above list and express their distance using metric d P as follows: d P (P 1, P 3 ) = d r (P 11, P 31 ) + d r (P 12, P 32 ). Since, P 12 = P 32 = NFZ R, and hence the latter summand equals zero, this reduces to: d P (P 1, P 3 ) = d r (P 11, P 31 ) = d r ((NFZ R), (R NFZ )). Taking now the distance between P 3 and P 4, we get: d P (P 3, P 4 ) = d r (P 31, P 41 ) + d r (P 32, P 42 ). (HN/PCRC) Inequality of Representation June 3 9, / 31

24 Power and proximity of outcomes Toy example, cont d Both summands are equal since by definition: Thus, d r ((R NFZ ), (NFZ R)) = d r ((NFZ R), (R NFZ )). d P (P 3, P 4 ) = 2 d r ((NFZ R), (R NFZ )). In terms of d P, then, P 3 is closer to P 1 than to P 4. This makes sense intuitively. (HN/PCRC) Inequality of Representation June 3 9, / 31

25 Power and proximity of outcomes Toy example, cont d The proximity of the social choices emerging out of various profiles depends on the choice procedures, denoted by g, being applied. Let us make two very mild restrictions on choice procedures, viz. that they are anonymous and respect unanimity. In our example, anonymity requires that whatever is the choice in P 3 is also the choice in P 4 since these two profiles can be reduced to each other by relabelling the voters. Unanimity, in turn, requires that g(p 1 ) = NFZ, while g(p 2 ) = R. Therefore, either g(p 3 ) g(p 1 ) or g(p 3 ) g(p 2 ). Assume the former. It then follows that d r (g(p 3 ), g(p 1 )) > 0. Recalling the implication of anonymity, we now have: d r (g(p 3 ), g(p 1 )) > 0 = d r (g(p 3 ), g(p 4 )). (HN/PCRC) Inequality of Representation June 3 9, / 31

26 Power and proximity of outcomes Toy example, cont d In other words, even though P 3 is closer to P 1 than to P 4, the choice made in P 3 is closer to - indeed identical with - that made in P 4. This argument rests on the assumption that g(p 3 ) g(p 1 ). Similar argument can, however, easily be made for the alternative assumption, viz. that g(p 3 ) g(p 2 ). (HN/PCRC) Inequality of Representation June 3 9, / 31

27 Power and proximity of outcomes Toy example, cont d The example shows that small mistakes or errors made by voters are not necessarily accompanied with small changes in voting outcomes. Indeed, if the true preferences of voters are those of P 3, then voter 1 s mistaken report of his preferences leads to profile P 1, while both voters making a mistake leads to P 4. Yet, the outcome ensuing from P 1 is further away from the outcome resulting from P 3 than the outcome that would have resulted had more - indeed both - voters made a mistake whereupon P 4 would have emerged. (HN/PCRC) Inequality of Representation June 3 9, / 31

28 Power and proximity of outcomes Toy example, cont d N.B.: the violation of proximity preservation occurs in a wide variety of voting systems, viz. those that satisfy anonymity and unanimity. This result is not dependent on any particular metric with respect to which the distances between profiles and outcomes are measured. I.e. in nearly all reasonable voting systems it is possible that a small group of voters has greater impact on voting outcomes than a big group. (Thus, we have yet another form of violating local monotonicity.) (HN/PCRC) Inequality of Representation June 3 9, / 31

29 Conclusion By way of concluding inequality of representation is typically a result of the election system the current representation systems are implicitly based on plurality principle, i.e. the voters are expected to reveal their unique favorite even in terms of this plurality-based PR, systems vary in how faithfully they reflect the distribution of voter opinions the distribution of influence over outcomes should this be our focus often deviates from the seat distribution there are several non-equivalent ways of measuring the influence none of them seems quite adequate (HN/PCRC) Inequality of Representation June 3 9, / 31

30 Some References I Conclusion M. Balinski and H. P. Young. Fair Representation. 2nd ed. Washington, D.C.: Brookings Institution Press, 2001 M. J. Holler and H. Nurmi, eds. Power, Voting, and Voting Power: 30 Years After. Berlin: Springer-Verlag, H. Nurmi. Voting Procedures under Uncertainty. Berlin: Springer-Verlag, D. Saari. Basic Geometry of Voting. Cambridge: Cambridge University Press, (HN/PCRC) Inequality of Representation June 3 9, / 31

31 Some References II Conclusion N. Baigent. Preference proximity and anonymous social choice. The Quarterly Journal of Economics 102, 1987, J. Chamberlin and P. Courant. Representative deliberations and representative decisions. American Political Science Review 77, 1983, D. Saari and K. Sieberg. The sum of the parts can violate the whole. American Political Science Review, 95, 2001, T. Schwartz. The paradox of representation. The Journal of Politics 57, 1995, (HN/PCRC) Inequality of Representation June 3 9, / 31

Survey of Voting Procedures and Paradoxes

Survey 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 information

Voting Handout. Election from the text, p. 47 (for use during class)

Voting Handout. Election from the text, p. 47 (for use during class) Voting Handout Election from the text, p. 47 (for use during class) 3 2 1 1 2 1 1 1 1 2 A B B B D D E B B E C C A C A A C E E C D D C A B E D C C A E E E E E B B A D B B A D D C C A D A D 1. Use the following

More information

Dr. Y. İlker TOPCU. Dr. Özgür KABAK web.itu.edu.tr/kabak/

Dr. 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 information

6.207/14.15: Networks Lecture 24: Decisions in Groups

6.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 information

Chabot College Fall Course Outline for Mathematics 47 MATHEMATICS FOR LIBERAL ARTS

Chabot 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 information

CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES

CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES DONALD G SAARI AND TOMAS J MCINTEE INSTITUTE FOR MATHEMATICAL BEHAVIORAL SCIENCE UNIVERSITY OF CALIFORNIA, IRVINE, CA 9697-5100 Abstract General conclusions

More information

Social Choice. Jan-Michael van Linthoudt

Social 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 information

Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2)

Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2) Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2) Haifeng Huang University of California, Merced Best response functions: example In simple games we can examine

More information

Social 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 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 information

Evaluating the likelihood of the referendum paradox for mixed voting systems Very preliminary version

Evaluating the likelihood of the referendum paradox for mixed voting systems Very preliminary version Evaluating the likelihood of the referendum paradox for mixed voting systems Very preliminary version Michel Le Breton, Dominique Lepelley, Vincent Merlin March 204 Abstract A referendum paradox (Nurmi,

More information

Approval Voting: Three Examples

Approval Voting: Three Examples Approval Voting: Three Examples Francesco De Sinopoli, Bhaskar Dutta and Jean-François Laslier August, 2005 Abstract In this paper we discuss three examples of approval voting games. The first one illustrates

More information

Nontransitive Dice and Arrow s Theorem

Nontransitive 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 information

Copyright Author(s) ISSN

Copyright Author(s) ISSN Copyright Author(s) ISSN 1796-3133 Printed in Uniprint Turku 2012 Hannu Salonen Aggregating and Updating Information Aboa Centre for Economics Discussion Paper No. 73 March 2012 ABSTRACT We study information

More information

Using a hierarchical properties ranking with AHP for the ranking of electoral systems

Using 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 information

Condorcet Consistency and the strong no show paradoxes

Condorcet Consistency and the strong no show paradoxes Condorcet Consistency and the strong no show paradoxes Laura Kasper Hans Peters Dries Vermeulen July 10, 2018 Abstract We consider voting correspondences that are, besides Condorcet Consistent, immune

More information

Multiwinner Voting with Fairness Constraints

Multiwinner Voting with Fairness Constraints Multiwinner Voting with Fairness Constraints L. Elisa Celis, Lingxiao Huang, and Nisheeth K. Vishnoi EPFL, Switzerland arxiv:1710.10057v2 [cs.cy] 18 Jun 2018 June 20, 2018 Abstract Multiwinner voting rules

More information

14.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 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 information

Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models

Political 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 information

Recap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1

Recap 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 information

CMU Social choice 2: Manipulation. Teacher: Ariel Procaccia

CMU 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 information

Expertise and Complexity in the Social and Engineering Sciences: An Extended Sen s Theorem

Expertise and Complexity in the Social and Engineering Sciences: An Extended Sen s Theorem Expertise and Complexity in the Social and Engineering Sciences: An Extended Sen s Theorem Donald G. Saari Institute for Mathematical Behavioral Sciences University of California Irvine, CA 92617-5100

More information

GROUP DECISION MAKING

GROUP 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 information

Chapter 12: Social Choice Theory

Chapter 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 information

Social Dichotomy Functions (extended abstract)

Social Dichotomy Functions (extended abstract) Social Dichotomy Functions (extended abstract) Conal Duddy, Nicolas Houy, Jérôme Lang, Ashley Piggins, and William S. Zwicker February 22, 2014 1 What is a Social Dichotomy Function? A dichotomy A = (A

More information

Winning probabilities in a pairwise lottery system with three alternatives

Winning probabilities in a pairwise lottery system with three alternatives Economic Theory 26, 607 617 (2005) DOI: 10.1007/s00199-004-059-8 Winning probabilities in a pairwise lottery system with three alternatives Frederick H. Chen and Jac C. Heckelman Department of Economics,

More information

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM EDURNE FALCÓ AND JOSÉ LUIS GARCÍA-LAPRESTA Abstract. It is common knowledge that the political voting systems suffer inconsistencies and

More information

Probabilistic Aspects of Voting

Probabilistic 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 information

Discrete Math. Background Knowledge/Prior Skills Commutative and associative properties Solving systems of equations

Discrete 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 information

A Failure of Representative Democracy

A Failure of Representative Democracy A Failure of Representative Democracy Katherine Baldiga Harvard University August 30, 2011 Abstract We compare direct democracy, in which members of a population cast votes for alternatives as choice problems

More information

Power in the US Legislature

Power in the US Legislature Power in the US Legislature Victoria Powers May 16, 2017 Abstract Using a standard model of the US legislative system as a monotonic simple game, we look at rankings of the four types of players the president,

More information

3.1 Arrow s Theorem. We study now the general case in which the society has to choose among a number of alternatives

3.1 Arrow s Theorem. We study now the general case in which the society has to choose among a number of alternatives 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

More information

Consistent Approval-Based Multi-Winner Rules

Consistent Approval-Based Multi-Winner Rules Consistent Approval-Based Multi-Winner Rules arxiv:1704.02453v3 [cs.gt] 20 Jul 2017 Martin Lackner University of Oxford Oxford, UK Piotr Skowron Technische Universität Berlin Berlin, Germany Abstract This

More information

Algorithmic Game Theory Introduction to Mechanism Design

Algorithmic 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 information

Condorcet Efficiency: A Preference for Indifference

Condorcet 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 information

Social Choice and Mechanism Design - Part I.2. Part I.2: Social Choice Theory Summer Term 2011

Social 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 information

Antipodality in committee selection. Abstract

Antipodality 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 information

Effectiveness, Decisiveness and Success in Weighted Voting Systems

Effectiveness, Decisiveness and Success in Weighted Voting Systems Effectiveness, Decisiveness and Success in Weighted Voting Systems Werner Kirsch Fakultät für Mathematik und Informatik FernUniversität in Hagen, Germany June 8, 217 1 Introduction The notions effectiveness,

More information

The Best Way to Choose a Winner

The Best Way to Choose a Winner The Best Way to Choose a Winner Vicki Powers Emory University, Atlanta, GA currently: National Science Foundation, Division of Mathematical Sciences Universität Konstanz, April 14, 2014 What is this talk

More information

SYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints

SYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints SYSU Lectures on the Theory of Aggregation Lecture 2: Binary Aggregation with Integrity Constraints Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam [ http://www.illc.uva.nl/~ulle/sysu-2014/

More information

Intro Prefs & Voting Electoral comp. Political Economics. Ludwig-Maximilians University Munich. Summer term / 37

Intro Prefs & Voting Electoral comp. Political Economics. Ludwig-Maximilians University Munich. Summer term / 37 1 / 37 Political Economics Ludwig-Maximilians University Munich Summer term 2010 4 / 37 Table of contents 1 Introduction(MG) 2 Preferences and voting (MG) 3 Voter turnout (MG) 4 Electoral competition (SÜ)

More information

Dependence and Independence in Social Choice Theory

Dependence 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 information

Social Choice and Social Networks. Aggregation of General Biased Signals (DRAFT)

Social Choice and Social Networks. Aggregation of General Biased Signals (DRAFT) Social Choice and Social Networks Aggregation of General Biased Signals (DRAFT) All rights reserved Elchanan Mossel UC Berkeley 8 Sep 2010 Extending Condorect s Jury Theorem We want to consider extensions

More information

Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion

Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion 1 / 24 Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion Edith Elkind 1 Jérôme Lang 2 Abdallah Saffidine 2 1 Nanyang Technological University, Singapore 2 LAMSADE, Université

More information

Fairness and Redistribution: Response

Fairness and Redistribution: Response Fairness and Redistribution: Response By ALBERTO ALESINA, GEORGE-MARIOS ANGELETOS, AND GUIDO COZZI This paper responds to the comment of Di Tella and Dubra (211). We first clarify that the model of Alesina

More information

Partial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS

Partial 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 information

Computational Aspects of Strategic Behaviour in Elections with Top-Truncated Ballots

Computational Aspects of Strategic Behaviour in Elections with Top-Truncated Ballots Computational Aspects of Strategic Behaviour in Elections with Top-Truncated Ballots by Vijay Menon A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree

More information

Efficient Algorithms for Hard Problems on Structured Electorates

Efficient Algorithms for Hard Problems on Structured Electorates Aspects of Computation 2017 Efficient Algorithms for Hard Problems on Structured Electorates Neeldhara Misra The standard Voting Setup and some problems that we will encounter. The standard Voting Setup

More information

Computing Spanning Trees in a Social Choice Context

Computing Spanning Trees in a Social Choice Context Computing Spanning Trees in a Social Choice Context Andreas Darmann, Christian Klamler and Ulrich Pferschy Abstract This paper combines social choice theory with discrete optimization. We assume that individuals

More information

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

Arrow 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 information

Points-based rules respecting a pairwise-change-symmetric ordering

Points-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 information

An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler

An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert and Christian Klamler An equity-efficiency trade-off in a geometric approach to committee selection Daniel Eckert

More information

Finite Dictatorships and Infinite Democracies

Finite 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 information

Chapter 1 exam done. Now back to Chapter 2. Quick review of Adams /Webster s/huntington-hill s Methods.

Chapter 1 exam done. Now back to Chapter 2. Quick review of Adams /Webster s/huntington-hill s Methods. 1 Chapter 1 exam done. Now back to Chapter 2. Quick review of Adams /Webster s/huntington-hill s Methods. 2 Adams method 3 Island Arisa Beruga Crispa Daria Total Pop. 1,205,000 163,000 267,000 165,000

More information

Apportionments with minimum Gini index of disproportionality

Apportionments with minimum Gini index of disproportionality Apportionments with minimum Gini index of disproportionality Daniele Pretolani DISMI, Università di Modena e Reggio Emilia e-mail: daniele.pretolani@unimore.it Medellín, March 7, 2017 Seminar of the PhD

More information

Non-Manipulable Domains for the Borda Count

Non-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 information

Geometry of distance-rationalization

Geometry of distance-rationalization Geometry of distance-rationalization B.Hadjibeyli M.C.Wilson Department of Computer Science, University of Auckland Benjamin Hadjibeyli (ENS Lyon) Geometry of distance-rationalization Talk CMSS 1 / 31

More information

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

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 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 information

Learning from paired comparisons: three is enough, two is not

Learning from paired comparisons: three is enough, two is not Learning from paired comparisons: three is enough, two is not University of Cambridge, Statistics Laboratory, UK; CNRS, Paris School of Economics, France Paris, December 2014 2 Pairwise comparisons A set

More information

Topic 1 Proportional representation and Apportionment Schemes. 1.2 Quota Method of the Greatest Remainder (Hamilton s method) and paradoxes

Topic 1 Proportional representation and Apportionment Schemes. 1.2 Quota Method of the Greatest Remainder (Hamilton s method) and paradoxes Mathematical Models in Economics and Finance Topic 1 Proportional representation and Apportionment Schemes 1.1 General issues of apportionment of legislature seats 1.2 Quota Method of the Greatest Remainder

More information

Thema Working Paper n Université de Cergy Pontoise, France

Thema Working Paper n Université de Cergy Pontoise, France Thema Working Paper n 2010-02 Université de Cergy Pontoise, France Sincere Scoring Rules Nunez Matias May, 2010 Sincere Scoring Rules Matías Núñez May 2010 Abstract Approval Voting is shown to be the unique

More information

Chapter 1. The Mathematics of Voting

Chapter 1. The Mathematics of Voting Introduction to Contemporary Mathematics Math 112 1.1. Preference Ballots and Preference Schedules Example (The Math Club Election) The math club is electing a new president. The candidates are Alisha

More information

Algebraic Voting Theory

Algebraic Voting Theory Algebraic Voting Theory Michael Orrison Harvey Mudd College Collaborators and Sounding Boards Don Saari (UC Irvine) Anna Bargagliotti (University of Memphis) Steven Brams (NYU) Brian Lawson (Santa Monica

More information

MATH : FINAL EXAM INFO/LOGISTICS/ADVICE

MATH : FINAL EXAM INFO/LOGISTICS/ADVICE INFO: MATH 1300-01: FINAL EXAM INFO/LOGISTICS/ADVICE WHEN: Thursday (08/06) at 11:00am DURATION: 150 mins PROBLEM COUNT: Eleven BONUS COUNT: Two There will be three Ch13 problems, three Ch14 problems,

More information

Lose Big, Win Big, Sum Big: An Exploration of Ranked Voting Systems

Lose Big, Win Big, Sum Big: An Exploration of Ranked Voting Systems Bard College Bard Digital Commons Senior Projects Spring 016 Bard Undergraduate Senior Projects 016 Lose Big, Win Big, Sum Big: An Exploration of Ranked Voting Systems Erin Else Stuckenbruck Bard College

More information

Multiwinner Elections Under Preferences that Are Single-Peaked on a Tree

Multiwinner Elections Under Preferences that Are Single-Peaked on a Tree Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Multiwinner Elections Under Preferences that Are Single-Peaked on a Tree Lan Yu 1, Hau Chan 2, and Edith Elkind

More information

Positive Political Theory II David Austen-Smith & Je rey S. Banks

Positive Political Theory II David Austen-Smith & Je rey S. Banks Positive Political Theory II David Austen-Smith & Je rey S. Banks Egregious Errata Positive Political Theory II (University of Michigan Press, 2005) regrettably contains a variety of obscurities and errors,

More information

Chapter 9: Apportionment

Chapter 9: Apportionment Chapter 9: Apportionment Apportionment involves dividing something up, just like fair division. In fair division we are dividing objects among people while in apportionment we are dividing people among

More information

MATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018

MATH 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 information

Recognizing single-peaked preferences on aggregated choice data

Recognizing single-peaked preferences on aggregated choice data Recognizing single-peaked preferences on aggregated choice data Smeulders B. KBI_1427 Recognizing Single-Peaked Preferences on Aggregated Choice Data Smeulders, B. Abstract Single-Peaked preferences play

More information

13 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 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

Lecture Notes 1: Decisions and Data. In these notes, I describe some basic ideas in decision theory. theory is constructed from

Lecture Notes 1: Decisions and Data. In these notes, I describe some basic ideas in decision theory. theory is constructed from Topics in Data Analysis Steven N. Durlauf University of Wisconsin Lecture Notes : Decisions and Data In these notes, I describe some basic ideas in decision theory. theory is constructed from The Data:

More information

Topic 3 Proportional representation and Apportionment Schemes. 3.2 Quota Method of the Greatest Remainder (Hamilton s method) and paradoxes

Topic 3 Proportional representation and Apportionment Schemes. 3.2 Quota Method of the Greatest Remainder (Hamilton s method) and paradoxes Mathematics and Social Choice Theory Topic 3 Proportional representation and Apportionment Schemes 3.1 General issues of apportionment of legislature seats 3.2 Quota Method of the Greatest Remainder (Hamilton

More information

A C B D D B C A C B A D

A C B D D B C A C B A D Sample Exam 1 Name SOLUTIONS T Name e sure to use a #2 pencil. alculators are allowed, but cell phones or palm pilots are NOT acceptable. Please turn cell phones off. MULTIPLE HOIE. hoose the one alternative

More information

Combining Voting Rules Together

Combining Voting Rules Together Combining Voting Rules Together Nina Narodytska and Toby Walsh and Lirong Xia 3 Abstract. We propose a simple method for combining together voting rules that performs a run-off between the different winners

More information

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

APPLIED 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

Costly Expertise. Dino Gerardi and Leeat Yariv yz. Current Version: December, 2007

Costly Expertise. Dino Gerardi and Leeat Yariv yz. Current Version: December, 2007 Costly Expertise Dino Gerardi and Leeat Yariv yz Current Version: December, 007 In many environments expertise is costly. Costs can manifest themselves in numerous ways, ranging from the time that is required

More information

Repeated Downsian Electoral Competition

Repeated Downsian Electoral Competition Repeated Downsian Electoral Competition John Duggan Department of Political Science and Department of Economics University of Rochester Mark Fey Department of Political Science University of Rochester

More information

The Shapley Value for games with a finite number of effort levels. by Joël Adam ( )

The Shapley Value for games with a finite number of effort levels. by Joël Adam ( ) The Shapley Value for games with a finite number of effort levels by Joël Adam (5653606) Department of Economics of the University of Ottawa in partial fulfillment of the requirements of the M.A. Degree

More information

Approval Voting for Committees: Threshold Approaches

Approval Voting for Committees: Threshold Approaches Approval Voting for Committees: Threshold Approaches Peter Fishburn Aleksandar Pekeč WORKING DRAFT PLEASE DO NOT CITE WITHOUT PERMISSION Abstract When electing a committee from the pool of individual candidates,

More information

A Systematic Approach to the Construction of Non-empty Choice Sets

A Systematic Approach to the Construction of Non-empty Choice Sets A Systematic Approach to the Construction of Non-empty Choice Sets John Duggan Department of Political Science and Department of Economics University of Rochester May 17, 2004 Abstract Suppose a strict

More information

The average representation a cornucopia of power indices?

The average representation a cornucopia of power indices? The average representation a cornucopia of power indices? Serguei Kaniovski and Sascha Kurz April 5 05 Abstract We show how to construct power indices that respect proportionality between power and weight

More information

A NEW WAY TO ANALYZE PAIRED COMPARISON RULES

A NEW WAY TO ANALYZE PAIRED COMPARISON RULES A NEW WAY TO ANALYZE PAIRED COMPARISON RULES DONALD G. SAARI Abstract. The importance of paired comparisons, whether ordinal or cardinal, has led to the creation of several methodological approaches; missing,

More information

Online Appendix: Optimal Retrospective Voting

Online Appendix: Optimal Retrospective Voting Online Appendix: Optimal Retrospective Voting Ethan Bueno de Mesquita 1 Amanda Friedenberg 2 The notation and setup will be as in the main text, with the following exceptions: Let x l : Ω R be a random

More information

A 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 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 information

Coalitional Structure of the Muller-Satterthwaite Theorem

Coalitional 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 information

Methods for distance-based judgment aggregation

Methods for distance-based judgment aggregation Noname manuscript No. (will be inserted by the editor) Methods for distance-based judgment aggregation Michael K. Miller Daniel Osherson Abstract Judgment aggregation theory, which concerns the translation

More information

DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES

DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES Fabrice BARTHELEMY, Dominique LEPELLEY and Mathieu MARTIN Abstract. This paper studies the role of the quota on the occurrence of dummy players in weighted

More information

Voting. José M Vidal. September 29, Abstract. The problems with voting.

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 information

Arrow s Paradox. Prerna Nadathur. January 1, 2010

Arrow 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 information

Supplementary Online Material for Ideologues or Pragmatists?

Supplementary Online Material for Ideologues or Pragmatists? Supplementary Online Material for Ideologues or Pragmatists? Ethan Bueno de Mesquita Amanda Friedenberg September 24, 2009 Harris School, University of Chicago, 1155 E. 60 th St., Chicago, IL 60637, bdm@uchicago.edu.

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics 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 information

CMU Social choice: Advanced manipulation. Teachers: Avrim Blum Ariel Procaccia (this time)

CMU 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 information

Expected Utility Framework

Expected Utility Framework Expected Utility Framework Preferences We want to examine the behavior of an individual, called a player, who must choose from among a set of outcomes. Let X be the (finite) set of outcomes with common

More information

PREPRINT Copyright c 2005 Christopher Carter Gay, Jabari Harris, John Tolle, all rights reserved

PREPRINT Copyright c 2005 Christopher Carter Gay, Jabari Harris, John Tolle, all rights reserved PREPRINT Copyright c 2005 Christopher Carter Gay, Jabari Harris, John Tolle, all rights reserved Feasible Banzhaf Power Distributions for Five-Player Weighted Voting Systems 1 Christopher Carter Gay 2,

More information

Combinatorial Voting

Combinatorial Voting Combinatorial Voting David S. Ahn University of California, Berkeley Santiago Oliveros Haas School of Business, UC Berkeley May 00 Abstract We study elections that simultaneously decide multiple issues,

More information

Apportionment Methods

Apportionment Methods Apportionment Methods arxiv:1510.07528v1 [math.ho] 23 Oct 2015 Horst F. Niemeyer and Alice C. Niemeyer 1 1 School of Mathematics and Statistics The University of Western Australia 35 Stirling Highway Nedlands,

More information

Representation-Compatible Power Indices

Representation-Compatible Power Indices Representation-Compatible Power Indices Serguei Kaniovski Sascha Kurz August, 07 Abstract This paper studies power indices based on average representations of a weighted game. If restricted to account

More information

Empowering the Voter: A Mathematical Analysis of Borda Count Elections with Non-Linear Preferences

Empowering the Voter: A Mathematical Analysis of Borda Count Elections with Non-Linear Preferences Empowering the Voter: A Mathematical Analysis of Borda Count Elections with Non-Linear Preferences A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College by David

More information

SPATIAL VOTING (MULTIPLE DIMENSIONS)

SPATIAL 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 information

Social choice theory, Arrow s impossibility theorem and majority judgment

Social 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 information