The Plurality-with-Elimination Method

Similar documents
The Pairwise-Comparison Method

Minimal Spanning Trees

The Critical-Path Algorithm

The Traveling Salesman Problem Brute Force Method

Solving Recursive Sequences by Iteration

Scheduling and Digraphs

Possibilities of Voting

The Traveling Salesman Problem Nearest-Neighbor Algorithm

Scope and Parameter Passing

while Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College

LR Parsing - Conflicts

The Decreasing-Time Algorithm

The Class Construct Part 1

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 27, 2013

Sampling Distribution Examples Sections 15.4, 15.5

Rotations and Translations

MATH 1340 Mathematics & Politics

Magnification and Minification

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 26, 2014

Scope and Parameter Passing

The Graphics Pipeline

The Normal Distribution

Street-Routing Problems

MATH 1340 Mathematics & Politics

The Coefficient of Determination

Stack Applications. Lecture 27 Sections Robb T. Koether. Hampden-Sydney College. Wed, Mar 29, 2017

Operators. Lecture 12 Section Robb T. Koether. Hampden-Sydney College. Fri, Feb 9, 2018

Density Curves Sections

Boxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010

Friends and Unary Operators

Total Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013

List Iterator Implementation

Pointers. Lecture 1 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 14, 2015

The CYK Parsing Algorithm

Recursive Descent Parsers

Displaying Distributions - Quantitative Variables

Recursive Linked Lists

The Graphics Pipeline

Pointer Arithmetic. Lecture 4 Chapter 10. Robb T. Koether. Hampden-Sydney College. Wed, Jan 25, 2017

Voting. Xiaoyue Zhang

Recursion. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 17, 2018

XQuery FLOWR Expressions Lecture 35

Pointers. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Fri, Jan 18, 2013

Regular Expressions. Lecture 10 Sections Robb T. Koether. Hampden-Sydney College. Wed, Sep 14, 2016

Stack Applications. Lecture 25 Sections Robb T. Koether. Hampden-Sydney College. Mon, Mar 30, 2015

Boolean Expressions. Lecture 31 Sections 6.6, 6.7. Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015

XPath Lecture 34. Robb T. Koether. Hampden-Sydney College. Wed, Apr 11, 2012

PHP Queries and HTML Forms Lecture 23

Stacks and their Applications

Programming Languages

Dynamic Allocation of Memory

XPath. Lecture 36. Robb T. Koether. Wed, Apr 16, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, / 28

Recognition of Tokens

Programming Languages

LR Parsing - The Items

Function Definition Syntax Tree

Recursion. Lecture 26 Sections , Robb T. Koether. Hampden-Sydney College. Mon, Apr 6, 2015

The string Class. Lecture 21 Sections 2.9, 3.9, Robb T. Koether. Wed, Oct 17, Hampden-Sydney College

Webpage Navigation. Lecture 27. Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2018

Voting Methods and Colluding Voters

Basic PHP Lecture 17

Binary Tree Applications

Linked Lists. Lecture 16 Sections Robb T. Koether. Hampden-Sydney College. Wed, Feb 22, 2017

The Projection Matrix

Inheritance: The Fundamental Functions

Review. Lecture 39. Robb T. Koether. Mon, Dec 5, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) Review Mon, Dec 5, / 14

Triggers. Lecture 14. Robb T. Koether. Hampden-Sydney College. Wed, Feb 14, 2018

Lecture 21 Section Fri, Oct 3, 2008

Implementing Linked Lists

Building the Abstract Syntax Trees

Array Lists. Lecture 15. Robb T. Koether. Hampden-Sydney College. Fri, Feb 16, 2018

XML Attributes. Lecture 33. Robb T. Koether. Hampden-Sydney College. Wed, Apr 25, 2018

Relational Databases Lecture 2

Abstract Data Types. Lecture 23 Section 7.1. Robb T. Koether. Hampden-Sydney College. Wed, Oct 24, 2012

Pointers. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Mon, Jan 20, 2014

Mipmaps. Lecture 35. Robb T. Koether. Hampden-Sydney College. Wed, Nov 18, 2015

Integer Overflow. Lecture 8 Section 2.5. Robb T. Koether. Hampden-Sydney College. Mon, Jan 27, 2014

The Constructors. Lecture 6 Sections Robb T. Koether. Hampden-Sydney College. Fri, Jan 26, 2018

Nondeterministic Programming in C++

Ambient and Diffuse Light

Cryptosystems. Lecture 34. Robb T. Koether. Hampden-Sydney College. Mon, Nov 24, 2014

The Projection Matrix

Aggregation. Lecture 7 Section Robb T. Koether. Hampden-Sydney College. Wed, Jan 29, 2014

Introduction to Databases

The x87 Floating-Point Unit

Inheritance: The Fundamental Functions

PHP Querying. Lecture 21. Robb T. Koether. Hampden-Sydney College. Fri, Mar 2, 2018

List Iterators. Lecture 27 Section Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015

XML. Lecture 29. Robb T. Koether. Fri, Mar 28, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) XML Fri, Mar 28, / 23

Insertions, Deletions, and Updates

Fundamental Data Types

Function Usage. Lecture 15 Sections 6.3, 6.4. Robb T. Koether. Hampden-Sydney College. Mon, Oct 1, 2018

AJAX. Lecture 26. Robb T. Koether. Fri, Mar 21, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) AJAX Fri, Mar 21, / 16

Relational Databases

jquery Lecture 34 Robb T. Koether Wed, Apr 10, 2013 Hampden-Sydney College Robb T. Koether (Hampden-Sydney College) jquery Wed, Apr 10, / 29

The x86 Architecture

List Iterators. Lecture 34 Section Robb T. Koether. Hampden-Sydney College. Wed, Apr 24, 2013

Functional Dependencies and Normal Forms

The x86 Instruction Set

Functional Dependencies and Normal Forms

Transcription:

The Plurality-with-Elimination Method Lecture 9 Section 1.4 Robb T. Koether Hampden-Sydney College Fri, Sep 8, 2017 Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 1 / 17

1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 2 / 17

Outline 1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 3 / 17

The Plurality-with-Elimination Method Definition (The Plurality-with-Elimination Method) By the plurality-with-elimination method (also called instant-runoff voting, or IRV), The voters cast their votes for their first-place choice. If one candidate has a majority of votes, he wins. Otherwise, the candidate with the fewest first-place votes is eliminated and the process repeats with the remaining candidates until there is a winner. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 4 / 17

The Political Science Club Election Example (The Political Science Club Election) 15 11 6 3 1st A B C C 2nd D A D B 3rd C D B A 4th B C A D Who is the winner? Give the complete ranking (in reverse order of elimination). Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 5 / 17

The Political Science Club Election Example (The Political Science Club Election) 15 11 6 3 1st A B B A 2nd D A D B 3rd C D C C 4th B C A D What if there is a tie (C and D each received 0 first-place votes)? Which one do we eliminate? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 6 / 17

The Political Science Club Election Example (The Political Science Club Election) 15 11 6 3 1st A B B A 2nd D A D B 3rd C D C C 4th B C A D What if there is a tie (C and D each received 0 first-place votes)? Which one do we eliminate? Does it matter? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 6 / 17

What if There is a Tie? Example (What if There is a Tie?) 10 8 8 8 1st A B C D 2nd B C D B 3rd C D B C 4th D A A A Eliminate B. Who wins? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 7 / 17

What if There is a Tie? Example (What if There is a Tie?) 10 8 8 8 1st A B C D 2nd B C D B 3rd C D B C 4th D A A A Eliminate B. Who wins? Eliminate C. Who wins? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 7 / 17

What if There is a Tie? Example (What if There is a Tie?) 10 8 8 8 1st A B C D 2nd B C D B 3rd C D B C 4th D A A A Eliminate B. Who wins? Eliminate C. Who wins? Eliminate D. Who wins? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 7 / 17

What if There is a Tie? Example (What if There is a Tie?) 10 8 8 8 1st A B C D 2nd B C D B 3rd C D B C 4th D A A A Eliminate B. Who wins? Eliminate C. Who wins? Eliminate D. Who wins? Let s not worry about that. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 7 / 17

Outline 1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 8 / 17

Faster Elimination Rather than eliminate the candidates one per round, we could eliminate Two per round (or three, or four, etc.) All but two in the first round. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 9 / 17

Example Example Suppose that there are 5 candidates: A, B, C, D, E. The following table summarizes the voters preferences. Preferences No. of voters 6 4 4 4 3 1 1 1st B B D E A C C 2nd A A A C D B D 3rd C D E D C A A 4th D E C B B D B 5th E C B A E E E Use the elimination method, 2 at a time, to find the winner. Would the result be the same if we eliminated them one at a time? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 10 / 17

Outline 1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 11 / 17

A Defect 7 8 10 4 1st A B C A 2nd B C A C 3rd C A B B What could possibly go wrong with this method? Who is the winner? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 12 / 17

A Defect 7 8 10 4 1st A B C A 2nd B C A C 3rd C A B B What could possibly go wrong with this method? Who is the winner? What if the 4 voters who preferred A over C (in the last column) changed their minds and preferred C over A. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 12 / 17

A Defect 7 8 10 4 1st A B C C 2nd B C A A 3rd C A B B What could possibly go wrong with this method? Who is the winner? What if the 4 voters who preferred A over C (in the last column) changed their minds and preferred C over A. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 13 / 17

A Defect 7 8 10 4 1st A B C C 2nd B C A A 3rd C A B B What could possibly go wrong with this method? Who is the winner? What if the 4 voters who preferred A over C (in the last column) changed their minds and preferred C over A. That could only help C, right? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 13 / 17

A Defect 7 8 10 4 1st A B C C 2nd B C A A 3rd C A B B What could possibly go wrong with this method? Who is the winner? What if the 4 voters who preferred A over C (in the last column) changed their minds and preferred C over A. That could only help C, right? Wrong! Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 13 / 17

Outline 1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 14 / 17

Coombs Method Definition (Coombs Method) Coombs method is a variation of the plurality-with-elimination method. The voters cast their votes for their last-place choice. The candidate with the most last-place votes is eliminated and the process repeats with the remaining candidates until there is a winner. Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 15 / 17

The Political Science Club Election Example (The Political Science Club Election) 15 11 6 3 1st A B C C 2nd D A D B 3rd C D B A 4th B C A D Who is the winner? Give the complete ranking. How do the results compare to the plurality-with-elimination method? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 16 / 17

Outline 1 The Plurality-with-Elimination Method 2 Variations 3 A Defect in the Method 4 Coombs Method 5 Assignment Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 17 / 17

Assignment Assignment Chapter 1 Exercises 31, 32, 33, 35, 37, 38, 69a. Rework 31, 32, and 33 using Coombs method. Were the results the same as with the Plurality-with-Elimination Method? Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep 8, 2017 18 / 17