Review of Common Test #1 Mistakes. Plurality versus Majority Plurality winner = candidate with more first place votes than any other Majority winner =

Slides:



Advertisements
Similar presentations
Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Advertisements

Voting Methods Continued
Learning Voting Trees Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffrey S. Rosenschein.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
Chapter 1: Methods of Voting
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
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 Spring  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss a few.
Excursions in Modern Mathematics Sixth Edition
The Plurality Method The Borda Count Method
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
Voting Review Material
When you vote for the President you are actually voting for an ELECTOR to vote for you Each state has a determined number of electors.
Plurality with elimination, Runoff method, Condorcet criterion.
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.
Jana Behm Math 320 July 7,  Voting Systems and how they can effect outcomes  *Majority Rule  *Plurality Voting  *Electoral College.
CRITERIA FOR A FAIR ELECTION
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Conditional Statements. This is VERY IMPORTANT! We will show the failure of the fairness criteria by showing the first part of the conditional is true.
1.3 More Group Ranking and Paradoxes Ms. Magne Discrete Math.
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.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
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.
How are Presidents Elected? Unit 10 Part 2. Electoral College – Today – New Way The electoral college elects the president – NOT THE DIRECT or “POPULAR”
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Part 4: Voting Topics - Continued
Fairness Criteria and Arrow’s Theorem Section 1.4 Animation.
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.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Fairness Criteria Fairness Criteria: properties we expect a good voting system to satisfy.Fairness Criteria: properties we expect a good voting system.
Voting System Review Borda – Sequential Run-Off – Run-Off –
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.
True or False: The Candidate with the most votes is elected President?
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
Voting: Does the Majority Always Rule?
1 The Mathematics of Voting
1.
Plurality with elimination, Runoff method, Condorcet criterion
8.2 Voting Possibilities and Fairness Criteria
1.3 The Borda Count Method.
ELECTORAL COLLEGE.
7th Grade Social Studies Name____________________
Elections with More Than Two Candidates
Let’s say we have a town of 10,000 people electing a mayor using the Plurality with Elimination Voting Method. There are 4 candidates, candidate A, candidate.
Electoral College.
Election #1 Popular Vote Electoral Vote State Red Yellow
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.
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?
ELECTORAL COLLEGE.
Flaws of the Voting Methods
Voting Fairness.
Presentation transcript:

Review of Common Test #1 Mistakes

Plurality versus Majority Plurality winner = candidate with more first place votes than any other Majority winner = candidate with more than 50% of the first place votes. Plurality = the most votes Majority = most of the votes 50% is not a majority and more than 50% does not mean 51% or more

Majority criterion versus Majority rules method Majority criterion = If a candidate has a majority of first places votes, then that candidate should win (by whatever method is used) Majority rules method = the candidate with more than 50% of the votes is the winner.

Difference between the voting methods and the fairness criteria Majority criterion = If a candidate has a majority of votes, that candidate should win (regardless of the method used to determine the winner) Majority method = The candidate with a majority of votes is the winner. Condorcet criterion = If a candidate beats all others in one-on-one contests, then that candidate should win (regardless of the method used to determine the winner). Condorcet method = The candidate that beats all other candidates one-on-one is the winner. Incidentally, neither the majority method nor the Condorcet method guarantee a winner (when voting with 3 or more candidates) and therefore are not “legitimate” methods of voting (with 3 or more candidates).

Showing the failure of fairness criteria All of the fairness criteria can be written in the form of a conditional statement. To show the failure of the fairness criteria requires demonstrating the negation of the corresponding conditional. For example: Given a condition of fairness in the form: “If P then Q” The negation is “P and not Q”. This shows the condition of fairness was not met.

Negating the majority criterion Majority criterion = If a candidate has a majority of first place votes, then that candidate should win. Negation: A candidate has a majority of first place votes and doesn’t win. Notice that saying a candidate wins and doesn’t have a majority is not a negation of the majority criterion (it is actually negating the converse which is not logically the same)

Majority criterion and its converse Majority criterion = If a candidate has a majority of first place votes, then that candidate should win. The converse = If a candidate wins, then they have a majority of first place votes. To show failure of the majority criterion, you must demonstrate a negation of the criterion not its converse. Demonstrating that a candidate wins and doesn’t have a majority of votes does not demonstrate a failure of the majority criterion, it only shows failure of the converse.

Negating the Condorcet Winner Criterion CWC = If a candidate beats all others in one-on- one contests, then that candidate should win the election. Negation = A candidate beats all others in one- on-one contests and doesn’t win the election (by whatever method). Notice that winning and not beating all other candidates one-on-one is negating the converse of the CWC and is not logically the same thing.

CWC and its converse CWC = If a candidate beats all others one- on-one, then that candidate should win. The converse = If a candidate wins, then the candidate beats all others one-on-one. To show a candidate wins and does not beat all others one-on-one shows failure of the converse and does not demonstrate a failure of the CWC.