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.

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

Arrow’s Conditions and Approval Voting
Weighted Voting, Algorithms and Voting Power
VOTING. BINARY METHODS Choosing between only two alternatives at time Majority Rule Pairwise voting Condorcet Method Agenda Paradox.
Voting Methods Continued
Presented by: Katherine Goulde
Voting and social choice Vincent Conitzer
1.4 Arrow’s Conditions and Approval Voting
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
Chapter 1: Methods of Voting
VOTING SYSTEMS Section 2.5.
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.
1 Message to the user... The most effective way to use a PowerPoint slide show is to go to “SLIDE SHOW” on the top of the toolbar, and choose “VIEW SHOW”
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.
Group-Ranking How is group ranking accomplished?.
Social Choice Topics to be covered:
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
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
CRITERIA FOR A FAIR ELECTION
Homework Discussion Read Pages 48 – 62 Page 72: 1 – 4, 6 TEST 1 ON THURSDAY FEBRUARY 8 –The test will cover sections 1.1 – 1.6, and 2.1 – 2.3 in the textbook.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Social choice (voting) Vincent Conitzer > > > >
1.3 More Group Ranking and Paradoxes Ms. Magne Discrete Math.
Social Choice Lecture 19 John Hey.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting The Paradoxes of Democracy Vote! In.
CPS Voting and social choice Vincent Conitzer
A small country has 4 provinces – A, B, C and D. Each province contains 30%, 20%, 10% and 40% of the population in the country, respectively. The.
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 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,
Great Theoretical Ideas in Computer Science.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
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.
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 –
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 with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
1.5 Weighted Voting and Voting Power
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Lecture 1: Voting and Election Math
Elections with More Than Two Candidates
Warm Up – 5/27 - Monday 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)
VOTING.
Voting systems Chi-Kwong Li.
Voting and social choice
Hamiltonian Circuits and Paths
Chapter 1 – MATH ANALYSIS
MAT 105 Fall 2008 More Voting Methods.
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
CPS Voting and social choice
Arrow’s Conditions and Approval Voting
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

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 top of the preference schedule is the item they like the most and the bottom of the preference schedule represents the item they like the least. The number at the bottom is the total number of people who organized their preferences in that same exact order. Most A B C D Least E Total of this chart 10

Ranking Methods Plurality – The item that receives the most First Place votes. (All items receive the same number of total votes) If an item receives over half of the total first place votes, then they are the majority winner. The schedule does not have to have a majority winner. The majority winner must be the plurality winner but the opposite is not true. Borda Count – A method where a point value is assigned to each place an item placed on the preference chart and a total is obtain from all charts. Highest point total wins. If there are n items on the chart, then the first place item receives n points and second receives n-1 points all the way down to last place receiving 1 point. Remember to multiply the points received for the place the item is by the number at the bottom of the chart.

Ranking Methods Runoff Method - The two choices with the most first place voters are kept and all other choices are eliminated. The number of first place votes are now recalculated using only the two remaining choices. Example: 25 people audition for a part in a movie and 5 producers are choosing the person for the part. Two people get a callback and the producers must make their choice from those two. Sequential Runoff – The choice with the fewest first place votes is eliminated from the schedules. The number of first place votes is now recalculated with the remaining choices. This process is repeated until a winner is found. Example: Think American Idol, if only the same people could vote each week until one winner is named.

Algorithm – the step by step process of how to complete a task. Example: How do I get to the cafeteria?

Consider the following set of preferences. ABBC CADA DDCB BCAD A.) Determine the Borda winner. B.) Determine the plurality winner. C.) Determine the runoff winner. D.) Determine the sequential runoff winner.

Borda Method ABBC CADA DDCB BCAD A = 6(4) + 8(3) + 4(1) + 7(3) = 73 4 points 3 points 2 points 1 point

ABBC CADA DDCB BCAD A = 6(4) + 8(3) + 4(1) + 7(3) = 73 WINNER! B = 6(1) + 8(4) + 4(4) + 7(2) = 68 C = 6(3) + 8(1) + 4(2) + 7(4) = 62 D = 6(2) + 8(2) + 4(3) + 7(1) = 47 4 points 3 points 2 points 1 point

Plurality ABBC CADA DDCB BCAD First Place votes: A = 6 B= = 12WINNER C = 7 D = 0

Runoff Method ABBC CADA DDCB BCAD First Place votes: A = 6 B= = 12 C = 7 D = 0 A and D are eliminated because B and C have the most first place votes

ABBC CADA DDCB BCAD First Place votes: A = 6 B= = = 13 C = = 13WINNER D = 0

Sequential Runoff ABBC CADA DDCB BCAD First Place votes: A = 6 B= = 12 C = 7 D = 0 Eliminate D because it has the least number of first place votes

ABBC CADA DDCB BCAD First Place votes: A = 6 B= = 12 C = 7 D = 0 Eliminate A because it now has the least number of first place votes, its votes get transferred to C

ABBC CADA DDCB BCAD First Place votes: A = 6 B= = = 13 C = = 13WINNER D = 0

More Ranking Methods Condorcet – Compare each choice with every other choice. (Whichever choice is ranked higher on the preference schedule receives the number of votes listed at the bottom of the preference schedule.) The choice that receives the most votes is the winner in that comparison. To be the Condorcet winner a choice must win each comparison (go undefeated). Example: Five teams are having a round robin tournament (playing every other team) the Condorcet winner would need to have a record of 4 wins and 0 losses.

Condorcet Method ABBC CADA DDCB BCAD A is the Condorcet WINNER because it won all three comparisons. Choose any two and compare them. A vs BA vs CA vs D

Pairwise voting – Choose any two of the choices and compare them (in same way as Condorcet method). Once a choice loses a comparison it is eliminated from the method. The winner is then compared to another choice and again the winner advances and the loser is eliminated. Repeat this pattern until only one choice remains. Example: Think of a bracket type tournament (the Super Bowl), the winner of the Super Bowl advanced to the last game of the year and won and is the champion but did not necessarily beat every team in the tournament.

Pairwise Method ABBC CADA DDCB BCAD Choose two and compare them, winner advances and the loser goes home. C 13 D 12 C 11 A 14 A 13 B 12 A WINNER Note: If there is a Condorcet winner, then the same option must be the pairwise winner.

A A AA B B B B C C CC D DD D Find the Condorcet winner. Find the Pair-wise winner.

Paradox – is a statement that leads to a contradiction. The outcome does not logically make sense. or In this case where we did the process correctly but were unable to find a winner.

Consider the following set of preferences. CADB ABCA BCBD DDAC A.) Determine the Borda winner. B.) Determine the runoff winner. C.) Determine the sequential runoff winner. D.) Determine the Condorcet winner. E.) What does the fact that there is a Condorcet winner tell us about the pairwise winner?

a.) B b.) B c.) B d.) B e.) Since we have a Condorcet winner the pair-wise winner must be the same. SO the pair-wise winner would be B as well.

Arrow’s Conditions 1.) Nondictatorship – The preference of a single individual should not become the group ranking without considering the preference of the others. 2.) Individual Sovereignty – Each individual should be allowed to order the choices in any way and to indicate ties. 3.) Unanimity – If every individual prefers one choice to another, then the group ranking should do the same. 4.) Freedom from Irrelevant Alternative – The winning choice should still win if one of the other choices is removed. (The choice removed is the irrelevant alternative) 5.) Uniqueness of the Group Ranking – The method of producing the group ranking should give the same result whenever it is applied to a given set of preferences. The group ranking should also be transitive.

Arrow’s Examples 1.) I like Twix more than Kit Kats, Kit Kats more than Snickers, and Snickers more than Twix. 2.) Everyone decided that we would take the test on Friday until little miss teachers pet showed up and said she wanted to take it on Monday, so of course I “caved” and moved the test to Monday. 3.) I tell you to put all four of your classes in order from most to least favorite but you are not allowed to put my class last 4.) The reigning Miss American is “stripped” of her crown and the votes are recounted and the second runner-up is the new Miss America, not the first runner-up. 5.) We use pairwise voting and choice A beats choice C for the overall win because C eliminate choice B earlier, even though B would have beaten A if they had been compared.

Approval Voting All the choices are listed and each person is allowed to vote for as many choices as they want. The person may even vote for all of the choices or none of the choices. After everybody has voted, the total number of votes is tallied and the choice with the most votes wins. If there is a tie, then two choices may win. Example: What your favorite movie?

Section 3 A panel of sportswriters is selecting the best football team in a league, and the preferences are distributed as follows: ABC BAB CCA a.) Determine the winning team using a Borda count. b.) The 38 who ranked B first and A second decide to lie in the order to improve the chances of their favorite and so they change their rank of C second and A third. Determine the winner using a Borda count.

Weighted Voting Weighted voting – is where some members of a voting body have more votes than others. Example: Corporate share holders (more shares – more votes) Coalitions – a collection of voters, small as one voter all the way up to the group including all the voters The number of votes needed to pass an issue will be set in each problem, if a number is not set use the simple majority. Winning Coalitions – all the coalitions that have enough votes to pass an issue. Power Index – the true measure of power a voter has in the group

Finding the power index 1.) List all winning coalitions and their total votes. 2.) Select any voter and if once the selected voter is removed from the winning coalition that coalition no longer has enough votes to pass the issue that selection receives one point on their index. If the coalition still has enough to pass even after your selection has been removed, then the selection does not receive a point for that coalition. 3.) Continue with the same selection until you have tested it in all the winning coalitions. 4.) Select a different voter and following steps 2 and 3, continue until all voters have been selected.

Consider a situation in which A, B, C, D have 5, 4, 2, and 2 votes, respectively, and in which 6 votes are needed to pass an issue. a.) List all possible coalitions. b.) Mark off the non-winning coalitions. c.) Determine the power index for each voter.

a.) All possible coalitions. A – 5AB – 9ABC – 11ABCD - 13 B – 4AC – 7ABD - 11 C – 2AD – 7ACD - 9 D – 2BC – 6BCD - 8 BD – 6 CD - 4

A – 5AB – 9ABC – 11ABCD – 13 B – 4AC – 7ABD – 11 C – 2AD – 7ACD – 9 D – 2BC – 6BCD – 8 BD – 6 CD – 4 b.) Mark off all non-winning coalitions.

The Power Index. A – 4 B – 4 C – 2 D – 2

Weighted Voting and Voting Power 1.) Consider a situation in which A, B, C, D have 4, 2, 2, and 1 votes, respectively, and in which 5 votes are needed to pass an issue. a.) List all possible winning coalitions. b.) Determine the power index for each voter. c.) What group or groups is this situation the least fair for? And Why? 2.) Consider a situation in which A, B, and C have 10, 5, and 4 votes respectively, and a simple majority is needed to pass an issue. a.) List all possible winning coalitions. b.) Determine the power index for each voter. c.) What term is used to describe voter A and the what term for voter B and C?

Section 5 Consider a situation in which A, B, C have 3, 2, and 1 votes, respectively, and in which 4 votes are required to pass an issue. a.) List all possible winning coalitions b.) Determine the power index for each voter.