Josh Engwer (TTU) Voting Methods 15 July / 49

Similar documents
Math for Liberal Arts MAT 110: Chapter 12 Notes

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

Fairness Criteria. Review: Election Methods

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Chapter 1 Practice Test Questions

9.3 Other Voting Systems for Three or More Candidates

Introduction: The Mathematics of Voting

Main idea: Voting systems matter.

12.2 Defects in Voting Methods

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

The Mathematics of Voting

Voting: Issues, Problems, and Systems, Continued

Arrow s Impossibility Theorem

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

The Mathematics of Voting. The Mathematics of Voting

1.6 Arrow s Impossibility Theorem

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

PROBLEM SET #2: VOTING RULES

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Simple methods for single winner elections

Vote for Best Candy...

Math Circle Voting Methods Practice. March 31, 2013

Voting Methods

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

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

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

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

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

Sect 13.2 Flaws of Voting Methods

Elections with Only 2 Alternatives

Voting: Issues, Problems, and Systems

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

The Mathematics of Voting

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

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

The Mathematics of Elections

Math for Liberal Studies

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.

Exercises For DATA AND DECISIONS. Part I Voting

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

answers to some of the sample exercises : Public Choice

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

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

Math for Liberal Studies

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Chapter 9: Social Choice: The Impossible Dream

Mathematical Thinking. Chapter 9 Voting Systems

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

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

Many Social Choice Rules

Issue Overview: How the U.S. elects its presidents

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

The Impossibilities of Voting

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

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

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

Intro to Contemporary Math

Rock the Vote or Vote The Rock

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

Grade 7/8 Math Circles Winter March 6/7/8 The Mathematics of Voting

Reality Math Sam Kaplan, The University of North Carolina at Asheville Dot Sulock, The University of North Carolina at Asheville

Social welfare functions

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

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

Public Choice. Slide 1

Electing a President. The Electoral College

How should we count the votes?

How Should Members of Parliament (and Presidents) Be Elected? E. Maskin Institute for Advanced Study

What is the Best Election Method?

Syllabus update: Now keeping best 3 of 4 tests

The Mathematics of Voting Transcript

The Iowa Caucuses. (See Attached Page Below) B R C T R B R R C C B C T T T B

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

The Electoral College

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

Marist College Institute for Public Opinion Poughkeepsie, NY Phone Fax

Computational Social Choice: Spring 2007

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

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

VOTING TO ELECT A SINGLE CANDIDATE

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

Plurality voting system

Preference Forms These tables may be useful for scratch work.

The mathematics of voting, power, and sharing Part 1

RANKED VOTING METHOD SAMPLE PLANNING CHECKLIST COLORADO SECRETARY OF STATE 1700 BROADWAY, SUITE 270 DENVER, COLORADO PHONE:

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

Approval Voting has the following advantages over other voting procedures:

Voting in Maine s Ranked Choice Election. A non-partisan guide to ranked choice elections

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

1.1 The Basic Elements of an Election 1.2 The Plurality Method

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

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

Lecture 11. Voting. Outline

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

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

The Executive Branch

Lecture 16: Voting systems

Possible voting reforms in the United States

Transcription:

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 on contemporary issues align with theirs. Unfortunately, voting is not as clear-cut as one would expect. Consider U.S. presidential elections: 2000 Face-Off [ Al Gore (D) vs George W. Bush (R) ]: Gore received more (popular) votes than Bush, yet Bush won! Bush received more electoral votes and carried more states than Gore. 2012 Florida (R) Primary [ Romney vs Gingrich vs Paul vs Santorum ]: Mitt Romney earned all 50 delegates yet he earned < 50% of the votes. Newt Gingrich earned no delegates yet he earned 32% of the votes. After a few primaries, most candidates drop out before most citizens have a chance to vote due to lack of funding. Winning depends not only on vote counts but also on how the votes are used! Because of these issues, several voting methods exist. Josh Engwer (TTU) Voting Methods 15 July 2015 2 / 49

Preference Ballots & Tables Suppose there are five candidates: A,B,C,D,E 1 st D 2 nd B Each voter uses a preference ballot to rank the candidates: 3 rd E 4 th A 5 th C Identical preference ballots are grouped together in a preference table: Preference 8 3 6 7 2 1 st A E B A D 2 nd B D D C B 3 rd C A C E E 4 th D B E B A 5 th E C A D C Josh Engwer (TTU) Voting Methods 15 July 2015 3 / 49

Plurality Method (Definition) The simplest, most intuitive voting method is the Plurality Method: Definition (Plurality Method) SETUP: PROCESS: WINNER: Single-Winner Election has k candidates Each voter votes for one candidate Candidate receiving the most votes Plurality Method is typically used by: State elections Local elections City council elections School board elections Josh Engwer (TTU) Voting Methods 15 July 2015 4 / 49

Plurality Method (Example) WEX 11-1-1: Using Plurality Method, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Josh Engwer (TTU) Voting Methods 15 July 2015 5 / 49

Plurality Method (Example) WEX 11-1-1: Using Plurality Method, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A With Plurality Method, only the first choice matters (in blue) Josh Engwer (TTU) Voting Methods 15 July 2015 6 / 49

Plurality Method (Example) WEX 11-1-1: Using Plurality Method, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A With Plurality Method, only the first choice matters (in blue) A has 10 votes B has 5 + 4 = 9 votes C has 5 votes D has 7 votes Josh Engwer (TTU) Voting Methods 15 July 2015 7 / 49

Plurality Method (Example) WEX 11-1-1: Using Plurality Method, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A With Plurality Method, only the first choice matters (in blue) A has 10 votes B has 5 + 4 = 9 votes C has 5 votes D has 7 votes Since A has the most votes, A is the winner Josh Engwer (TTU) Voting Methods 15 July 2015 8 / 49

Borda Count Method (Definition) Definition (Borda Count Method) SETUP: What if, instead, voters must rank each candidate? Single-Winner Election has k candidates PROCESS: (1) Each voter ranks all candidates as follows: The 1 st choice receives k points The 2 nd choice receives (k 1) points The 3 rd choice receives (k 2) points. The last choice receives 1 point (2) For each candidate, compute the total sum of points WINNER: Candidate receiving the most total points Borda Count Method is typically used in: sports polls, music industry awards, hiring CEO s,... Josh Engwer (TTU) Voting Methods 15 July 2015 9 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Josh Engwer (TTU) Voting Methods 15 July 2015 10 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A D B C B 2 nd choice/3 C B C D C 3 rd choice/2 B A A A D 4 th choice/1 D C D B A Assign points to each preference catagory (in blue) Josh Engwer (TTU) Voting Methods 15 July 2015 11 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/(4 10) D/(4 7) B/(4 5) C/(4 5) B/(4 4) 2 nd choice/3 C/(3 10) B/(3 7) C/(3 5) D/(3 5) C/(3 4) 3 rd choice/2 B/(2 10) A/(2 7) A/(2 5) A/(2 5) D/(2 4) 4 th choice/1 D/(1 10) C/(1 7) D/(1 5) B/(1 5) A/(1 4) Assign points to each choice Josh Engwer (TTU) Voting Methods 15 July 2015 12 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Assign points to each choice (and simplify) Josh Engwer (TTU) Voting Methods 15 July 2015 13 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Tally points for each candidate: A: 40 + 14 + 10 + 10 + 4 = 78 points Josh Engwer (TTU) Voting Methods 15 July 2015 14 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Tally points for each candidate: A: 40 + 14 + 10 + 10 + 4 = 78 points B : 20 + 21 + 20 + 5 + 16 = 82 points Josh Engwer (TTU) Voting Methods 15 July 2015 15 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Tally points for each candidate: A: 40 + 14 + 10 + 10 + 4 = 78 points B: 20 + 21 + 20 + 5 + 16 = 82 points C : 30 + 7 + 15 + 20 + 12 = 84 points Josh Engwer (TTU) Voting Methods 15 July 2015 16 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Tally points for each candidate: A: 40 + 14 + 10 + 10 + 4 = 78 points B: 20 + 21 + 20 + 5 + 16 = 82 points C: 30 + 7 + 15 + 20 + 12 = 84 points D : 10 + 28 + 5 + 15 + 8 = 52 points Josh Engwer (TTU) Voting Methods 15 July 2015 17 / 49

Borda Count Method (Example) WEX 11-1-2: Using Borda Count Method, determine election winner: 1 st choice/4 A/40 D/28 B/20 C/20 B/16 2 nd choice/3 C/30 B/21 C/15 D/15 C/12 3 rd choice/2 B/20 A/14 A/10 A/10 D/8 4 th choice/1 D/10 C/7 D/5 B/5 A/4 Tally points for each candidate: A: 40 + 14 + 10 + 10 + 4 = 78 points B: 20 + 21 + 20 + 5 + 16 = 82 points C: 30 + 7 + 15 + 20 + 12 = 84 points D: 10 + 28 + 5 + 15 + 8 = 52 points Since Candidate C has the most points, C is the winner Josh Engwer (TTU) Voting Methods 15 July 2015 18 / 49

Plurality-with-Elimination Method (Definition) Definition (Plurality-with-Elimination Method) SETUP: Single-Winner Election has k candidates PROCESS: (0) Compute total votes & # votes needed for a majority (1) If no candidate receives a majority of votes, then drop candidate(s) with fewest votes from the ballot (2) Conduct a new election round with updated ballot Assume voters don t change their preferences each round (3) Repeat (1)-(2) until a candidate receives a majority WINNER: Candidate receiving a majority of votes If voters prefer A to B and B to C, then if B s dropped, voters will prefer A to C. Plurality-with-Elimination Method is typically used in: Municipal Elections (e.g. city mayor) Josh Engwer (TTU) Voting Methods 15 July 2015 19 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Josh Engwer (TTU) Voting Methods 15 July 2015 20 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A First of all, compute the total votes & votes needed for majority: Total votes = 10 + 7 + 5 + 5 + 4 = 31 31/2 = 15.5 = At least 16 votes needed for a majority Josh Engwer (TTU) Voting Methods 15 July 2015 21 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Total votes = 31 At least 16 votes needed for a majority Round 1 Josh Engwer (TTU) Voting Methods 15 July 2015 22 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 < 16 = (NOT a majority) B = 5 + 4 = 9 < 16 = (NOT a majority) C = 5 < 16 = (NOT a majority) D = 7 < 16 = (NOT a majority) Josh Engwer (TTU) Voting Methods 15 July 2015 23 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 < 16 = (NOT a majority) B = 5 + 4 = 9 < 16 = (NOT a majority) C = 5 < 16 = (NOT a majority) D = 7 < 16 = (NOT a majority) Since no candidate has a majority, eliminate candidate(s) with fewest votes: C Josh Engwer (TTU) Voting Methods 15 July 2015 24 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Total votes = 31 At least 16 votes needed for a majority Since no candidate has a majority, eliminate candidate(s) with fewest votes: C Josh Engwer (TTU) Voting Methods 15 July 2015 25 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Total votes = 31 At least 16 votes needed for a majority Eliminate candidate C, moving every entry below C (in blue) up one row Josh Engwer (TTU) Voting Methods 15 July 2015 26 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A 4 th choice Total votes = 31 At least 16 votes needed for a majority Eliminate candidate C, moving every entry below C (in blue) up one row Josh Engwer (TTU) Voting Methods 15 July 2015 27 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A Total votes = 31 At least 16 votes needed for a majority Round 2 Josh Engwer (TTU) Voting Methods 15 July 2015 28 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 < 16 = (NOT a majority) B = 5 + 4 = 9 < 16 = (NOT a majority) D = 7 + 5 = 12 < 16 = (NOT a majority) Josh Engwer (TTU) Voting Methods 15 July 2015 29 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 < 16 = (NOT a majority) B = 5 + 4 = 9 < 16 = (NOT a majority) D = 7 + 5 = 12 < 16 = (NOT a majority) Since no candidate has a majority, eliminate candidate(s) with fewest votes: B Josh Engwer (TTU) Voting Methods 15 July 2015 30 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A Total votes = 31 At least 16 votes needed for a majority Since no candidate has a majority, eliminate candidate(s) with fewest votes: B Josh Engwer (TTU) Voting Methods 15 July 2015 31 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D B D B 2 nd choice B B A A D 3 rd choice D A D B A Total votes = 31 At least 16 votes needed for a majority Eliminate candidate B, moving every entry below B (in blue) up one row Josh Engwer (TTU) Voting Methods 15 July 2015 32 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D A D D 2 nd choice D A D A A 3 rd choice Total votes = 31 At least 16 votes needed for a majority Eliminate candidate B, moving every entry below B (in blue) up one row Josh Engwer (TTU) Voting Methods 15 July 2015 33 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D A D D 2 nd choice D A D A A Total votes = 31 At least 16 votes needed for a majority Round 3 Josh Engwer (TTU) Voting Methods 15 July 2015 34 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D A D D 2 nd choice D A D A A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 + 5 = 15 < 16 = (NOT a majority) D = 7 + 5 + 4 = 16 16 = (MAJORITY!) Josh Engwer (TTU) Voting Methods 15 July 2015 35 / 49

Plurality-with-Elimination Method (Example) WEX 11-1-3: Using Plurality-with-Elimination Mtd, determine election winner: 1 st choice A D A D D 2 nd choice D A D A A Total votes = 31 At least 16 votes needed for a majority Count 1 st -choice votes for each candidate: A = 10 + 5 = 15 < 16 = (NOT a majority) D = 7 + 5 + 4 = 16 16 = (MAJORITY!) Since candidate D has a majority, D is the winner Josh Engwer (TTU) Voting Methods 15 July 2015 36 / 49

Pairwise Comparison Method (Definition) The election winner is expected to beat each candidate head-to-head : Definition (Pairwise Comparison Method) SETUP: Single-Winner Election has k candidates PROCESS: (1) Voters rank all candidates (2) Pit candidates A and B head-to-head Count how many voters prefer A to B Count how many voters prefer B to A If A and B are tied, then each receives 1/2 point Else the more preferred candidate receives 1 point and the less preferred candidate receives 0 points (3) Repeat Step (2) for each pair of candidates WINNER: Candidate receiving the most points Pairwise Comparison Method is typically used in Sports Drafts. Josh Engwer (TTU) Voting Methods 15 July 2015 37 / 49

How Many Pairwise Comparisons are Necessary? # CANDIDATES TOTAL # PAIRWISE COMPARISONS 3 3 4 6 5 10 6 15 7 21 8 28 9 36 10 45 15 105 20 190 50 1225 100 4950 Josh Engwer (TTU) Voting Methods 15 July 2015 38 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A Josh Engwer (TTU) Voting Methods 15 July 2015 39 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A B 1 C D A versus B: A = 10 + 5 = 15 B = 7 + 5 + 4 = 16 WINNER! Josh Engwer (TTU) Voting Methods 15 July 2015 40 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 1 C D A versus C: A = 10 + 7 = 17 WINNER! C = 5 + 5 + 4 = 14 Josh Engwer (TTU) Voting Methods 15 July 2015 41 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 1 C D 1 A versus D: A = 10 + 5 = 15 D = 7 + 5 + 4 = 16 WINNER! Josh Engwer (TTU) Voting Methods 15 July 2015 42 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 2 C D 1 B versus C: B = 7 + 5 + 4 = 16 WINNER! C = 10 + 5 = 15 Josh Engwer (TTU) Voting Methods 15 July 2015 43 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 3 C D 1 B versus D: B = 10 + 5 + 4 = 19 WINNER! D = 7 + 5 = 12 Josh Engwer (TTU) Voting Methods 15 July 2015 44 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 3 C 1 D 1 C versus D: C = 10 + 5 + 5 + 4 = 24 WINNER! D = 7 Josh Engwer (TTU) Voting Methods 15 July 2015 45 / 49

Pairwise Comparisons Method (Example) WEX 11-1-4: Using Pairwise Comparisons Mtd, determine election winner: 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A CANDIDATE POINTS 1 2 -POINTS A 1 B 3 C 1 D 1 Since candidate B has the most points, B is the winner Josh Engwer (TTU) Voting Methods 15 July 2015 46 / 49

Summary of the Previous Examples 1 st choice A D B C B 2 nd choice C B C D C 3 rd choice B A A A D 4 th choice D C D B A EXAMPLE VOTING METHOD WINNER WEX 11-1-1 Plurality A WEX 11-1-2 Borda Count C WEX 11-1-3 Plurality+Elimination D WEX 11-1-4 Pairwise Comparisons B As this shows, it s possible for each method to determine a different winner of the same election. Josh Engwer (TTU) Voting Methods 15 July 2015 47 / 49

Voter Apathy & Alternative Voting Methods Definition (Voter Apathy) Voter apathy is the belief that one s vote does not count. Some voter apathy is caused by frustration with the Plurality Method. In response to voter apathy, alternative voting methods have been proposed: Approval Voting Instant Runoff Voting Voters vote for as many candidates as they want Voters rank candidates Weakest candidate is eliminated If eliminated candidate was a voter s 1 st choice, then that candidate becomes voter s 2 nd choice (i.e vote was not wasted) Such alternative voting methods are beyond the scope of this course. Josh Engwer (TTU) Voting Methods 15 July 2015 48 / 49

Fin Fin. Josh Engwer (TTU) Voting Methods 15 July 2015 49 / 49