MAT 105 Fall 2008 More Voting Methods.

Slides:



Advertisements
Similar presentations
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Advertisements

Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Voting Methods Continued
Voting and social choice Vincent Conitzer
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
Chapter 1: Methods of Voting
Muppets Use Instant Runoff Voting. Starting in the early '90s, the Henson production company started to pay the Muppets with stock options rather than.
VOTING SYSTEMS Section 2.5.
Math for Liberal Studies.  In most US elections, voters can only cast a single ballot for the candidate he or she likes the best  However, most voters.
MAT 105 Spring  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss a few.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
MAT 105 Spring  As we have discussed, when there are only two candidates in an election, deciding the winner is easy  May’s Theorem states that.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
What is your favorite food?. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The.
Math for Liberal Studies.  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss.
CPS Voting and social choice
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
The Electoral College and Alternative Voting Systems
Social choice (voting) Vincent Conitzer > > > >
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
CPS Voting and social choice Vincent Conitzer
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
Let’s take a class vote. How many of you are registered to vote?
Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.
1.4 The Plurality-with Elimination Method
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Warm-Up Rank the following soft drinks according to your preference (1 being the soft drink you like best and 4 being the one you like least)  Dr. Pepper.
The Mathematics of Voting Chapter 1. Preference Ballot A Ballot in which the voters are asked to rank the candidates in order of preference. 1. Brownies.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Voting System Review Borda – Sequential Run-Off – Run-Off –
Activity 3 Improving on Plurality? Decision methods using ordinal ballots.
1.
Voting: Does the Majority Always Rule?
1 The Mathematics of Voting
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Impossibility and Other Alternative Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Elections with More Than Two Candidates
American Government and Organization
Warm Up – 5/27 - Monday How many people voted in the election?
Warm Up – 1/23 - Thursday How many people voted in the election?
Social Choice Theory [Election Theory]
Classwork: p.33 (27abc run off, 29ab run off, 31, 33ab run off)
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting and social choice
Chapter 1 – MATH ANALYSIS
Muppets Use Instant Runoff Voting
CPS 173 Voting and social choice
p.33 (28 run off, 30 run off, 32, 34ab run off)
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
CPS Voting and social choice
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

MAT 105 Fall 2008 More Voting Methods

More Methods There are many more methods for determining the winner of an election with more than two candidates We will only discuss a few more: sequential pairwise voting Hare system plurality runoff

Sequential Pairwise Voting Idea: We like pairwise voting (where we can use majority rule), but if we look at all pairwise elections, we sometimes don’t get a winner In sequential pairwise voting, we put the candidates in order on a list, called the agenda

How It Works We pit the first two candidates on the agenda against each other. The winner moves on to face the next candidate on the list, and so on. The candidate remaining at the end is the winner. This process resembles a tournament bracket, and has the advantage that, unlike Condorcet’s method, we always get a winner

An Example Let’s use sequential pairwise voting with this profile and the agenda A, B, C, D Voters Preference Order 4 A > B > D > C 3 C > A > B > D B > D > C > A A A beats B, 7-3 A C beats A, 6-4 B C D beats C, 7-3 C D D

Problems If we look closely at this agenda, we notice that every single voter prefers B over D, and yet D was our winner! In fact, by cleverly choosing the right agenda, we could make any of the four candidates win this election Sequential pairwise voting does not satisfy the Pareto condition Voters Preference Order 4 A > B > D > C 3 C > A > B > D B > D > C > A

The Pareto Condition If every voter prefers one candidate over another, then the latter candidate should not be among the winners of the election Named for Vilfredo Pareto (1848-1923), Italian economist Does plurality satisfy the Pareto condition?

Another Method: The Hare System Also known as Instant Runoff Voting, this system is used for various elections in the US, Canada, the UK, Ireland, and Australia Repeatedly delete candidates that are “least preferred” in the sense of being at the top of the fewest ballots. If there is a tie, eliminate all of the tied candidates, until there is no one left to eliminate

An Example Voters Preference Order 5 A > B > C 4 C > B > A 3 B > C > A 2 B > A > C In this example, A has 5 first-place votes, B has 5 first-place votes, and C has 4 first-place votes, so C is eliminated Now A has 5 first-place votes, and B has 9, so A is eliminated B is the only candidate left, so B is the winner Voters Preference Order 5 A > B 4 B > A 3 2

Another Example Voters Preference Order 5 A > B > C 4 C > B > A 3 B > C > A 1 B > A > C This time, A has 5 first-place votes, and B and C are tied with 4, so B and C are both eliminated at the same time This leaves only A to win the election

Problems Now let’s modify the profile from the previous example, so that the 1 voter with preference B > A > C now has preference A > B > C Notice that this change moves the winner higher on that voter’s ballot Voters Preference 6 A > B > C 4 C > B > A 3 B > C > A Voters Preference 6 A > C 4 C > A 3 C wins!

Why is this a problem? A was the winner of the original election, and one of the voters changed his ballot to move A higher, causing A to lose This shows that the Hare system is not monotone

Monotone A voting system is monotone if whenever a candidate is a winner, and a new election is held where the only change is for some voter to move that winner higher on his/her ballot, then the original winner should remain the winner The Hare system is not monotone, but despite this drawback it is one of the more common alternative voting systems in use today

One More Method: Plurality Runoff Hold a plurality election, but if no candidate receives a majority, we hold a runoff election The runoff election is between the two candidates who received the most first-place votes in the original election In case of ties, there might be more than two candidates with the most first-place votes, so we use plurality to decide a winner between those candidates only

Example Voters Preference Order 5 A > B > C 4 C > B > A 3 B > C > A 2 B > A > C In this profile, A gets 5 first-place votes, B gets 5 first-place votes, and C only gets 4 The runoff is between A and B B wins the runoff 9 votes to 5

Another Example Voters Preference Order 4 A > B > C > D 3 C > D > B > A B > C > D > A 2 D > B > A > C In this profile, A has 4 first-place votes, B has 3, C has 3, and D has 2 The runoff is between A, B, and C We use plurality to decide the winner; keep in mind that the 2 voters who like D best get to vote in the runoff! B wins the runoff with 5 votes