Voting. Xiaoyue Zhang

Similar documents
Possibilities of Voting

The Plurality-with-Elimination Method

MATH 1340 Mathematics & Politics

a) Graph 2 and Graph 3 b) Graph 2 and Graph 4 c) Graph 1 and Graph 4 d) Graph 1 and Graph 3 e) Graph 3 and Graph 4 f) None of the above

Math 130 Final Exam Study Guide. 1. Voting

Voting Methods and Colluding Voters

MATH 1340 Mathematics & Politics

The Pairwise-Comparison Method

H 4. Is the graph connected? A. Yes B. No C. Cannot be determined. 5. How many edges are on the graph? A. 8 B. 9 C. 10 D. 11 E.

Search Engines. Provide a ranked list of documents. May provide relevance scores. May have performance information.

Iterative Voting Rules

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

Information Retrieval Rank aggregation. Luca Bondi

On the Axiomatic Characterization of Runoff Voting Rules

Handling Ties. Analysis of Ties in Input and Output Data of Rankings

Practical voting rules with partial information

Weighted Powers Ranking Method

Chapter 4 Answers. Lesson 4.1. Chapter 4 Answers 1

Math 101 Final Exam Study Notes:

Election Night Reporting Quick Start Guide

Computational Social Choice in the Cloud

CP nets: representing and reasoning with preferences of multiple agents

Algorithms, Games, and Networks February 21, Lecture 12

Problems for Op 2013

Practical Algorithms for Computing STV and Other Multi-Round Voting Rules

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.

Preference Elicitation for Single Crossing Domain

arxiv: v1 [cs.ma] 8 May 2018

Math 170, Section 002 Spring 2012 Practice Final Exam with Solutions

Voting Methods For Multiple Autonomous Agents

A Complexity-of-Strategic-Behavior Comparison between Schulze s Rule and Ranked Pairs

Lecture 3: Truth Tables and Logic Gates. Instructor: Joelle Pineau Class web page:

Twentieth Annual University of Oregon Eugene Luks Programming Competition

3 A Model for Stream Based Interactive Storytelling

Parameterized Computational Complexity of Dodgson and Young Elections

Geometric and Combinatorial Weighted Voting: Some Open Problems

Structure and Interpretation of Computer Programs Fall 2016 Midterm 2

M130 Sample Final Exam

The Pretest will consist of 30 different questions ranging from Geometry and Algebra and will be one hour long.

DESIGNING AN ALL-INCLUSIVE DEMOCRACY DECISION-MAKER

Use the following preference schedule to answer questions #1 - #4. Number of Voters st choice 2 nd Choice 3 rd choice 4 th choice

A REAL-LIFE DATA PROJECT FOR AN INTERDISCIPLINARY MATH AND POLITICS COURSE

c Department of Math and Stat

Structure and Interpretation of Computer Programs

Pacific Northwest Region Programming Contest Division 2

Data Reduction and Problem Kernels for Voting Problems

Neural voting machines

15110 PRINCIPLES OF COMPUTING EXAM 3A FALL 2011

MATH& 146 Lesson 8. Section 1.6 Averages and Variation

Neural Voting Machines. Whitman Richards & Sebastian Seung Artificial Intelligence Lab MIT NE43-767, Cambridge, MA

From Social Choice to Theory Choice Michael Morreau

Pivot Tables. This is a handout for you to keep. Please feel free to use it for taking notes.

Cryptography (cont.)

Use the following preference schedule to answer questions #1 - #4. Number of Voters st choice 2 nd Choice 3 rd choice 4 th choice

Winning Positions in Simplicial Nim

Distributed Operating Systems

INFORMATION VISUALIZATION

Preferences, Constraints, Uncertainty, and Multi-Agent Scenarios

Introduction to z-tree: Day 2

IBM Research Report. Computing Slater Rankings Using Similarities Among Candidates

Consensus Answers for Queries over Probabilistic Databases. Jian Li and Amol Deshpande University of Maryland, College Park, USA

Programming Problems 15th Annual Computer Science Programming Contest

CS 1301 Exam 1 Fall 2010

Coordination and Agreement

CS 540: Introduction to Artificial Intelligence

You have this page and the next page to present your solution.

On the Agenda Control Problem for Knockout Tournaments

SIMULTANEOUS EQUATIONS

Lizhe Sun. November 17, Florida State University. Ranking in Statistics and Machine Learning. Lizhe Sun. Introduction

How Do Computers Solve Geometric Problems? Sorelle Friedler, University of Maryland - College Park

On the Complexity of Schedule Control Problems for Knockout Tournaments

How to reach legitimate decisions when the procedure is controversial

DD2451 Parallel and Distributed Computing --- FDD3008 Distributed Algorithms

Bellwork. Find the absolute value for each point

Paxos and Raft (Lecture 21, cs262a) Ion Stoica, UC Berkeley November 7, 2016

Lie on the Fly: Iterative Voting Center with Manipulative Voters

CSE 444: Database Internals. Section 9: 2-Phase Commit and Replication

DISCUSSION PAPER. Board of Certification Oral Examination Consistency

Agreement and Consensus. SWE 622, Spring 2017 Distributed Software Engineering

CPSC 532L Project Development and Axiomatization of a Ranking System

Problem A : Tax. Input (Standard Input) Output (Standard Output) Sample Input and Output

ELEVATESEO. INTERNET TRAFFIC SALES TEAM PRODUCT INFOSHEETS. JUNE V1.0 WEBSITE RANKING STATS. Internet Traffic

Consensus, impossibility results and Paxos. Ken Birman

Transactions. CS 475, Spring 2018 Concurrent & Distributed Systems

Election Night Reporting User Guide. Don Gray Sangamon County Clerk

Pair Ranking. Problem Domain Analysis CHAPTER 9

Computing Slater Rankings Using Similarities Among Candidates

Index. ,a-possibility efficient solution, programming, 275

CS 1301 Exam 1 Fall 2010

Puck Systems User Manual for Coaches and Team Managers

CS455: Introduction to Distributed Systems [Spring 2018] Dept. Of Computer Science, Colorado State University

Royal Pharmaceutical Society Elections to the National Pharmacy Boards 2017

Election Night Reporting Guidebook. County of Santa Clara Barry Garner Registrar of Voters

CS 1301 Exam 1 Spring 2011

QoS Based Ranking for Composite Web Services

Efficient Pairwise Classification

Alberta Municipal Elections Guide for Returning Officers

Connecticut Election Management System

2019 TAHOE DONNER ELECTIONS. March 2019

An Effective Web Service Ranking Algorithm based on Quality of Experience of Users

Transcription:

Voting Xiaoyue Zhang

Preference Ballot Ordered list of candidates Assuming no ties Preference schedule = many preference ballots Alice's Preferences 1. Apple 2. Banana 3. Peach 4. Pear 5. Kiwi

What is fair? Most Satisfied/ Least Dissatisfied Last time, we talked about good matchings and defined good in terms of no rogue couples Here, we will try to define a good election result.

What is fair? Most Satisfied/ Least Dissatisfied Last time, we talked about good matchings and defined good in terms of no rogue couples Here, we will try to define a good election result.

Fairness Majority Guy getting most (>50%) first place votes should be winner Condorcet If A is preferred over B by a majority, then A should be winner Monotonicity If A is winner, A should remain winner if changes to preference schedule that ONLY favor A are made. Independence of Irrelevant Alternatives If A is winner, A should remain winner if a losing candidate drops out and votes are recalculated.

Election Algorithms Plurality Plurality with Elimination Condorcet Borda Count

Plurality # Voters 8 4 3 2 1st A B B D 2nd C D C C 3rd D C D B 4th B A A A Most US elections Only care about 1 st place votes 8 votes for A, so A wins Easy to game the algorithm

Plurality with Elimination At each round, eliminate candidate with FEWEST 1 st place votes 8 4 3 2 1st A B B D 2nd C D C C 3rd D C D B 4th B A A A B wins 8 4 3 2 1st A B B B 2nd B A A A Eliminate C Eliminate D Eliminate A 8 4 3 2 1st A B B D 2nd D D D B 3rd B A A A 8 4 3 2 1st B B B B Abridged version used in France, Georgia, Louisiana

Plurality with Elimination Violates Monotonicity! 1st A B C A 2nd B C A C 3rd C A B B 1st A C C A 2nd C A A C 1st C C C C Moving C up in the rightmost ballot causes C to lose 1st A B C C 2nd B C A A 3rd C A B B 1st B B C C 2nd C C B B 1st B B B B Also violates IIA: If A dropped out in original election, B would win instead of C

Plurality with Elimination Violates Monotonicity! 1st A B C A 2nd B C A C 3rd C A B B 1st A C C A 2nd C A A C 1st C C C C Moving C up in the rightmost ballot causes C to lose 1st A B C C 2nd B C A A 3rd C A B B 1st B B C C 2nd C C B B 1st B B B B Also violates IIA: If A dropped out in original election, B would win instead of C

Plurality with Elimination # Voters 8 4 3 2 1st A B B D 2nd C D C C 3rd D C D B 4th B A A A How do voters feel? How many voters prefer C to B? Does not satisfy Condorcet Criterion Gaming the System The 8 voters can put candidate D first to avoid getting candidate B.

Condorcet Method Compare pair of candidates. Winner in pair gets +1 point, loser gets +0, tie gets +0.5 points. # Voters 8 4 3 2 1st A B B D 2nd C D C C 3rd D C D B 4th B A A A C wins A B C D A - B C D B B - C D C C C - C D D D C - score 0 1 3 2

Condorcet Method Satisfies Condorcet Criterion by construction Thus, also satisfies Majority Criterion Satisfies Monotonicity: Say A wins. If ONLY A is moved up in a ballot, this could only increase the A's score and no one else's because ONLY A is favored. Independence of Irrelevant Alternatives?

Does not satisfy IIA. Condorcet Method When C drops out, winner changes from A to B orig 2 6 4 1 1 4 4 1st A B B C C D E new 2 6 4 1 1 4 4 2nd D A A B D A C 1st A B B B D D E 3rd C C D A A E D 2nd D A A A A A D 4th B D E D B C B 3rd B D D D B E B 5th E E C E E B A 4th E E E E E B A orig A B C D E A - B A A A B B - C tie B C A C - C E D A tie C - D E A B E D - score 3 2.5 2 1.5 1 new A B D E A - B A A B B - tie B D A tie - D E A B D - score 2 2.5 1 1

C wins! Borda Count Assign different points to different places. (Point assignment schemes can control results: most satisfied/least dissatisfied) Our scheme: ith place gets n-i points # Voters 8 4 3 2 1st A B B D 2nd C D C C 3rd D C D B 4th B A A A A: 8*3 + 4*0 + 3*0 + 2*0 pts = 24 pts B: 8*0 + 4*3 + 3*3 + 2*1 pts = 23 pts C: 8*2 + 4*1 + 3*2 + 2*2 pts = 30 pts D: 8*1 + 4*2 + 3*1 + 2*3 pts = 25 pts

Borda Count Violates Majority and Condorcet criteria! # Voters 6 2 3 1st A B C 2nd B C D 3rd C D B 4th D A A A: 6*3 + 2*0 + 3*0 = 18 pts B: 6*2 + 2*3 + 3*1 = 21 pts C: 6*1 + 2*2 + 3*3 = 19 pts D: 6*0 + 2*1 + 3*2 = 8 pts B wins, but A is Majority and Condorcet candidate.

Borda Count In reality, violates fairness criterion relatively infrequently. Used in Icelandic Parlimentary Elections, and main method in Slovenia, Kiribati, Nauru Most popular method for ranking sports teams and colleges

Different Methods and Fairness Method Fairness Plurality Plu. w Elim Condorcet Borda Count Majority yes yes yes no Condorcet no no yes no Monotonicity yes no yes What do you think? IIA no no no What do you think?

Arrow's Impossibility Theorem Fair voting system (w/ at least 3 candidates): Can handle any preference schedule Deterministic Consensus if all voters prefer A to B, society prefers A to B Impartiality all candidates treated equally IIA No dictators if single voter prefers A to B while all others prefer B to A, society must prefer B to A. DOES NOT EXIST!

Arrow's Impossibility Theorem Def quorum: group of voters such that all voters in quorum prefer A to B, and all voters not in quorum prefers B to A, and society prefers A to B If S and T are quorums, S intersect T is also a quorum V {v} must be a quorum, or else v is a dictator Thus, {} is a quorum, which violates consensus

Acknowledgments http://www.mscf.uky.edu/~lee/ma111fa11/slides01.pdf http://en.wikipedia.org/wiki/condorcet_method#basic_procedure http://en.wikipedia.org/wiki/arrow's_impossibility_theorem http://www.math.ucla.edu/~tao/arrow.pdf