Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

Similar documents
Exercises For DATA AND DECISIONS. Part I Voting

Arrow s Impossibility Theorem

1.6 Arrow s Impossibility Theorem

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

The Impossibilities of Voting

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Fairness Criteria. Review: Election Methods

SOCIAL CHOICES (Voting Methods) THE PROBLEM. Social Choice and Voting. Terminologies

answers to some of the sample exercises : Public Choice

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25

Voting: Issues, Problems, and Systems, Continued

9.3 Other Voting Systems for Three or More Candidates

12.2 Defects in Voting Methods

Elections with Only 2 Alternatives

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

(67686) Mathematical Foundations of AI June 18, Lecture 6

Mathematical Thinking. Chapter 9 Voting Systems

MATH 1340 Mathematics & Politics

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Voting: Issues, Problems, and Systems, Continued. Voting II 1/27

Topics on the Border of Economics and Computation December 18, Lecture 8

Voting Criteria April

Social welfare functions

Social Choice: The Impossible Dream. Check off these skills when you feel that you have mastered them.

Chapter 1 Practice Test Questions

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate.

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker

The search for a perfect voting system. MATH 105: Contemporary Mathematics. University of Louisville. October 31, 2017

The Mathematics of Voting. The Mathematics of Voting

Math116Chap1VotingPart2.notebook January 12, Part II. Other Methods of Voting and Other "Fairness Criteria"

How should we count the votes?

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures

The Mathematics of Voting

Intro to Contemporary Math

The Mathematics of Voting

Name Date I. Consider the preference schedule in an election with 5 candidates.

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

Introduction to Social Choice

Voting: Issues, Problems, and Systems. Voting I 1/36

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Introduction to the Theory of Voting

Math for Liberal Studies

Main idea: Voting systems matter.

Math for Liberal Studies

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

Rationality of Voting and Voting Systems: Lecture II

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

Sect 13.2 Flaws of Voting Methods

VOTING SYSTEMS AND ARROW S THEOREM

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku

Social Choice & Mechanism Design

that changes needed to be made when electing their Presidential nominee. Iowa, at the time had a

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Chapter 4: Voting and Social Choice.

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion.

Chapter 9: Social Choice: The Impossible Dream

1 Voting In praise of democracy?

The Math of Rational Choice - Math 100 Spring 2015

Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections

Computational Social Choice: Spring 2007

Democratic Rules in Context

Approaches to Voting Systems

Voting Protocols. Introduction. Social choice: preference aggregation Our settings. Voting protocols are examples of social choice mechanisms

An Introduction to Voting Theory

Many Social Choice Rules

Arrow s Impossibility Theorem on Social Choice Systems

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Voting: Issues, Problems, and Systems. Voting I 1/31

2-Candidate Voting Method: Majority Rule

Syllabus update: Now keeping best 3 of 4 tests

Voting System: elections

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

Trying to please everyone. Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam

The mathematics of voting, power, and sharing Part 1

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

In this lecture we will cover the following voting methods and fairness criterion.

Reality Math Sam Kaplan, The University of North Carolina at Asheville Dot Sulock, The University of North Carolina at Asheville

1.1 The Basic Elements of an Election 1.2 The Plurality Method

CSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1

The actual midterm will probably not be multiple choice. You should also study your notes, the textbook, and the homework.

Voting: Issues, Problems, and Systems

Voting and preference aggregation

Presidential Election Democrat Grover Cleveland versus Benjamin Harrison. ************************************ Difference of 100,456

Voting and preference aggregation

Voting Systems. High School Circle I. June 4, 2017

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching.

Problems with Group Decision Making

Make the Math Club Great Again! The Mathematics of Democratic Voting

Introduction: The Mathematics of Voting

Practice TEST: Chapter 14

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate.

Voting Methods

POSITIVE POLITICAL THEORY

Transcription:

Desirable properties of social choice procedures We now outline a number of properties that are desirable for these social choice procedures: 1. Pareto [named for noted economist Vilfredo Pareto (1848-1923)] If alternative a is preferred to alternative b on every voter s ballot, then b is never a winner. 2. Condorcet [named for another economist, Marie-Jean-Antoine- Nicolas de Caritat, the Marquis de Condorcet (1743-1794)] If in a pairwise comparison with each of the other alternatives, alternative a emerges the winner (whereby it is referred to as the Condorcet winner), then a is the only winner of the election. 3. Monotonicity (or non-perversity) Suppose alternative a is one of the winners. If one of the voters then modifies his ballot by moving a higher up in his preference ordering, and the election is redecided, a is still declared a winner. 4. Independence of irrelevant alternatives Suppose a is a winner and b is not. If some of the voters then modify their ballots in such a way that their prior preference of a over b (or of b over a) is not altered in the process, then when the election is redecided, b is still not declared a winner.

Which of the five social choice procedures satisfy these desirable properties? The following table gives the answers: Pareto Condorcet Monotonicity I.I.A. Plurality Borda Hare Seq. Pairs Dictator For arguments that show why the cells marked are true, see Taylor, pp. 108 113. For examples that illustrate why the cells marked are ture, see Taylor, pp. 113 120. In particular, it is important to note that none of the social choice procedures satisfy all four of the desirable properties. This is not because of some flaw in each one of these procedures; indeed, it is a flaw in the inherent nature of social choice. Theorem. social choice procedure for dealing with more than three alternatives can satisfy both the Condorcet criterion and the Independence of irrelevant alternatives criterion.

Before we prove this theorem, let us first consider a phenomenon known as the Condorcet voting paradox (attributed, of course, to the Marquis de Condorcet). It illustrates some of the difficulties that any social choice function must deal with. Suppose that a public with three voters faces an election amongst three alternatives a, b, c. If the three ballots are p 1 p 2 p 3 a c b b a c c b a then which alternative should a good social choice procedure choose for a winner? If a is chosen the winner, then p 2 and p 3 could argue that they form a majority of the public who prefer c to a. If b is chosen the winner, then p 1 and p 2 could argue that they form a majority of the public who prefer a to b. And if c is chosen the winner, then p 1 and p 3 could argue that they form a majority of the public who prefer b to c. Thus no social procedure function can settle on a unique winner that isn t inferior to some other alternative to a majority of voters!

A proof of the theorem we stated earlier proceeds as follows: Proof. Suppose there were some social choice procedure that did satisfy both the Condorcet criterion and the Independence of irrelevant alternatives criterion. How then would this procedure deal with the set of ballots p 1 p 2 p 3 a c b b a c c b a which we looked at earlier? Consider what happens if the third voter switches the positions of alternatives b and c. In this event, c would defeat both a and b in a pairwise comparison, hence for that set of ballots, c would have to be the unique winner, as we are assuming that our procedure satisfies the Condorcet criterion. However, in the given set of ballots, the preference of c over a is the same as in the modified set of ballots. Thus, since we are assuming that our procedure satisfies the I.I.A. criterion, for the original set of ballots, a cannot be declared the winner.

The (original set of) ballots in this election are symmetric with respect to the three alternatives, so the argument we have given to show that a cannot be a winner can be modified, by permuting the alternatives, to show that b cannot be the winner either, and that c cannot the winner. But then the social choice procedure we are considering has no winners, which is impossible. This contradiction implies that our assumption that the social procedure satisfied both the Condorcet criterion and the Independence of irrelevant alternatives criterion could not hold, completing the proof. //