Chapter 9: Social Choice: The Impossible Dream

Similar documents
Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

9.3 Other Voting Systems for Three or More Candidates

1.6 Arrow s Impossibility Theorem

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Main idea: Voting systems matter.

Arrow s Impossibility Theorem

Elections with Only 2 Alternatives

Mathematical Thinking. Chapter 9 Voting Systems

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

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

Homework 7 Answers PS 30 November 2013

Math for Liberal Arts MAT 110: Chapter 12 Notes

2-Candidate Voting Method: Majority Rule

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

Arrow s Impossibility Theorem on Social Choice Systems

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

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

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

Math Circle Voting Methods Practice. March 31, 2013

Voting: Issues, Problems, and Systems, Continued

Math for Liberal Studies

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

Voting Methods

Chapter 1 Practice Test Questions

MATH 1340 Mathematics & Politics

12.2 Defects in Voting Methods

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

Voting Criteria April

Intro to Contemporary Math

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

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.

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

Many Social Choice Rules

Social welfare functions

1.1 The Basic Elements of an Election 1.2 The Plurality Method

Exercises For DATA AND DECISIONS. Part I Voting

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

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

Font Size: A A. Eric Maskin and Amartya Sen JANUARY 19, 2017 ISSUE. 1 of 7 2/21/ :01 AM

Fairness Criteria. Review: Election Methods

The Mathematics of Voting

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

Josh Engwer (TTU) Voting Methods 15 July / 49

Computational Social Choice: Spring 2007

Lecture 11. Voting. Outline

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Warm Up Day 2 Determine the Plurality, Borda, Runoff, and Sequential Runoff winners.

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

The Mathematics of Voting

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

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

The mathematics of voting, power, and sharing Part 1

How Should Members of Parliament (and Presidents) Be Elected? E. Maskin Institute for Advanced Study

Electing the President. Chapter 12 Mathematical Modeling

VOTING SYSTEMS AND ARROW S THEOREM

answers to some of the sample exercises : Public Choice

Simple methods for single winner elections

Arrow s Conditions and Approval Voting. Which group-ranking method is best?

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

What is the Best Election Method?

The Arrow Impossibility Theorem: Where Do We Go From Here?

Math for Liberal Studies

Rock the Vote or Vote The Rock

Introduction to the Theory of Voting

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

How should we count the votes?

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

Social Choice & Mechanism Design

Warm Up Day 2. # Problem Work Answer 1 2

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Grade 7/8 Math Circles Winter March 6/7/8 The Mathematics of Voting

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

PROBLEM SET #2: VOTING RULES

Grade 6 Math Circles Winter February 27/28 The Mathematics of Voting - Solutions

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

The Impossibilities of Voting

Lecture 16: Voting systems

Voting: Issues, Problems, and Systems

MATH 1340 Mathematics & Politics

The Mathematics of Voting. The Mathematics of Voting

Public Choice. Slide 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.

Lecture 12: Topics in Voting Theory

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

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

Rationality & Social Choice. Dougherty, POLS 8000

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

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

The Math of Rational Choice - Math 100 Spring 2015

Chapter 4: Voting and Social Choice.

VOTING TO ELECT A SINGLE CANDIDATE

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

Problems with Group Decision Making

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

Is Majority Rule the Best Voting Method? Partha Dasgupta and Eric Maskin

Computational Social Choice: Spring 2017

Problems with Group Decision Making

Transcription:

Chapter 9: Social Choice: The Impossible Dream The application of mathematics to the study of human beings their behavior, values, interactions, conflicts, and methods of making decisions is generally considered to be a recent thing. Yet the study of voting and social choice goes back several centuries. One primary example of a social choice problem is the selection of a good voting system. Voting is a subject that lies at the very heart of representative government and participatory democracy. Problem to be addressed: determine a good procedure that will turn individual preferences for different candidates into a single choice by the whole group. The goal is to find such procedures that will result in an outcome that reflects the will of the people. We begin in Chapter 9 with the question of how a group of individuals, each with his or her own set of values, selects one outcome from a list of possibilities. While majority rule is a good system for deciding an election with just two candidates, it turns out that there is no perfect way of deciding an election in which there are three or more candidates. 1

We start in section 9.1 with An Introduction to Social Choice. Most elections with which we are familiar involve two candidates; however, there are times when three or more candidates are vying for an office. Often, as in a recent mayoral election in Russellville or in the last senatorial election in Arkansas, when more than two candidates are vying for a position, we are required to have a runoff, since one candidate does not capture a majority of the votes. This is costly in terms of both time and resources, so it would be helpful to find a better method. Also, as in the case of the 2000 presidential election (arguably the most controversial presidential election in U.S. history), the fact that there were numerous candidates on the ballot actually changed the outcome of the election, due to the situation in Florida, where George W. Bush beat Al Gore by only a few hundred votes, which caused Bush to win the state of Florida and win the presidential election! There are several methods that can be used to elect a single candidate from a choice of three or more, and many of them involve the use of a Preference List Ballot, which we will examine more closely in a few minutes. 2

A ballot consisting of a rank ordering of candidates (which we often picture as a vertical list with the most preferred candidate on top and the least preferred on the bottom) is called a preference list ballot because it is a statement of the preferences of the individual who is voting. Preference list ballots allow voters to make a much clearer statement of their preferences than ballots allowing only a single vote. They are used in situations such as rating football teams and scoring track meets. Although we do not allow ties in a preference list ballot, most voting rules of interest will result in a tie at times. In the real world, the number of voters is often so large that ties seldom occur. However, to simplify what we do in this chapter, we make the following assumption. The number of voters assumption: Throughout this chapter, we consider only elections in which there is an odd number of voters. 3

Suppose we were to vote on something in this class. If there is an odd number of students, then we have no problem. If there is an even number, I could vote to make it an odd number. That way, there is no possibility of a tie. A majority will definitely occur, which will be a minimum of half of the votes plus 1. Let's do a simple vote. Consider Coke vs. Pepsi or Rock vs. Country. 4

9.2 Majority Rule and Condorcet's Method When a choice is being made between two candidates, the first type of voting system to suggest itself is majority rule. Each voter indicates a preference for one of the two, and the one with the most votes wins. There are three good things about majority rule. 1) All voters are treated equally. (Everyone's vote counts the same.) 2) Both candidates are treated equally. (If a new election were held and every voter reversed his or her vote, the outcome would be reversed as well.) 3) It is monotone. (If candidate X is the winner and a new election is held in which the only change made is for one more person to vote for X, then X will remain the winner.) These things seem obvious to us, but consider situations in which each of these properties would not hold. For example, condition 1) is not satisfied in a dictatorship (such as in Cuba), where the voters are not treated equally. The ballots of all voters except the dictator are ignored. Condition 2) is not satisfied in a situation of imposed rule (such as in a small town good old boy network) where the candidates are not treated equally. It may be a matter of "who you know" rather than "what you know." And condition 3) is not satisfied in minority rule (such as in a golf game, where the lowest score wins), because if the person with the lowest score (the winner) got another point (vote), they may not still be the winner. 5

May's Theorem (proved in 1952 by Kenneth May) tells us that among all twocandidate voting systems that never result in a tie, majority rule is the only one that treats all voters equally, treats both candidates equally, and is monotone. But what if there are three or more candidates? Is there a way to build on the strengths of majority rule? It turns out that there is a system that does just that, and it is called Condorcet's method. Our description of Condorcet's method begins with the observation that if we have a sequence of preference list ballots, then, for each pair of candidates, we can determine who the winner would have been had the election involved only these two in a one one one contest using majority rule. Consider the following example involving candidates A, B, and C: Rank Number of Voters (3) First A B C Second B C A Third C A B The 1st voter ranked A first, B second, and C third, the 2nd voter ranked B first, C second, and A third, and the 3rd voter ranked C first, A second, and B third. 6

To help us better understand a preference list ballot, let's do one of our own. We can rank holidays, ice cream flavors, restaurants, or presidential candidates, to name just a few. 7

Another example of a preference list ballot is shown below. This time there are 15 voters. 8

Description of Condorcet's Method: With the voting system known as Condorcet's method, a candidate is a winner precisely when he or she would, on the basis of the ballots cast, defeat every other candidate in a one on one contest using majority rule. (Historically, the voting system attributed to the Marquis de Condorcet in the 18th century was actually developed by Ramon Llull in the 13th century.) Example: Determine the winner in each preference list ballot below using Condorcet's method. 9

10

Condorcet s voting paradox can occur with three or more candidates in an election where Condorcet s method yields no winners. For example, in a three candidate race, two thirds of voters could favor A over B, two thirds of voters could favor B over C, and two thirds of voters could favor C over A. This is the example given in the text. With three or more candidates, there are elections in which Condorcet s method yields no winners. Does Condorcet s voting paradox occur in the following tables? 11

12

Ex: A committee of five people is looking for a new math department head, and they have narrowed it down to four candidates, whose names are Bill, Carol, Dennis, and Evelyn. They have expressed their preferences using the preference list ballot below. Use the Condorcet method to determine who will get the job. Homework: Read pp. 327 332 and do hw #9. 13

14