Voting: Issues, Problems, and Systems, Continued. Voting II 1/27

Size: px
Start display at page:

Download "Voting: Issues, Problems, and Systems, Continued. Voting II 1/27"

Transcription

1 Voting: Issues, Problems, and Systems, Continued Voting II 1/27

2 Last Time Last time we discussed some elections and some issues with plurality voting. We started to discuss another voting system, the Borda count. We will review and continue discussing that method. We ll also look at two other systems, Sequential Pairwise Voting and the Hare System. But first, let s look at a video about Homer voting in the 2012 Presidential Election Voting Voting II 2/27

3 The Borda Count With the Borda count voters rank order the candidates. If there are n candidates, each first place vote is worth n 1 points, each second place vote is worth n 2 points, and so on, down to 0 points for a last place vote. The person who received the most points wins the election. Voting II 3/27

4 The Avengers Vote Let s review the vote we did on Monday. The candidates were: Hulk (A), Thor (B), Captain America (C), Iron Man (D), and Black Widow (E). Voting II 4/27

5 Using Borda with the Marvel Comics Ballot Rank the five Marvel Comic characters. With your clicker, enter your top-ranked character. The characters are Iron Man (A), Captain America (B), The Hulk (C), Thor (D), and Black Widow (E). Now enter your second-ranked character. Enter your third-ranked character. Enter your fourth-ranked character. Now enter your five-ranked character. In a bit we ll see who won the election with the Borda count. Voting II 5/27

6 Finishing Monday s Example Let s review the example we considered on Monday: There are three candidates, which we will list as A, B, and C. Suppose that 60% lists A first, B second, and C third, and the remaining 40% lists C first, B second, and A third. We ll assume there are 10 ballots. Number of Voters Rank 6 4 First A C Second B B Third C A Voting II 6/27

7 Number of Voters Rank 6 4 First A C Second B B Third C A A receives 2 points for each of her 6 first place votes, and 0 for each of the 4 third place votes. Her total is then 12 points. B receives 1 point each for all of his 10 second place votes. He then has a total of 10 points. Voting II 7/27

8 Number of Voters Rank 6 4 First A C Second B B Third C A C receives 2 points for each of her 4 first place votes and 0 for each of her 6 third place votes. Her total is 8 points. A then wins the election under the Borda count. This is the same outcome as in plurality voting, since A received the most first place votes. Voting II 8/27

9 This example shows a flaw in the Borda count. Suppose that the 4 voters who rated C > B > A instead vote B > C > A. This gives the following chart: Number of Voters Rank 6 4 First A B Second B C Third C A Note that nobody switched their preference between A and B. Voting II 9/27

10 Clicker Question Q Who gets elected with this set of votes? Number of Voters Rank 6 4 First A B Second B C Third C A A Now B has = 14 points, while A has = 12 and C has 1 4 = 4, so B is elected. Voting II 10/27

11 This example shows that the Borda count does not satisfy the Independence of Irrelevant Alternatives: It is impossible for a non-winning candidate B to change to winner unless at least one voter reverses the order in which they listed B and the winner. Voting II 11/27

12 Sequential Pairwise Voting In this voting system, voters rank candidates as in the Borda count. The winner is determined by comparing pairs of candidates. The loser between a comparison is eliminated and the winner is then compared to the next candidate. The last person remaining is then the winner of the election. This system requires ordering the candidates to decide the order of comparison. We ll illustrate how this system works with an example. Voting II 12/27

13 Suppose there are 4 candidates and 3 votes: Number of Voters Rank First A C B Second B A D Third D B C Fourth C D A Suppose we order the candidates alphabetically. Voting II 13/27

14 Number of Voters Rank First A C B Second B A D Third D B C Fourth C D A We first see that A is preferred over B in 2 of 3 ballots, so B is eliminated. We then compare A with the next candidate, which is C. Q Who is eliminated when we compare A and C? A Since C is preferred over A in 2 of 3 ballots, A is eliminated. Voting II 14/27

15 Number of Voters Rank First A C B Second B A D Third D B C Fourth C D A Finally, D is preferred over C in 2 of 3 ballots, so C is eliminated. Thus, D wins the election. The problem is that all voters prefer B to D, even though D was elected. Voting II 15/27

16 Clicker Question Q Suppose we order the candidates B, C, D, A. Who wins the election? Number of Voters Rank First A C B Second B A D Third D B C Fourth C D A A We compare B to C, and C is eliminated. We then compare B to D, and D is eliminated. We then compare B to A, and B is eliminated. Candidate A then wins the election. Voting II 16/27

17 If we use the symbol > to indicate one candidate is preferred by another, in the ballot we have A > B, C > A, A > D B > C, B > D, D > C Written another way, we have A > B > D > A, which doesn t seem to make sense. It would seem to indicate that we should have both A > D and D > A. Voting II 17/27

18 This voting system then violates the Pareto condition: If everybody prefers one candidate to another, then the latter is not elected. The example violates this because everybody prefers B to D, but D was elected (with the original vote). As we ve seen, in this example the order of the candidates matters. There are more sophisticated variants of this voting system, but all have flaws. Voting II 18/27

19 The Hare System Thomas Hare was a political scientist in England in the 19th century. The voting system that is named after him is used to elect members of the Australian House of Representatives and the President of Ireland. The method does not require additional rounds of voting, but acts like a series of runoff elections. The Hare system is convenient for electing committees, when more than one candidate is to be elected, but can be used to elect a single person. Here is some information on the system from sof.uchicago.edu: Voting II 19/27

20 The University of Chicago Information about Hare Purpose. The Hare System is intended to secure the representation of every shade of the electorate s opinion in direct proportion to its numerical strength. What it seeks to rectify. Under the usual form of voting for a list of people for a committee or representative body where several are to be chosen, a bare majority of the votes or even a plurality is sufficient to elect. The outstanding example of this system is the method used in this country for presidential electors. Equally glaring is the inequality where but one person is chosen to office in a representative assembly. Voting II 20/27

21 The following example of an election in Indiana indicates this: Party Votes Representatives Elected Democratic 291, Republican 166,698 0 Progressives 127,041 0 Others 55,807 0 In this instance, while 349,546 voters, a majority, went without representation, a minority elected all the representatives. This occurs with considerable frequency in American legislative elections. Voting II 21/27

22 In the Hare system, candidates are ranked. The candidate (or candidates) with the fewest number of first place votes is eliminated. This process continues until one candidate remains, and the remaining candidate is then elected. When a candidate is removed, we remove that candidate from each ballot. For example, if B is eliminated, then a ballot which lists C > B > A would then be reinterpreted to just have C > A. That is, C would be listed first and A second. Voting II 22/27

23 For example, suppose that an election between 3 candidates has the following votes: Number of Votes Rank First A C B A Second B B C B Third C A A C Then B is eliminated, having fewer first place votes (3) than A (6) and C (4). The ballots are reinterpreted to eliminate B. Voting II 23/27

24 Original: Number of Votes Rank First A C B A Second B B C B Third C A A C Reinterpreted: Number of Votes Rank First A C C A Second C A A C When B is eliminated, the ballots are reinterpreted to see how A is ranked compared to C. In this case, C is preferred by 7 people while A is by 6. Then A is eliminated, and C is elected. Voting II 24/27

25 This system also has flaws. In the previous example, the rightmost column has 1 vote, listing A > B > C. If that voter changed their mind to B > A > C, then the preference between A and C is not changed. However, we would have the following vote tally. Original: New Vote: Number of Votes Rank First A C B A Second B B C B Third C A A C Number of Votes Rank First A C B B Second B B C A Third C A A C Voting II 25/27

26 New Vote: Number of Votes Rank First A C B B Second B B C A Third C A A C Now, A has 5 first place votes while B and C have 4 each. They are both eliminated, and A is then elected. The Hare system thus violates the Monotonicity Criterion: If no voter were to switch his/her preference between the winner and another, then the outcome of the election would be the same. Voting II 26/27

27 Next Time The four systems we have considered, Plurality voting, the Borda count, Sequential Pairwise voting, and the Hare system, each violates at least one of the following conditions: the Condorcet winner condition, independence of irrelevant alternatives, the Pareto condition, and monotonicity. We will review these voting systems and these conditions next time. We will also see how the 1998 Minnesota gubernatorial and 1992 Presidential elections could come out using the various voting systems. Voting II 27/27

Voting: Issues, Problems, and Systems. Voting I 1/36

Voting: Issues, Problems, and Systems. Voting I 1/36 Voting: Issues, Problems, and Systems Voting I 1/36 Each even year every member of the house is up for election and about a third of the senate seats are up for grabs. Most people do not realize that there

More information

Voting: Issues, Problems, and Systems, Continued

Voting: Issues, Problems, and Systems, Continued Voting: Issues, Problems, and Systems, Continued 7 March 2014 Voting III 7 March 2014 1/27 Last Time We ve discussed several voting systems and conditions which may or may not be satisfied by a system.

More information

Voting: Issues, Problems, and Systems

Voting: Issues, Problems, and Systems Voting: Issues, Problems, and Systems 3 March 2014 Voting I 3 March 2014 1/27 In 2014 every member of the house is up for election and about a third of the senate seats will be up for grabs. Most people

More information

Voting: Issues, Problems, and Systems. Voting I 1/31

Voting: Issues, Problems, and Systems. Voting I 1/31 Voting: Issues, Problems, and Systems Voting I 1/31 In 2014 every member of the house is up for election and about a third of the senate seats will be up for grabs. Most people do not realize that there

More information

Exercises For DATA AND DECISIONS. Part I Voting

Exercises For DATA AND DECISIONS. Part I Voting Exercises For DATA AND DECISIONS Part I Voting September 13, 2016 Exercise 1 Suppose that an election has candidates A, B, C, D and E. There are 7 voters, who submit the following ranked ballots: 2 1 1

More information

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Chapter 9: Social Choice: The Impossible Dream Lesson Plan Lesson Plan For All Practical Purposes An Introduction to Social Choice Majority Rule and Condorcet s Method Mathematical Literacy in Today s World, 9th ed. Other Voting Systems for Three or More Candidates

More information

9.3 Other Voting Systems for Three or More Candidates

9.3 Other Voting Systems for Three or More Candidates 9.3 Other Voting Systems for Three or More Candidates With three or more candidates, there are several additional procedures that seem to give reasonable ways to choose a winner. If we look closely at

More information

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate. Math 13 HW 5 Chapter 9 Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate. 1. Explain why majority rule is not a good way to choose between four alternatives.

More information

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election. Fairness Criteria Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election. The plurality, plurality-with-elimination, and pairwise comparisons

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Arrow s Impossibility Theorem Some announcements Final reflections due on Monday. You now have all of the methods and so you can begin analyzing the results of your election. Today s Goals We will discuss

More information

1.6 Arrow s Impossibility Theorem

1.6 Arrow s Impossibility Theorem 1.6 Arrow s Impossibility Theorem Some announcements Homework #2: Text (pages 33-35) 51, 56-60, 61, 65, 71-75 (this is posted on Sakai) For Monday, read Chapter 2 (pages 36-57) Today s Goals We will discuss

More information

Fairness Criteria. Review: Election Methods

Fairness Criteria. Review: Election Methods Review: Election Methods Plurality method: the candidate with a plurality of votes wins. Plurality-with-elimination method (Instant runoff): Eliminate the candidate with the fewest first place votes. Keep

More information

The Mathematics of Voting. The Mathematics of Voting

The Mathematics of Voting. The Mathematics of Voting 1.3 The Borda Count Method 1 In the Borda Count Method each place on a ballot is assigned points. In an election with N candidates we give 1 point for last place, 2 points for second from last place, and

More information

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion We have discussed: Voting Theory Arrow s Impossibility Theorem Voting Methods: Plurality Borda Count Plurality with Elimination Pairwise Comparisons Voting Criteria: Majority Criterion Condorcet Criterion

More information

12.2 Defects in Voting Methods

12.2 Defects in Voting Methods 12.2 Defects in Voting Methods Recall the different Voting Methods: 1. Plurality - one vote to one candidate, the others get nothing The remaining three use a preference ballot, where all candidates are

More information

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion.

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion. 1 Today s plan: Section 1.2.4. : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion. 2 Plurality with Elimination is a third voting method. It is more complicated

More information

The Impossibilities of Voting

The Impossibilities of Voting The Impossibilities of Voting Introduction Majority Criterion Condorcet Criterion Monotonicity Criterion Irrelevant Alternatives Criterion Arrow s Impossibility Theorem 2012 Pearson Education, Inc. Slide

More information

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures: Desirable properties of social choice procedures We now outline a number of properties that are desirable for these social choice procedures: 1. Pareto [named for noted economist Vilfredo Pareto (1848-1923)]

More information

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25 Measuring Fairness We ve seen FOUR methods for tallying votes: Plurality Borda Count Pairwise Comparisons Plurality with Elimination Are these methods reasonable? Are these methods fair? Today we study

More information

Elections with Only 2 Alternatives

Elections with Only 2 Alternatives Math 203: Chapter 12: Voting Systems and Drawbacks: How do we decide the best voting system? Elections with Only 2 Alternatives What is an individual preference list? Majority Rules: Pick 1 of 2 candidates

More information

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods What You Will Learn Plurality Method Borda Count Method Plurality with Elimination Pairwise Comparison Method Tie Breaking 15.1-2 Example 2: Voting for the Honor Society President

More information

Name Date I. Consider the preference schedule in an election with 5 candidates.

Name Date I. Consider the preference schedule in an election with 5 candidates. Name Date I. Consider the preference schedule in an election with 5 candidates. 1. How many voters voted in this election? 2. How many votes are needed for a majority (more than 50% of the vote)? 3. How

More information

Math for Liberal Arts MAT 110: Chapter 12 Notes

Math for Liberal Arts MAT 110: Chapter 12 Notes Math for Liberal Arts MAT 110: Chapter 12 Notes Voting Methods David J. Gisch Voting: Does the Majority Always Rule? Choosing a Winner In elections with more then 2 candidates, there are several acceptable

More information

The Mathematics of Voting

The Mathematics of Voting The Mathematics of Voting Voting Methods Summary Last time, we considered elections for Math Club President from among four candidates: Alisha (A), Boris (B), Carmen (C), and Dave (D). All 37 voters submitted

More information

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods INB Table of Contents Date Topic Page # February 24, 2014 Test #3 Practice Test 38 February 24, 2014 Test #3 Practice Test Workspace 39 March 10, 2014 Test #3 40 March 10, 2014

More information

Mathematical Thinking. Chapter 9 Voting Systems

Mathematical Thinking. Chapter 9 Voting Systems Mathematical Thinking Chapter 9 Voting Systems Voting Systems A voting system is a rule for transforming a set of individual preferences into a single group decision. What are the desirable properties

More information

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Chapter 9: Social Choice: The Impossible Dream Lesson Plan Lesson Plan For ll Practical Purposes Voting and Social hoice Majority Rule and ondorcet s Method Mathematical Literacy in Today s World, 7th ed. Other Voting Systems for Three or More andidates Plurality

More information

MATH 1340 Mathematics & Politics

MATH 1340 Mathematics & Politics MATH 1340 Mathematics & Politics Lecture 6 June 29, 2015 Slides prepared by Iian Smythe for MATH 1340, Summer 2015, at Cornell University 1 Basic criteria A social choice function is anonymous if voters

More information

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing Chapter 10 The Manipulability of Voting Systems For All Practical Purposes: Effective Teaching As a teaching assistant, you most likely will administer and proctor many exams. Although it is tempting to

More information

Voting Criteria April

Voting Criteria April Voting Criteria 21-301 2018 30 April 1 Evaluating voting methods In the last session, we learned about different voting methods. In this session, we will focus on the criteria we use to evaluate whether

More information

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Economics 470 Some Notes on Simple Alternatives to Majority Rule Economics 470 Some Notes on Simple Alternatives to Majority Rule Some of the voting procedures considered here are not considered as a means of revealing preferences on a public good issue, but as a means

More information

Chapter 1 Practice Test Questions

Chapter 1 Practice Test Questions 0728 Finite Math Chapter 1 Practice Test Questions VOCABULARY. On the exam, be prepared to match the correct definition to the following terms: 1) Voting Elements: Single-choice ballot, preference ballot,

More information

Math for Liberal Studies

Math for Liberal Studies 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 a few more: sequential pairwise voting contingency voting

More information

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate.

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate. Chapter 1: The Mathematics of Voting Section 3: The Borda Count Method Thursday, January 19, 2012 The Borda Count Method In an election using the Borda Count Method, the candidate with the most points

More information

Social Choice: The Impossible Dream. Check off these skills when you feel that you have mastered them.

Social Choice: The Impossible Dream. Check off these skills when you feel that you have mastered them. Chapter Objectives Check off these skills when you feel that you have mastered them. Analyze and interpret preference list ballots. Explain three desired properties of Majority Rule. Explain May s theorem.

More information

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate.

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate. Head-to-Head Winner A candidate is a Head-to-Head winner if he or she beats all other candidates by majority rule when they meet head-to-head (one-on-one). To decide if a Head-to-Head winner exists: Every

More information

Social welfare functions

Social welfare functions Social welfare functions We have defined a social choice function as a procedure that determines for each possible profile (set of preference ballots) of the voters the winner or set of winners for the

More information

Math116Chap1VotingPart2.notebook January 12, Part II. Other Methods of Voting and Other "Fairness Criteria"

Math116Chap1VotingPart2.notebook January 12, Part II. Other Methods of Voting and Other Fairness Criteria Part II Other Methods of Voting and Other "Fairness Criteria" Plurality with Elimination Method Round 1. Count the first place votes for each candidate, just as you would in the plurality method. If a

More information

Voting Systems. High School Circle I. June 4, 2017

Voting Systems. High School Circle I. June 4, 2017 Voting Systems High School Circle I June 4, 2017 Today we are going to start our study of voting systems. Put loosely, a voting system takes the preferences of many people, and converted them into a group

More information

Many Social Choice Rules

Many Social Choice Rules Many Social Choice Rules 1 Introduction So far, I have mentioned several of the most commonly used social choice rules : pairwise majority rule, plurality, plurality with a single run off, the Borda count.

More information

In this lecture we will cover the following voting methods and fairness criterion.

In this lecture we will cover the following voting methods and fairness criterion. In this lecture we will cover the following voting methods and fairness criterion. Borda Count Method Plurality-with-Elimination Method Monotonicity Criterion 1 Borda Count Method In the Borda Count Method

More information

Intro to Contemporary Math

Intro to Contemporary Math Intro to Contemporary Math Independence of Irrelevant Alternatives Criteria Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Independence of Irrelevant Alternatives Criteria

More information

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible. Voting Theory 1 Voting Theory In many decision making situations, it is necessary to gather the group consensus. This happens when a group of friends decides which movie to watch, when a company decides

More information

Sect 13.2 Flaws of Voting Methods

Sect 13.2 Flaws of Voting Methods 218 Sect 13.2 Flaws of Voting Methods From an example the previous section, we had 48 sports writers rank the top four Spurs players of all time. Below is the preference table. Number of votes 20 14 10

More information

answers to some of the sample exercises : Public Choice

answers to some of the sample exercises : Public Choice answers to some of the sample exercises : Public Choice Ques 1 The following table lists the way that 5 different voters rank five different alternatives. Is there a Condorcet winner under pairwise majority

More information

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them. Chapter 10 The Manipulability of Voting Systems Chapter Objectives Check off these skills when you feel that you have mastered them. Explain what is meant by voting manipulation. Determine if a voter,

More information

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable Outline for today Stat155 Game Theory Lecture 26: More Voting. Peter Bartlett December 1, 2016 1 / 31 2 / 31 Recall: Voting and Ranking Recall: Properties of ranking rules Assumptions There is a set Γ

More information

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision: rules: (Dixit and Skeath, ch 14) Recall parkland provision decision: Assume - n=10; - total cost of proposed parkland=38; - if provided, each pays equal share = 3.8 - there are two groups of individuals

More information

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods What You Will Learn Plurality Method Borda Count Method Plurality with Elimination Pairwise Comparison Method Tie Breaking 15.1-2 Example 2: Voting for the Honor Society President

More information

Introduction: The Mathematics of Voting

Introduction: The Mathematics of Voting VOTING METHODS 1 Introduction: The Mathematics of Voting Content: Preference Ballots and Preference Schedules Voting methods including, 1). The Plurality Method 2). The Borda Count Method 3). The Plurality-with-Elimination

More information

Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections

Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections Dr. Rick Klima Appalachian State University Boone, North Carolina U.S. Presidential Vote Totals, 2000 Candidate Bush

More information

SOCIAL CHOICES (Voting Methods) THE PROBLEM. Social Choice and Voting. Terminologies

SOCIAL CHOICES (Voting Methods) THE PROBLEM. Social Choice and Voting. Terminologies SOCIAL CHOICES (Voting Methods) THE PROBLEM In a society, decisions are made by its members in order to come up with a situation that benefits the most. What is the best voting method of arriving at a

More information

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible. Voting Theory 35 Voting Theory In many decision making situations, it is necessary to gather the group consensus. This happens when a group of friends decides which movie to watch, when a company decides

More information

The search for a perfect voting system. MATH 105: Contemporary Mathematics. University of Louisville. October 31, 2017

The search for a perfect voting system. MATH 105: Contemporary Mathematics. University of Louisville. October 31, 2017 The search for a perfect voting system MATH 105: Contemporary Mathematics University of Louisville October 31, 2017 Review of Fairness Criteria Fairness Criteria 2 / 14 We ve seen three fairness criteria

More information

Josh Engwer (TTU) Voting Methods 15 July / 49

Josh Engwer (TTU) Voting Methods 15 July / 49 Voting Methods Contemporary Math Josh Engwer TTU 15 July 2015 Josh Engwer (TTU) Voting Methods 15 July 2015 1 / 49 Introduction In free societies, citizens vote for politicians whose values & opinions

More information

Math Circle Voting Methods Practice. March 31, 2013

Math Circle Voting Methods Practice. March 31, 2013 Voting Methods Practice 1) Three students are running for class vice president: Chad, Courtney and Gwyn. Each student ranked the candidates in order of preference. The chart below shows the results of

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Chapter 1 Review SHORT ANSWER. Answer each question. Circle your final answer. Show all work. Determine whether any of the listed candidates has a majority. 1) Four candidates running for congress receive

More information

The Mathematics of Voting

The Mathematics of Voting Math 165 Winston Salem, NC 28 October 2010 Voting for 2 candidates Today, we talk about voting, which may not seem mathematical. President of the Math TA s Let s say there s an election which has just

More information

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory 3.1 Social choice procedures Plurality voting Borda count Elimination procedures Sequential pairwise

More information

PROBLEM SET #2: VOTING RULES

PROBLEM SET #2: VOTING RULES POLI 309 Fall 2006 due 10/13/06 PROBLEM SET #2: VOTING RULES Write your answers directly on this page. Unless otherwise specified, assume all voters vote sincerely, i.e., in accordance with their preferences.

More information

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761 Voting Definitions and Theorems Spring 2014 Dr. Martin Montgomery Office: POT 761 http://www.ms.uky.edu/~martinm/m111 Voting Method: Plurality Definition (The Plurality Method of Voting) For each ballot,

More information

Presidential Election Democrat Grover Cleveland versus Benjamin Harrison. ************************************ Difference of 100,456

Presidential Election Democrat Grover Cleveland versus Benjamin Harrison. ************************************ Difference of 100,456 Presidential Election 1886 Democrat Grover Cleveland versus Benjamin Harrison Cleveland 5,540,309 Harrison 5,439,853 ************************************ Difference of 100,456 Electoral College Cleveland

More information

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures Mathematics and Social Choice Theory Topic 4 Voting methods with more than 2 alternatives 4.1 Social choice procedures 4.2 Analysis of voting methods 4.3 Arrow s Impossibility Theorem 4.4 Cumulative voting

More information

Main idea: Voting systems matter.

Main idea: Voting systems matter. Voting Systems Main idea: Voting systems matter. Electoral College Winner takes all in most states (48/50) (plurality in states) 270/538 electoral votes needed to win (majority) If 270 isn t obtained -

More information

Voting Methods

Voting Methods 1.3-1.5 Voting Methods Some announcements Homework #1: Text (pages 28-33) 1, 4, 7, 10, 12, 19, 22, 29, 32, 38, 42, 50, 51, 56-60, 61, 65 (this is posted on Sakai) Math Center study sessions with Katie

More information

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker Introduction to Theory of Voting Chapter 2 of Computational Social Choice by William Zwicker If we assume Introduction 1. every two voters play equivalent roles in our voting rule 2. every two alternatives

More information

(67686) Mathematical Foundations of AI June 18, Lecture 6

(67686) Mathematical Foundations of AI June 18, Lecture 6 (67686) Mathematical Foundations of AI June 18, 2008 Lecturer: Ariel D. Procaccia Lecture 6 Scribe: Ezra Resnick & Ariel Imber 1 Introduction: Social choice theory Thus far in the course, we have dealt

More information

Make the Math Club Great Again! The Mathematics of Democratic Voting

Make the Math Club Great Again! The Mathematics of Democratic Voting Make the Math Club Great Again! The Mathematics of Democratic Voting Darci L. Kracht Kent State University Undergraduate Mathematics Club April 14, 2016 How do you become Math Club King, I mean, President?

More information

Decision making and problem solving Lecture 10. Group techniques Voting MAVT for group decisions

Decision making and problem solving Lecture 10. Group techniques Voting MAVT for group decisions Decision making and problem solving Lecture 10 Group techniques Voting MAVT for group decisions Motivation Thus far we have assumed that Objectives, attributes/criteria, and decision alternatives are given

More information

Computational Social Choice: Spring 2007

Computational Social Choice: Spring 2007 Computational Social Choice: Spring 2007 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today This lecture will be an introduction to voting

More information

that changes needed to be made when electing their Presidential nominee. Iowa, at the time had a

that changes needed to be made when electing their Presidential nominee. Iowa, at the time had a Part I The Iowa caucuses are perhaps the most important yet mysterious contest in American politics. It all began after the 1968 Democratic National Convention protest, the party decided that changes needed

More information

: It is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria was proven in 1949.

: It is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria was proven in 1949. Chapter 1 Notes from Voting Theory: the mathematics of the intricacies and subtleties of how voting is done and the votes are counted. In the early 20 th century, social scientists and mathematicians working

More information

The mathematics of voting, power, and sharing Part 1

The mathematics of voting, power, and sharing Part 1 The mathematics of voting, power, and sharing Part 1 Voting systems A voting system or a voting scheme is a way for a group of people to select one from among several possibilities. If there are only two

More information

Fair Division in Theory and Practice

Fair Division in Theory and Practice Fair Division in Theory and Practice Ron Cytron (Computer Science) Maggie Penn (Political Science) Lecture 4: The List Systems of Proportional Representation 1 Saari s milk, wine, beer example Thirteen

More information

Rationality of Voting and Voting Systems: Lecture II

Rationality of Voting and Voting Systems: Lecture II Rationality of Voting and Voting Systems: Lecture II Rationality of Voting Systems Hannu Nurmi Department of Political Science University of Turku Three Lectures at National Research University Higher

More information

VOTING SYSTEMS AND ARROW S THEOREM

VOTING SYSTEMS AND ARROW S THEOREM VOTING SYSTEMS AND ARROW S THEOREM AKHIL MATHEW Abstract. The following is a brief discussion of Arrow s theorem in economics. I wrote it for an economics class in high school. 1. Background Arrow s theorem

More information

Math for Liberal Studies

Math for Liberal Studies Math for Liberal Studies 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 However, the situation

More information

Homework 7 Answers PS 30 November 2013

Homework 7 Answers PS 30 November 2013 Homework 7 Answers PS 30 November 2013 1. Say that there are three people and five candidates {a, b, c, d, e}. Say person 1 s order of preference (from best to worst) is c, b, e, d, a. Person 2 s order

More information

Lecture 16: Voting systems

Lecture 16: Voting systems Lecture 16: Voting systems Economics 336 Economics 336 (Toronto) Lecture 16: Voting systems 1 / 18 Introduction Last lecture we looked at the basic theory of majority voting: instability in voting: Condorcet

More information

Syllabus update: Now keeping best 3 of 4 tests

Syllabus update: Now keeping best 3 of 4 tests Syllabus update: Now keeping best 3 of 4 tests The answer was 22. Recall order of operations: Parentheses, exponents, multiplication/division, addition/subtraction. PEMDAS Please Excuse My Dear Aunt Sally

More information

The Mathematics of Voting Transcript

The Mathematics of Voting Transcript The Mathematics of Voting Transcript Hello, my name is Andy Felt. I'm a professor of Mathematics at the University of Wisconsin- Stevens Point. This is Chris Natzke. Chris is a student at the University

More information

2-Candidate Voting Method: Majority Rule

2-Candidate Voting Method: Majority Rule 2-Candidate Voting Method: Majority Rule Definition (2-Candidate Voting Method: Majority Rule) Majority Rule is a form of 2-candidate voting in which the candidate who receives the most votes is the winner

More information

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Notes for Session 7 Basic Voting Theory and Arrow s Theorem Notes for Session 7 Basic Voting Theory and Arrow s Theorem We follow up the Impossibility (Session 6) of pooling expert probabilities, while preserving unanimities in both unconditional and conditional

More information

Public Choice. Slide 1

Public Choice. Slide 1 Public Choice We investigate how people can come up with a group decision mechanism. Several aspects of our economy can not be handled by the competitive market. Whenever there is market failure, there

More information

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku Hannu Nurmi Public Choice Research Centre and Department of Political Science University of Turku Game Theory and Models of points the history of voting procedures is highly discontinuous, early contributions

More information

n(n 1) 2 C = total population total number of seats amount of increase original amount

n(n 1) 2 C = total population total number of seats amount of increase original amount MTH 110 Quiz 2 Review Spring 2018 Quiz 2 will cover Chapter 13 and Section 11.1. Justify all answers with neat and organized work. Clearly indicate your answers. The following formulas may or may not be

More information

Approaches to Voting Systems

Approaches to Voting Systems Approaches to Voting Systems Properties, paradoxes, incompatibilities Hannu Nurmi Department of Philosophy, Contemporary History and Political Science University of Turku Game Theory and Voting Systems,

More information

Instant Runoff Voting s Startling Rate of Failure. Joe Ornstein. Advisor: Robert Norman

Instant Runoff Voting s Startling Rate of Failure. Joe Ornstein. Advisor: Robert Norman Instant Runoff Voting s Startling Rate of Failure Joe Ornstein Advisor: Robert Norman June 6 th, 2009 --Abstract-- Instant Runoff Voting (IRV) is a sophisticated alternative voting system, designed to

More information

Vote for Best Candy...

Vote for Best Candy... Vote for Best Candy... Peanut M & M s M & M s Skittles Whoppers Reese s Pieces Ballot FAQ s How do I fill out a Ranked Choice ballot? Instead of choosing just one candidate, you can rank them all in order

More information

Section 7.1: Voting Systems. Plurality Method The candidate who receives the greatest number of votes is the winner.

Section 7.1: Voting Systems. Plurality Method The candidate who receives the greatest number of votes is the winner. Section 7.1: Voting Systems Plurality Method The candidate who receives the greatest number of votes is the winner. Borda Count Method Each voter s last choice receives one point, each voter s second-to-last

More information

Mathematics of Voting Systems. Tanya Leise Mathematics & Statistics Amherst College

Mathematics of Voting Systems. Tanya Leise Mathematics & Statistics Amherst College Mathematics of Voting Systems Tanya Leise Mathematics & Statistics Amherst College Arrow s Impossibility Theorem 1) No special treatment of particular voters or candidates 2) Transitivity A>B and B>C implies

More information

(c) 2013 Janice L. Epstein Voting Methods 1

(c) 2013 Janice L. Epstein Voting Methods 1 (c) 2013 Janice L. Epstein Voting Methods 1 Majority Rule: Each voter votes for one candidate. The candidate with the majority of the votes wins. n n + 1 When there are n votes, the majority is + 1 [n

More information

The Mathematics of Elections

The Mathematics of Elections MTH 110 Week 1 hapter 1 Worksheet NME The Mathematics of Elections It s not the voting that s democracy; it s the counting. Tom Stoppard We have elections because we don t all think alike. Since we cannot

More information

The Mathematics of Voting and Elections: A Hands-On Approach. Instructor s Manual. Jonathan K. Hodge Grand Valley State University

The Mathematics of Voting and Elections: A Hands-On Approach. Instructor s Manual. Jonathan K. Hodge Grand Valley State University The Mathematics of Voting and Elections: A Hands-On Approach Instructor s Manual Jonathan K. Hodge Grand Valley State University January 6, 2011 Contents Preface ix 1 What s So Good about Majority Rule?

More information

Grade 6 Math Circles Winter February 27/28 The Mathematics of Voting - Solutions

Grade 6 Math Circles Winter February 27/28 The Mathematics of Voting - Solutions Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Winter 2018 - February 27/28 The Mathematics of Voting - Solutions Warm-up: Time

More information

Voting Methods for Municipal Elections: Propaganda, Field Experiments and what USA voters want from an Election Algorithm

Voting Methods for Municipal Elections: Propaganda, Field Experiments and what USA voters want from an Election Algorithm Voting Methods for Municipal Elections: Propaganda, Field Experiments and what USA voters want from an Election Algorithm Kathryn Lenz, Mathematics and Statistics Department, University of Minnesota Duluth

More information

Voting Protocols. Introduction. Social choice: preference aggregation Our settings. Voting protocols are examples of social choice mechanisms

Voting Protocols. Introduction. Social choice: preference aggregation Our settings. Voting protocols are examples of social choice mechanisms Voting Protocols Yiling Chen September 14, 2011 Introduction Social choice: preference aggregation Our settings A set of agents have preferences over a set of alternatives Taking preferences of all agents,

More information

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching.

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching. Voting Lecture 3: 2-Candidate Voting Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler/ Teaching.php 2-Candidate Voting Method: Majority Rule Definition (2-Candidate Voting

More information

Algorithms, Games, and Networks February 7, Lecture 8

Algorithms, Games, and Networks February 7, Lecture 8 Algorithms, Games, and Networks February 7, 2013 Lecturer: Ariel Procaccia Lecture 8 Scribe: Dong Bae Jun 1 Overview In this lecture, we discuss the topic of social choice by exploring voting rules, axioms,

More information

How should we count the votes?

How should we count the votes? How should we count the votes? Bruce P. Conrad January 16, 2008 Were the Iowa caucuses undemocratic? Many politicians, pundits, and reporters thought so in the weeks leading up to the January 3, 2008 event.

More information