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

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

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

12.2 Defects in Voting Methods

The Impossibilities of Voting

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

Fairness Criteria. Review: Election Methods

The Mathematics of Voting. The Mathematics of Voting

Arrow s Impossibility Theorem

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

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.

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

Josh Engwer (TTU) Voting Methods 15 July / 49

Syllabus update: Now keeping best 3 of 4 tests

Math for Liberal Arts MAT 110: Chapter 12 Notes

Introduction: The Mathematics of Voting

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

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

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

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

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Chapter 1 Practice Test Questions

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

9.3 Other Voting Systems for Three or More Candidates

Homework 7 Answers PS 30 November 2013

Sect 13.2 Flaws of Voting Methods

The Plurality and Borda Count Methods

1.1 The Basic Elements of an Election 1.2 The Plurality Method

Elections with Only 2 Alternatives

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

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

(c) 2013 Janice L. Epstein Voting Methods 1

The Plurality and Borda Count Methods

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

The Mathematics of Voting

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

Many Social Choice Rules

Voting: Issues, Problems, and Systems, Continued

The Mathematics of Voting

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

Exercises For DATA AND DECISIONS. Part I Voting

Math for Liberal Studies

answers to some of the sample exercises : Public Choice

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

The Mathematics of Elections

Social welfare functions

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.

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

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

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

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

Approval Voting has the following advantages over other voting procedures:

Public Choice. Slide 1

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 Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

PROBLEM SET #2: VOTING RULES

Intro to Contemporary Math

Practice TEST: Chapter 14

Voting Criteria April

Presentation Outline What is preferential voting? Why use preferential voting? How H does preferential voting work? Example preferential voting scenar

Mathematical Thinking. Chapter 9 Voting Systems

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

The Plurality and Borda Count Methods

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

Voting Methods

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

Rock the Vote or Vote The Rock

Voting Lecture 5: Bracket Voting Spring Morgan Schreffler Office: POT Teaching.php

The mathematics of voting, power, and sharing Part 1

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

Social Choice & Mechanism Design

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

Computational Social Choice: Spring 2007

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

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

Simple methods for single winner elections

The actual midterm will probably not be multiple choice. You should also study your notes, the textbook, and the homework.

Voting and preference aggregation

Voting and preference aggregation

The Mathematics of Voting Transcript

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

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

How should we count the votes?

Math Circle Voting Methods Practice. March 31, 2013

Quick Review of Preference Schedules

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

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

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

Lecture 11. Voting. Outline

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

2012 Best Picture 1. Votes st place A Z L 2nd place L L Z 3rd place Z A A

Vote for Best Candy...

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Voting and Markov Processes

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

Constructing voting paradoxes with logic and symmetry

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

MATH 1340 Mathematics & Politics

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

Transcription:

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 Four students are running for president of the Honor Society: Antoine (A), Betty (B), Camille (C), and Don (D). The club members were asked to rank all candidates. The resulting preference table for this election is given in the table on the next slide. 15.1-3

Example 2: Voting for the Honor Society President 15.1-4

Example 2: Voting for the Honor Society President a) How many students voted in the election? b) How many students selected the candidates in this order: C, A, D, B? c) How many students selected A as their first choice? 15.1-5

Example 2: Voting for the Honor Society President a) Add numbers in row labeled Number of Votes 19 + 15 + 11 + 7 + 2 = 54 15.1-6

Example 2: Voting for the Honor Society President b) From the 2 nd column, 15 voted in the given order. 15.1-7

Example 2: Voting for the Honor Society President c) Read across row that says First, find C, and read number above it. Add those: 15 + 2 = 17. 15.1-8

Plurality Method This is the most commonly used method, and it is the easiest method to use when there are more than two candidates. Each voter votes for one candidate. The candidate receiving the most votes is declared the winner. 15.1-9

Example 4: Electing the Honor Society President by the Plurality Method Consider the Honor Society election given in Example 2. Who is elected president using the plurality method? 15.1-10

Example 4: Electing the Honor Society President by the Plurality Method Antoine: 7; Betty: 19; Don: 11; Camille: 15 + 2 = 17 Betty is elected president. She received 19/54 = 35% of the 1 st place votes; not a majority. 15.1-11

Borda Count Method Voters rank candidates from the most favorable to the least favorable. Each last-place vote is awarded one point, each next-to-last-place vote is awarded two points, each third-fromlast-place vote is awarded three points, and so forth. The candidate receiving the most points is the winner of the election. 15.1-12

Example 6: Electing the Honor Borda Count Method Use the Borda count method to determine the winner of the election for president of the Honor Society discussed in Example 2. Recall that the candidates are Antoine (A), Betty (B), Camille (C), and Don (D). For convenience, the preference table is reproduced on the next slide. 15.1-13

Example 6: Electing the Honor Borda Count Method 1 st place worth 4, 2 nd place worth 3, 3 rd place worth 2, 4 th place worth 1 15.1-14

Example 6: Electing the Honor Borda Count Method Antoine: 7-1 st ; 7 4 = 28 34-2 nd ; 34 3 = 102 13-3 rd ; 13 2 = 26 Total 156 15.1-15

Example 6: Electing the Honor Borda Count Method Betty: 19-1 st ; 19 4 = 76 35-4 th ; 35 1 = 35 Total 111 15.1-16

Example 6: Electing the Honor Borda Count Method Camille: 17-1 st ; 17 4 = 68 11-2 nd ; 11 3 = 33 26-3 rd ; 26 2 = 52 Total 153 15.1-17

Example 6: Electing the Honor Borda Count Method Don: 11-1 st ; 11 4 = 44 9-2 nd ; 9 3 = 27 15-3 rd ; 15 2 = 30 19-3 rd ; 19 1 = 19 Total 120 15.1-18

Example 6: Electing the Honor Borda Count Method Antoine, with 156 points, receives the most points using the Borda count method and is declared the winner. 15.1-19

Plurality with Elimination Each voter votes for one candidate. If a candidate receives a majority of votes, that candidate is declared the winner. 15.1-20

Plurality with Elimination If no candidate receives a majority, eliminate the candidate with the fewest votes and hold another election. (If there is a tie for the fewest votes, eliminate all candidates tied for the fewest votes.) Repeat this process until a candidate receives a majority. 15.1-21

Example 8: Electing the Honor Plurality with Elimination Method Use the plurality with elimination method to determine the winner of the election for president of the Honor Society from Example 2. The preference table is shown on the next slide. Recall that A represents Antoine, B represents Betty, C represents Camille, and D represents Don. 15.1-22

Example 8: Electing the Honor Plurality with Elimination Method 15.1-23

Example 8: Electing the Honor Plurality with Elimination Method 1 st place votes: Antoine: 7, Betty:19, Camille: 17, Don: 11 15.1-24

Example 8: Electing the Honor Plurality with Elimination Method Total of 54 votes. No one has majority. Antoine is eliminated. We assume all voters rank their preferences the same. Column 1, 19 voters ranked the four as B, A, C, D; now it is B, C, D. Column 2 was C, A, D, B; now it is C, D, B. 15.1-25

Example 8: Electing the Honor Plurality with Elimination Method Column 3 was D, C, A, B; now it is D, C, B. Column 4 was A, D, C, B; now it is D, C, B. Column 5 was C, D, A, B; now it is C, D, B. 15.1-26

Example 8: Electing the Honor Plurality with Elimination Method The new preference table is: 15.1-27

Example 8: Electing the Honor Plurality with Elimination Method 1 st place votes: Betty: 19, Camille: 17, Don: 18 15.1-28

Example 8: Electing the Honor Plurality with Elimination Method No one has majority. Camille is eliminated. New preference table is: 15.1-29

Example 8: Electing the Honor Plurality with Elimination Method 1 st place votes: Betty: 19, Don: 35 15.1-30

Example 8: Electing the Honor Plurality with Elimination Method Don has a majority of first-place votes and is declared the winner using the plurality with elimination method. 15.1-31

Pairwise Comparison Method Voters rank the candidates. A series of comparisons in which each candidate is compared with each of the other candidates follows. If candidate A is preferred to candidate B, A receives one point. If candidate B is preferred to candidate A, B receives 1 point. If the candidates tie, each receives ½ point. 15.1-32

Pairwise Comparison Method After making all comparisons among the candidates, the candidate receiving the most points is declared the winner. 15.1-33

Number of Comparison The number of comparisons, c, needed when using the pairwise comparison method when there are n candidates is c n(n 1) 2 15.1-34

Example 10: Electing the Honor Pairwise Comparison Method Use the pairwise comparison method to determine the winner of the election for president of the Honor Society that was originally discussed in Example 2. 15.1-35

Example 10: Electing the Honor Pairwise Comparison Method Antoine, Betty, Camille, Don 15.1-36

Example 10: Electing the Honor Pairwise Comparison Method 4 candidates, n = 4, the number of comparisons needed is n n 1 c 4 3 6 2 2 The 6 comparisons are A versus B, A versus C, A versus D, B versus C, B versus D, and C versus D. 15.1-37

Example 10: Electing the Honor Pairwise Comparison Method 1. The pairwise comparison of Antoine versus Betty is Antoine: 15 + 11 + 7 + 2 = 35 votes Betty: 19 votes Antoine wins this comparison and is awarded 1 point. 15.1-38

Example 10: Electing the Honor Pairwise Comparison Method 2. The pairwise comparison of Antoine versus Camille is Antoine: 19 + 7 = 26 votes Camille: 15 + 11 + 2 = 28 votes Camille wins this comparison and is awarded 1 point. 15.1-39

Example 10: Electing the Honor Pairwise Comparison Method 3. The pairwise comparison of Antoine versus Don is Antoine: 19 + 15 + 7 = 41 votes Don: 11 + 2 = 13 votes Antoine wins this comparison and is awarded a second point. 15.1-40

Example 10: Electing the Honor Pairwise Comparison Method 4. The pairwise comparison of Betty versus Camille is Betty: 19 votes Camille: 15 + 11 + 7 + 2 = 35 votes Camille wins this comparison and is awarded a second point. 15.1-41

Example 10: Electing the Honor Pairwise Comparison Method 5. The pairwise comparison of Betty versus Don is Betty: 19 votes Don: 15 + 11 + 7 + 2 = 35 votes Don wins this comparison and is awarded 1 point. 15.1-42

Example 10: Electing the Honor Pairwise Comparison Method 6. The pairwise comparison of Camille versus Don is Camille: 19 + 15 + 2 = 36 votes Don: 11 + 7 = 18 votes Camille wins this comparison and is awarded a third point. 15.1-43

Example 10: Electing the Honor Pairwise Comparison Method Antoine received 2 points, Betty received 0 points, Camille received 3 points, and Don received 1 point. Since Camille received 3 points, the most points from the pairwise comparison method, Camille wins the election. 15.1-44

Tie Breaking Breaking a tie can be achieved by either making an arbitrary choice, such as flipping a coin, or by bringing in an additional voter. Robert s Rule of Order: president of group votes only to break a tie or create a tie. Borda method: could choose person with most 1 st place votes. 15.1-45

Tie Breaking Pairwise comparison method: could choose the winner of a one-to-one comparison between the two candidates involved in the tie. Different tie-breaking methods could produce different winners. To remain fair, the method should be chosen in advance. 15.1-46