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.

Slides:



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

Arrow’s Conditions and Approval Voting
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
VOTING. BINARY METHODS Choosing between only two alternatives at time Majority Rule Pairwise voting Condorcet Method Agenda Paradox.
Presented by: Katherine Goulde
1 Public choice Alexander W. Cappelen Econ
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.
Public Finance (MPA405) Dr. Khurrum S. Mughal.
Computational Democracy: Algorithms, Game Theory, and Elections Steven Wolfman 2011/10/27.
How do we decide? Sometimes a group of people have to make a decision and people have different opinions about what the outcome should be In these situations.
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.
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.
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
What is your favorite food?. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The.
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.  Up to now we have assumed that voters will vote for the candidate that they most prefer. Also called sincere voting.  In some situations,
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.
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.
Motivation: Condorcet Cycles Let people 1, 2 and 3 have to make a decision between options A, B, and C. Suppose they decide that majority voting is a good.
Alex Tabarrok Arrow’s Theorem.
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
The Politics of Lineland Last time: She blinded me with Science Why and how should we study legislatures and legislators? Today Introduction to spatial.
Social Choice Theory By Shiyan Li. History The theory of social choice and voting has had a long history in the social sciences, dating back to early.
Incomplete Contracts Renegotiation, Communications and Theory December 10, 2007.
1 Manipulation of Voting Schemes: A General Result By Allan Gibbard Presented by Rishi Kant.
12 April: The Politics of Flatland Last time: Introduction to the unidimensional spatial model of voting and elections. Today: Extending the spatial model.
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.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
The Voting Paradox of Condorcet Marquis de Condorcet.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
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.
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.
PEP 570, DeGeorge, Chp. 3 10/28/20151 Chapter Three: Dr. DeGeorge Utilitarianism: Justice and Love.
1 Voting: Perception and Reality Do voters vote in their best interest? When they do, does the outcome of the vote reflect those interests? What type of.
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.
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.
QR 38 3/13/07, Spatial models I.Unidimensional models II.Median voter theorem III.Multiple dimensions.
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,
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.
1.
Choosing the Lesser Evil: Helping Students Understand Voting Systems
1 The Mathematics of Voting
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Alex Tabarrok Strategic Voting.
Alex Tabarrok Arrow’s Theorem.
Negotiation Analytics 30C02000 Jyrki Wallenius
VOTING.
Voting systems Chi-Kwong Li.
Assessing Electoral Systems
MAT 105 Fall 2008 More Voting Methods.
Developed by Cool Pictures & MultiMedia Presentations
The Mathematics of Elections
Arrow’s Conditions and Approval Voting
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

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 IN GROUPS MUNGER AND MUNGER Slides for Chapter 3 Choosing in Groups: An Intuitive Presentation

Outline of Chapter 3  Preferences  Group choice  Importance of procedures  Strategic voting  Condorcet paradox  Discovery or existence of general will  Closing remarks Slides Produced by Jeremy Spater, Duke University. All rights reserved.2

Preferences  Thin conception of preferences: Ordering (rank) of all alternatives from best to worst  Ties allowed  Useful because general  Thick conception of preferences  Idiosyncratic and subjective  Tastes, judgments, prejudices, attitudes, and beliefs  Exogenous preferences  For purpose of analysis, assume preferences come from outside the model, and are fixed  Start with constituted group, with existing preferences over set of alternatives  Set aside question of where group, preferences, and alternatives came from Slides Produced by Jeremy Spater, Duke University. All rights reserved.3

Preferences (2)  Ordering  Rank alternatives from best to worst  Analyst doesn’t need to know the reasons  Two people with same ordering may have completely different reasons  Ordering may be contingent on many other factors  Ordering provides a basis for collective action  If many of us agree that A is preferable (ranked higher) than B, we can form a coalition Slides Produced by Jeremy Spater, Duke University. All rights reserved.4

Using preferences to predict group choices  To define group choice, we need:  Thick orderings  Set of alternatives  Decision rule  Group choice problem:  Resolving disagreement in a way everyone agrees is legitimate  Group choice is not the same as group preference  Disagreements about preferences  These disagreements cannot be resolved by discussion  Preferences are individual, so someone else’s preferences probably won’t influence mine  Need a way to reach decision without changing individual preferences Slides Produced by Jeremy Spater, Duke University. All rights reserved.5

Group choice example  How to decide?  Simple vote: Tie (one vote each)  Vegetables, Then Fruit (vote on favorite vegetable, then vote on that vegetable vs. Apples)  Apples wins!  This outcome is fair, because everyone agreed on decision rule beforehand Slides Produced by Jeremy Spater, Duke University. All rights reserved.6 EugeneJustinWillow Best ApplesBroccoliCarrots Middle BroccoliCarrotsApples Worst CarrotsApplesBroccoli Carrots EugeneWillow Justin BroccoliApples JustinWillow Eugene

Importance of procedures  Members and procedures characterize groups  Procedures matter as much as members  Sometimes procedure determines outcome  In previous example, “Vegetables Then Fruit” rule led to Apple being chosen  Choice procedure must be specified in group constitution  Many “logical” decision rules are possible  “Air First, Then Dirt” leads to carrots winning! Slides Produced by Jeremy Spater, Duke University. All rights reserved.7 BroccoliApples JustinWillow Eugene ApplesCarrots EugeneJustin Willow

Strategic voting  Voters might “game” the system by misrepresenting their preferences  In previous example, with “Vegetables, Then Fruit” rule  Justin knows that Apples will beat Broccoli in the second round  So a vote for Broccoli (in first round) is really a vote for Apples... which Justin hates  By voting “dishonestly” for Carrots, Justin ensures that Carrots win  Justin can get his second-favorite instead of least-favorite  Strategic Voting  Before final round, look down the decision tree to see outcome of votes Slides Produced by Jeremy Spater, Duke University. All rights reserved.8 BroccoliCarrots EugeneWillow Justin CarrotsApples JustinEugene Willow

Slides Produced by Jeremy Spater, Duke University. All rights reserved.9

Condorcet Paradox  “Apples, Broccoli, Carrots” is one example  Necessary conditions  Three or more choices  Three or more agents  Disagreement of a certain kind  Neither persuasion nor compromise possible  Definition of Condorcet Paradox “If there are at least three choices and at least three choosers who disagree, then pairwise majority rule decision processes can imply intransitive group choices, even if all the individual preference orders are transitive." Slides Produced by Jeremy Spater, Duke University. All rights reserved.10

Condorcet Paradox (2)  Transitivity  For some binary relation R:  X R Y; Y R Z  X R Z  Cycle  Relation among X, Y, Z is a cycle if:  X R Y; Y R Z; Z R X  Cycle implies not transitive  If there is a cycle, then the option chosen depends on the agenda Slides Produced by Jeremy Spater, Duke University. All rights reserved.11

Slides Produced by Jeremy Spater, Duke University. All rights reserved.12

Condorcet paradox (3)  Individual preferences are transitive  No cycles exist in individual preferences  Group preference has a cycle in Condorcet paradox  There is a “cycling majority”  Different majorities prefer X to Y, Y to Z, and Z to X  By giving one majority its wish, we deny another majority  Condorcet winner  X is a Condorcet winner if it wins majority vote against any alternative  If there is a Condorcet winner, there is no cycling or Condorcet paradox  In Apples / Broccoli / Carrots example, there is no Condorcet winner  In absence of Condorcet winner, there may be no objectively “best” choice Slides Produced by Jeremy Spater, Duke University. All rights reserved.13

Discovery or existence of general will  If there is no Condorcet winner (or other determinate choice)  Then any choice of outcome is arbitrary or imposed  Cycling and Manipulability  Agenda setter can determine winner in case of cycle  Agents can vote strategically to defeat agenda-setter  Indeterminacy  No unique mapping from preferences to outcomes  A majority will favor some other feasible alternative  This can give rise to a perpetual cycle of revolutions, leading to dictatorship  Example of French Revolution leading to Napoleon  Democratic constitution must be designed to ensure stability Slides Produced by Jeremy Spater, Duke University. All rights reserved.14

Closing remarks  In general, members’ preferences are not always known by others  But in many situations they are known fairly well  Agenda control can be defeated by disguising preferences  Coalitions can be formed to secure preferences  Political parties can be thought of as long-standing coalitions  Systems based on constitutions and parties can result in stable outcomes Slides Produced by Jeremy Spater, Duke University. All rights reserved.15