Alex Tabarrok.  Up to now we have assumed that voters will vote for the candidate that they most prefer. Also called sincere voting.  In some situations,

Slides:



Advertisements
Similar presentations
Math for Liberal Studies.  Harder than you might think  There are many examples in history where the results were disputed  We care about this because.
Advertisements

VOTING. BINARY METHODS Choosing between only two alternatives at time Majority Rule Pairwise voting Condorcet Method Agenda Paradox.
Voting for Public Goods (Fisher, Ch. 3) © Allen C. Goodman 2015.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
The Plurality Method Fails The Independence of Irrelevant Alternatives Criterion.
Math for Liberal Studies.  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express.
MAT 105 Fall  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
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.
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.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
MAT 105 Spring  As we have discussed, when there are only two candidates in an election, deciding the winner is easy  May’s Theorem states that.
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.
Alex Tabarrok Arrow’s Theorem.
Stackelberg Voting Games John Postl James Thompson.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Political Cartoon of the Day
 Organizing the Election Process  Facilitating Voter Choice  Recruiting & Aiding Candidates  Organizing a Complex Government  Educating Citizens.
MAT 105 Spring  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express their.
ELECTIONS AND VOTING BEHAVIOR Chapter 10. Three Types of Elections Primary Elections- voters select party nominees General Elections- the contest between.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
Democracy training Because “it’s democratic” doesn’t mean it’s a good idea.
PRESIDENTIAL ELECTIONS
Intro 5 Click the mouse button or press the Space Bar to display the information. Chapter Objectives Section 4: The 2000 Election Describe the unusual.
Arrow’s Theorem The search for the perfect election decision procedure.
Alex Tabarrok. Individual Rankings (Inputs) BDA CCC ABD DAB Voting System (Aggregation Mechanism) Election Outcome (Global Ranking) B D A C.
MAT 105 Spring  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
Electoral College Standard : Discus the nomination process for presidential candidates SWBAT: To explain how the President of the U.S. is elected.
POLITICAL PARTIES (THIRD PARTIES). REMEMBER WHAT A POLITICAL PARTY IS? A group of citizens with similar views on public issues who work to put their ideas.
The Democratic nominee for president did not receive less than 91% of the vote in any election from 1900 to 1944.
 Parties and Politics at the Turn of the Century.
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,
Elections in the U.S..
Section 9.1 Great Expectations Deciding How to Weigh the Unknown Future Chance favors only the prepared mind. Louis Pasteur.
Arrow’s Impossibility Theorem. Question: Is there a public decision making process, voting method, or “Social Welfare Function” (SWF) that will tell us.
Initiative 318 (IRV) & Election Methods A presentation of issues addressed by Washington State Initiative 318 and a discussion of possible alternatives.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Arrow’s Impossibility Theorem
 Harder than you might think  There are many examples in history where the results were disputed.
Voting Theory Part II: Solutions. Proposed Solutions Approval Voting Range Voting Instant Runoff Voting Borda Count Modifications –Borda Preferendum –Quota.
One Book One Northwestern Book Group Discussion
Predicting Elections adapted and updated from a feature on ABC News’ Nightline.
Choosing the Lesser Evil: Helping Students Understand Voting Systems
Impossibility and Other Alternative Voting Methods
ELECTORAL COLLEGE.
Chapter 11.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
The Federal Judicial System: Applying the Law
Civic Education Workshop
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Elections.
Impossibility and Other Alternative Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
“Elections”.
The Changing Colors of America
Alex Tabarrok Strategic Voting.
Wstęp do Teorii Gier.
The Changing Colors of America
Elections with More Than Two Candidates
Alex Tabarrok Arrow’s Theorem.
VOTING.
Minor Parties Political Parties.
Voting systems Chi-Kwong Li.
Assessing Electoral Systems
Unit 5 - Elections.
I. Bill Clinton’s Presidency
The Two Party System I. America has been a two party nation for most of its history. A. The U.S. has always had 2 parties, so Americans expect that and.
The Electoral College I. What is the Electoral College?
“Voting and Elections”
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Alex Tabarrok

 Up to now we have assumed that voters will vote for the candidate that they most prefer. Also called sincere voting.  In some situations, however, a voter can do better by voting insincerely also called sophisticated or strategic voting.  E.g. Bush, Gore, Nader. Voters who rank Nader the highest may instead vote for their second choice, Gore, because if they vote for Nader they fear they will get Bush.  A voter who ranks Nader highest but who votes for 2 nd choice Gore is voting insincerely but strategically.  Strategic voting doesn’t solve any of our previous problems but it does change outcomes in often interesting ways.

 During Reagan’s term there was a battle to appoint a judge to the Supreme Court. Bork was the first nominee but it was widely expected that if Bork was rejected Ginsberg would be nominated and if not him then Kennedy and if not him then Vacant.

 Bork?  Everyone votes against Bork. Bork loses.  Ginsberg?  A, C vote no. Ginsberg loses.  Kennedy?  A, B vote yes. Kennedy wins. Senator ASenator BSenator C 1stKennedyGinsbergVacant 2ndVacantKennedyBork 3rdBorkVacantGinsberg 4thGinsbergBorkKennedy  What happens? Solve first with sincere voting where each voter says no if a more preferred candidate is yet to come.  Suppose preferences are as follows:

 Now we solve using strategic voting. Look forward, reason backward.  If we get to Kennedy v. Vacant then it’s the end of the road and there is no longer any reason to vote strategically so we know that Kennedy will win.  But that means that if we get to Ginsberg it’s really Ginsberg v. Kennedy. So what will happen?  B and C prefer Ginsberg to Kennedy so if we get to Ginsberg, Ginsberg will win.  But that means that if we get to Bork its really Bork v. Ginsberg.  A and C prefer Bork to Ginsberg so Bork wins!  Under sincere voting everyone votes against Bork. Under strategic voting Bork wins.  Bork wins even though everyone prefers Vacant to Bork! Senator ASenator BSenator C 1stKennedyGinsbergVacant 2ndVacantKennedyBork 3rdBorkVacantGinsberg 4thGinsbergBorkKennedy

 Given that everyone prefers Vacant to Bork will the strategic equilibrium we discussed happen? Hard to say.  If some of the Senators trust one another, vote trading (also called logrolling) is another possibility.  Suppose A agrees to vote against Bork if B will vote against Ginsberg (her top choice) then Kennedy could win making A and B better off.  Or C may promise to vote against Bork if A promises to vote against Kennedy (and Ginsberg) so Vacant wins.  We can’t say which of these might occur. Senator ASenator BSenator C 1stKennedyGinsbergVacant 2ndVacantKennedyBork 3rdBorkVacantGinsberg 4thGinsbergBorkKennedy

 Suppose that in Bush, Clinton, Perot everyone ranks Perot first but everyone believes that only a minority rank Perot first.  The result is that no one votes for Perot. Voters with Bush second vote for Bush to avoid Clinton and voters with Clinton second vote for Clinton to avoid Bush.  After the vote everyone’s beliefs seem to be validated. Hardly anyone voted for Perot! Self-fulfilling prophecy!  Exit polls show that this kind of thing is surprisingly common when 3 or more parties are typical as in Canada or Great Britain.

 All democratic voting systems can be strategically manipulated in some situations (when there are more than two alternatives).  Closely related to Arrow’s Theorem.  E.g. Imagine that outcomes are non-transitive then the agenda matters.  If positive association fails then we saw that it can be against your interest to vote for your favorite candidate.  If IIA fails then lying about C can influence ranking of A and B.  Etc.  In what sense is an outcome “right” or “legitimate” when people vote non-sincerely?