Let’s take a class vote. How many of you are registered to vote?

Slides:



Advertisements
Similar presentations
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Advertisements

Voting Methods Continued
Presented by: Katherine Goulde
Voting and social choice Vincent Conitzer
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Mark Wang John Sturm Sanjeev Kulkarni Paul Cuff.  Basic Background – What is the problem?  Condorcet = IIA  Survey Data  Pairwise Boundaries = No.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
Chapter 1: Methods of Voting
VOTING SYSTEMS Section 2.5.
Math for Liberal Studies.  In most US elections, voters can only cast a single ballot for the candidate he or she likes the best  However, most voters.
MAT 105 Spring  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss a few.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Social Choice Topics to be covered:
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.
CPS Voting and social choice
CRITERIA FOR A FAIR ELECTION
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Social choice (voting) Vincent Conitzer > > > >
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
Arrow’s Theorem The search for the perfect election decision procedure.
CPS Voting and social choice Vincent Conitzer
Slide 15-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
Warm-Up Rank the following soft drinks according to your preference (1 being the soft drink you like best and 4 being the one you like least)  Dr. Pepper.
The Mathematics of Voting Chapter 1. Preference Ballot A Ballot in which the voters are asked to rank the candidates in order of preference. 1. Brownies.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.2 Flaws of Voting.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Voting System Review Borda – Sequential Run-Off – Run-Off –
My guy lost? What’s up with that….  In the 1950’s, Kenneth Arrow, a mathematical economist, proved that a method for determining election results that.
Arrow’s Impossibility Theorem
Voting: Does the Majority Always Rule?
Impossibility and Other Alternative Voting Methods
1.
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Elections with More Than Two Candidates
Warm Up – 5/27 - Monday How many people voted in the election?
Social Choice Theory [Election Theory]
Classwork: p.33 (27abc run off, 29ab run off, 31, 33ab run off)
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting and social choice
MAT 105 Fall 2008 More Voting Methods.
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
CPS Voting and social choice
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Let’s take a class vote. How many of you are registered to vote?

How groups can best arrive at decisions (goals). find an out come that “reflects the will of the people.” What do you think is the best way for millions of people to make one decision?

Preference List Ballot (def) A ballot consisting of a rank ordering of candidates. Usually in the form of a vertical list with our most preferred candidate on top. No ties allowed.

Examples of Preference List Ballot Australia uses it too!

The Number of Voters Assumption (rule) For the sake of avoiding excessive annoyances in the theory… Throughout the chapter, we will assume that the number of voters is odd. In reality, numbers of voters are often so high that ties are unlikely anyways.

Majority Rule The most obvious of voting methods… 3 desirable properties:

Do we take these simple traits for granted?? The first desirability fails in the system called a Dictatorship, where all ballots except the dictators are ignored… The second desirability fails in imposed rule, where a certain candidate wins regardless of who votes for whom … The third desirability fails in minority rule, where fewest votes win…

May’s Theorem (Kenneth May, 1952)

Who would beat whom if two candidates faced an election 2 at a time? RankNumber of Voters (3) firstABC secondBCA thirdCAB A would defeat B (2:1) B would defeat C (2:1)

Condorcet’s Method (procedure) Extending majority rule to three or more candidates…

Example- Condorcet’s Method Rank6531 firstGBAGRNPB secondAGRNAGGB thirdPBGB AG fourthRNPB RN Number of voters (15) Amount of voters that voted in the same order. Who is the winner using Condorcet’s Method? AG too good to be true. There is one tragic flaw…

Condorcet’s Voting Paradox

Remember this slide??? RankNumber of Voters (3) firstABC secondBCA thirdCAB A would defeat B (2:1) B would defeat C (2:1) C would defeat A (2:1)

Explain why it’s impossible to have two winners using Condorcet’s method with an odd amount of voters By definition of the method, a person wins by beating all others in head to head elections. Since amount of voters is odd, no one head-to-head election will have a tie. How can B beat A if A has already been determined to beat all other candidates??

Plurality Voting Can you see a potential problem with this method???

1980 Senate Race in NY 22%23%15%29%7%4% DDHHJJ HJDJHD JHJDDH D- Alfonse D’Amato- Conservative H- Elizabeth Holtzman- Liberal J- Jacob Javitz- Liberal Is there a Condorcet winner? Who won using Plurality Voting? Yes, Elizabeth Holtzman Yes, Alfonse D’Amato

Condorcet Winner Criterion

Manipulability Can you think of an example of this? It is a problem for Plurality voting, but not the Condorcet Method

Which is your favorite to win the tournament?

Rank Methods (procedure) Condorcet’s contemporary, Jean-Charles de Borda ( )

Borda Count (procedure) How much is the last place vote worth??

Borda Count Failure Independence of Irrelevant Alternatives (IIA) if it is impossible for a candidate B to move from nonwinner status to winner status unless at least one voter reverses the order in which he or she had B and the winning candidate ranked.

Independence of Irrelevant Alternatives

Show that the Borda Count Method does not satisfy IIA. RankNumber of Voters (5) firstAAACC secondBBBBB thirdCCCAA RankNumber of Voters (5) firstAAABB secondBBBCC thirdCCCAA

Sequential Pairwise Voting (procedure) Start with an agenda and pair the first two candidates in a one-on-one contest. The winner moves on to confront the third candidate in the list, one-on-one. Losers are deleted. The candidate remaining at the end wins.

Example: Sequential Pairwise Voting RankNUMBER OF VOTERS (3) firstACB secondBAD thirdDBC fourthCDA Who Wins? Anything wrong with that?

Pareto Condition (failed by SPV method)

The Hare System (procedure) Repeatedly delete candidates that are “least preferred” in the sense of being at the top of the fewest ballots. Number of Voters (13) Rank5431 firstACBB secondBBCA thirdCAAC B and C are both eliminated in the first round

Hare System Number of Voters (13) Rank5431 firstACBA secondBBCB thirdCAAC Suppose the voter in the last column moved A up in his or her vote. The only change made is favorable to A.

Hare System Number of Voters (13) Rank5431 firstACBA secondBBCB thirdCAAC Reapply the Hare system and see that only B is eliminated in the first round. Number of Voters (13) Rank5431 firstACCA secondCAAC C wins!

Wait…what do you mean C won?!?! A won the original election and the only change was favorable to A! There is a failure in Monotonicity with the Hare System

Plurality Runoff Method (procedure) A runoff method (new election using the same ballots), where the two candidates with the most first place votes are pitted head-to head. This method is not monotone. Number of Voters (13) Rank4432 firstABCD secondBADC thirdCCAA fourthDDBB A and B tie with four first place votes each

Plurality Runoff Number of Voters (13) Rank4432 firstABAA secondBABB A wins. Who would have won with the Hare system?? Number of Voters (13) Rank4432 firstABCC secondBAAA thirdCCBB In the first round only D would have been eliminated.

Practice Problems pg (skills check) also, exercises 5-10

With so many different ways to count votes, and with so many different winners, how do we tell who the true winner is???

Arrow’s Impossibility Theorem

Approval Voting