Social Choice Theory [Election Theory]

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

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
Chapter 1: Methods of Voting
The Mathematics of Elections
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
VOTING SYSTEMS Section 2.5.
Excursions in Modern Mathematics Sixth Edition
1.1, 1.2 Ballots and Plurality Method
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.
Using a Modified Borda Count to Predict the Outcome of a Condorcet Tally on a Graphical Model 11/19/05 Galen Pickard, MIT Advisor: Dr. Whitman Richards,
1 The Mathematics of Voting
Group-Ranking How is group ranking accomplished?.
Social Choice Topics to be covered:
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.
CRITERIA FOR A FAIR ELECTION
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
1.3 More Group Ranking and Paradoxes Ms. Magne Discrete Math.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting The Paradoxes of Democracy Vote! In.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
May 19, 2010Math 132: Foundations of Mathematics 12.5 Homework Solutions 27. (a) 28. (b) 29. (d) 30. (e) 53. Positive Correlation, Weak 54. Negative Correlation,
Ch Voting Preference tables E, F, G, and H are running for math club president If everyone is asked to rank their preferences, how many different.
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 12 sec 1. Def. Each person votes for his or her favorite candidate. The candidate receiving the most votes is declared the winner.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 14 Voting and Apportionment.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
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
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.1, Slide 1 11 Voting Using Mathematics to Make Choices.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
1.6 Rankings. Sometimes, we are not just interested in the first place winner of the election, but also want to know who comes in second, third … There.
VOTING PARADOXES AND HOW TO DEAL WITH THEM Hannu Nurmi University of Turku Turku, Finland.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 1 - Slide Election Theory 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.
The mathematics of voting The paradoxes of democracy.
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.
Activity 3 Improving on Plurality? Decision methods using ordinal ballots.
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?
Voting and Apportionment
Plurality and Borda Count Method
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Lecture 1: Voting and Election Math
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.
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
Plurality with Elimination
Chapter 1 – MATH ANALYSIS
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?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Social Choice Theory [Election Theory] Voting Methods Plurality, Majority, Borda Count, Runoff, Sequential Runoff, Condorcet

Preference Schedules A list or table of all candidates/options ranked in order of preference, and the number of people who prefer them in that order more preferred moving in the direction the arrow points A B C D B C D A C B D A D B C A 8 5 6 7

PLURALITY & MAJORITY Plurality – winner chosen by most “1st place” votes Majority – requires winner to get MORE than ½ of “1st place” votes A B C D B C D A C B D A D B C A 8 5 6 7

BORDA COUNT 8 5 6 7 Winner chosen using a point system A B C D B C B B Common point assignments last place = 1 point, next to last = 2 points, etc… One could also assign point values of 0, 1, 2, etc. to make the math easier A B C D B C D A C B D A D B C A 8 5 6 7

BORDA COUNT - work 8 5 6 7 A: 8(3) + 5(0) + 6(0) + 7(0) = 24 assign points 3 2 1 A B C D B C D A C B D A D B C A 8 5 6 7

D is the winner by a vote of 18 to 8 RUNOFF The two candidates receiving the most 1st place votes are put in a head-to-head match up to determine winner. 1st place vote totals A: 8 eliminate candidates B & C B: 5 b/c they have the C: 6 fewest 1st place votes D: 7 A B C D B C B B Re-total the votes based on whether A or D was more preferred in each schedule A: 8 D: 5 + 6 + 7 = 18 C D D C D A A A 8 5 6 7 D is the winner by a vote of 18 to 8

C is the winner by a vote of 18 to 8 SEQUENTIAL RUNOFF The candidate with the fewest first place votes is eliminated in round 1, votes are re-tallied without that candidate, and again the candidate with the fewest 1st place votes is eliminated; continue until only one candidate remains, who we declare the winner. 1st place vote totals A: 8 eliminate candidate B (lowest #) B: 5 C: 6 D: 7 A B C D B C B B Re-total the votes based on whether A, C, or D was more preferred in each schedule A: 8 C: 5 + 6 = 11 eliminate candidate D D: 7 C D D C D A A A Re-total the votes based on whether A or C was more preferred in each schedule A: 8 C: 5 + 6 + 7 = 18 8 5 6 7 C is the winner by a vote of 18 to 8

CONDORCET METHOD A Condorcet winner is the candidate that would defeat all other candidates in a runoff election (head-to-head matchup) Condorcet Paradox – there is not always a Condorcet winner (rock, paper, scissors) A B C D B C D A C B D A D B C A 8 5 6 7

CONDORCET METHOD 8 5 6 7 A B C D B C D A C B D A D B C A Read Row vs. Col. A B C D A vs. B 8 to 18 L A vs. C A vs. D B vs. A 18 to 8 W B vs. C 20 to 6 B vs. D 19 to 7 C vs. A C vs. B 6 to 20 C vs. D D vs. A D vs. B 7 to 19 D vs. C 7 to 19 L A B C D B C D A C B D A D B C A 8 5 6 7 Since B is more preferred over all other candidates when paired head-to-head, B is the Condorcet Winner