Elections with More Than Two Candidates

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.
Presented by: Katherine Goulde
Mark Wang John Sturm Sanjeev Kulkarni Paul Cuff.  Basic Background – What is the problem?  Condorcet = IIA  Survey Data  Pairwise Boundaries = No.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
Chapter 1: Methods of Voting
VOTING SYSTEMS Section 2.5.
Math for Liberal Studies.  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express.
MA 110: Finite Math Dr. Maria Byrne Instructional Laboratory 0345 Lecture 10/31/2008.
MAT 105 Fall  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
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.
1.1, 1.2 Ballots and Plurality Method
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.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
MAT 105 Spring  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express their.
MAT 105 Spring  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
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.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.2 Flaws of Voting.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Review of Common Test #1 Mistakes. Plurality versus Majority Plurality winner = candidate with more first place votes than any other Majority winner =
Voting System Review Borda – Sequential Run-Off – Run-Off –
Voting Systems. EU 9 The manner in which individual interest are coordinated defines the system. EQ 5.9 Is there a better way to coordinate our interests?
My guy lost? What’s up with that….  In the 1950’s, Kenneth Arrow, a mathematical economist, proved that a method for determining election results that.
 Harder than you might think  There are many examples in history where the results were disputed.
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
Condorcet Method Another group-ranking method. Development of Condorcet Method  As we have seen, different methods of determining a group ranking often.
Voting: Does the Majority Always Rule?
Discrete Mathematics Election Theory Unit.
Voting and Apportionment
1 The Mathematics of Voting
Impossibility and Other Alternative Voting Methods
1.
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
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Bellringer What are the three formal qualifications to be president?
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Electoral College Notes
Alex Tabarrok Strategic Voting.
Warm Up – 5/27 - Monday How many people voted in the election?
Warm Up – 1/23 - Thursday How many people voted in the election?
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 Preference Ballots and Preference Schedules
MAT 105 Fall 2008 More Voting Methods.
p.33 (28 run off, 30 run off, 32, 34ab run off)
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Quiz – 1/24 - Friday How many people voted in the election?
Flaws of the Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Elections with More Than Two Candidates MAT 105 Fall 2008 Elections with More Than Two Candidates

Two Candidates: Easy As we have discussed, when there are only two candidates in an election, deciding the winner is easy May’s Theorem states that majority rule is the “best” system

Three or More Candidates: Hard However, the situation is much more tricky when there are more than two candidates The system we typically use in the US is called plurality voting Each voter casts a single vote for their top preference, and the candidate that gets more votes than any other is the winner

Flaws with Plurality We have seen several historical examples that show flaws with the plurality system One major flaw is that often the winner of an election is least-preferred by a majority of the voters (1912 Presidential, 1998 MN Gubernatorial) Another flaw is the inability for voters to express their true preference: in 2000, many voters would have cast their ballots for Nader or Buchanan, but did not want to “throw away” their votes

A Better Way? We would like to find a voting method that fixes these problems Whenever there is a close or controversial election, there is an effort to try to reform or improve the system This has occurred throughout democratic history, and many alternative systems have been developed

Marquis de Condorcet A philosopher and mathematician, Condorcet was well aware of the flaws in the plurality system Condorcet suggested a method based on the fact that majority rule works so well for two candidates

The Condorcet Method Every voter fills out a ballot that lists his or her entire preference list For example, a voter might have the preference D > A > C > B, which means he or she prefers D most, A second most, C third most, and B least Remember, in a plurality election, this voter would only have been able to cast a single vote for D

Pairwise Elections Once all of the ballots are submitted, we consider all of the different pairings of two candidates against one another If there are three candidates, there are three pairings: A vs. B, A vs. C, and B vs. C If there are four candidates, there are six pairings: AB, AC, AD, BC, BD, CD

Finding the Winner of a Pairwise Election Using the preference ballots, we determine the winner of each pairwise election Recall the voter who submitted the ballot with preference D > A > C > B In the A vs. B election, this vote would count toward A’s total, since it lists A higher than B

An Example On the right we have listed some preferences together with the number of voters who have those preferences. This is called a “voter profile” Now below we compute the winner of each pairwise election: Number of Voters Preference Order 6 Milk > Soda > Juice 5 Soda > Juice > Milk 4 Juice > Soda > Milk Milk Soda 6 5 4 Total: 6 Total: 9 Milk Juice 6 5 4 Total: 6 Total: 9 Soda Juice 6 5 4 Total: 11 Total: 4

The Condorcet Winner Using this method, the winner is the candidate that wins all of the pairwise elections it is involved in In our example, since Soda beat Milk and Soda beat Juice, Soda is the Condorcet winner Polling data strongly suggests that Al Gore would have been the Condorcet winner in the 2000 Presidential election in Florida

Advantages of Condorcet’s Method One big advantage of this method is that it allows voters to express their full preferences In addition, the method relies on majority rule, which we know to be a “fair” system However, the Condorcet method has a major flaw, which was known to Condorcet even as he was advocating its use

The “Condorcet Paradox” Consider this voter profile with three candidates Notice that there is no Condorcet winner Number of Voters Preference Order 10 A > B > C 9 B > C > A 8 C > A > B A B 10 9 8 Total: 18 Total: 9 A C 10 9 8 Total: 10 Total: 17 B C 10 9 8 Total: 19 Total: 8

Using Condorcet as a Guide The major flaw of Condorcet’s method is that it sometimes doesn’t determine a winner Imagine the chaos that would result if this occurred during a national election However, if there is a Condorcet winner, it is natural to think that the Condorcet winner should be the winner of an election no matter what method is used

The Condorcet Winner Criterion (CWC) We say that a voting method satisfies the “Condorcet Winner Criterion” if, whenever there is a Condorcet winner, this method determines the same winner as the Condorcet winner We know that plurality does not satisfy this criterion, since in Florida in 2000, Al Gore would have been the Condorcet winner, but not the plurality winner Knowing that a voting method satisfies the CWC tells us that the method is “fair” in some sense

Another Example 6 A > B > C > D 5 B > D > A > C 3 Number of Voters Preference Order 6 A > B > C > D 5 B > D > A > C 3 D > B > A > C 1 C > A > B > D This example also shows that plurality doesn’t satisfy the CWC The plurality winner is A, but the Condorcet winner is B Who should win this election? A B 6 5 3 1 7 8 A C 6 5 3 1 14 A D 6 5 3 1 7 8 B C 6 5 3 1 14 B D 6 5 3 1 12 C D 6 5 3 1 7 8