David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland

Similar documents
Empirical Aspects of Plurality Elections Equilibria

Empirical Aspects of Plurality Election Equilibria

Social Choice & Mechanism Design

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Topics on the Border of Economics and Computation December 18, Lecture 8

Exercises For DATA AND DECISIONS. Part I Voting

Arrow s Impossibility Theorem

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

1.6 Arrow s Impossibility Theorem

Supporting Information Political Quid Pro Quo Agreements: An Experimental Study

University of Toronto Department of Economics. Party formation in single-issue politics [revised]

Elections with Only 2 Alternatives

Homework 7 Answers PS 30 November 2013

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Strategic voting. with thanks to:

Social Rankings in Human-Computer Committees

Voting Systems That Combine Approval and Preference

Voter Sovereignty and Election Outcomes

Public Choice. Slide 1

Fairness Criteria. Review: Election Methods

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Many Social Choice Rules

Voting System: elections

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory

Strategic Voting and Strategic Candidacy

Strategic Voting and Strategic Candidacy

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Introduction to Political Economy Problem Set 3

Voting Criteria April

Lecture 11. Voting. Outline

Math for Liberal Studies

Cloning in Elections 1

Preferential votes and minority representation in open list proportional representation systems

Sequential vs. Simultaneous Voting: Experimental Evidence

MATH 1340 Mathematics & Politics

Analysis of Equilibria in Iterative Voting Schemes

HOTELLING-DOWNS MODEL OF ELECTORAL COMPETITION AND THE OPTION TO QUIT

Answers to Practice Problems. Median voter theorem, supermajority rule, & bicameralism.

Introduction. The Politician and the Judge: Accountability in Government

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

Voting. Suppose that the outcome is determined by the mean of all voter s positions.

Math Circle Voting Methods Practice. March 31, 2013

Enriqueta Aragones Harvard University and Universitat Pompeu Fabra Andrew Postlewaite University of Pennsylvania. March 9, 2000

ECONS 491 STRATEGY AND GAME THEORY 1 SIGNALING IN THE LABOR MARKET

CSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1

answers to some of the sample exercises : Public Choice

A Study of Approval voting on Large Poisson Games

IMPERFECT INFORMATION (SIGNALING GAMES AND APPLICATIONS)

Classical papers: Osborbe and Slivinski (1996) and Besley and Coate (1997)

EFFICIENCY OF COMPARATIVE NEGLIGENCE : A GAME THEORETIC ANALYSIS

Random tie-breaking in STV

MULTIPLE VOTES, MULTIPLE CANDIDACIES AND POLARIZATION ARNAUD DELLIS

9.3 Other Voting Systems for Three or More Candidates

Approval Voting and Scoring Rules with Common Values

Introduction: The Mathematics of Voting

Convergence of Iterative Voting

Compulsory versus Voluntary Voting Mechanisms: An Experimental Study

Corruption in Committees: An Experimental Study of Information Aggregation through Voting 1

Voting and preference aggregation

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

Strategy in Law and Business Problem Set 1 February 14, Find the Nash equilibria for the following Games:

arxiv: v1 [cs.gt] 11 Jul 2018

12.2 Defects in Voting Methods

Social Rankings in Human-Computer Committees

Social Choice: The Impossible Dream. Check off these skills when you feel that you have mastered them.

Election Theory. How voters and parties behave strategically in democratic systems. Mark Crowley

Voting Methods

Rock the Vote or Vote The Rock

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker

Chapter 1 Practice Test Questions

Technical Appendix for Selecting Among Acquitted Defendants Andrew F. Daughety and Jennifer F. Reinganum April 2015

Rationality of Voting and Voting Systems: Lecture II

Critical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out

An example of public goods

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

The Impossibilities of Voting

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion.

Let the Experts Decide? Asymmetric Information, Abstention, and Coordination in Standing Committees 1

Political Economics II Spring Lectures 4-5 Part II Partisan Politics and Political Agency. Torsten Persson, IIES

Simple methods for single winner elections

1 Electoral Competition under Certainty

c M. J. Wooldridge, used by permission/updated by Simon Parsons, Spring

Voting: Issues, Problems, and Systems, Continued

Distant Truth: Bias Under Vote Distortion Costs

POSITIVE POLITICAL THEORY

Manipulative Voting Dynamics

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

The mathematics of voting, power, and sharing Part 1

(67686) Mathematical Foundations of AI June 18, Lecture 6

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Strategic Sequential Voting

Lecture 16: Voting systems

Some Game-Theoretic Aspects of Voting

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate.

Voting Systems. High School Circle I. June 4, 2017

Coalitional Game Theory

Transcription:

Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland

What is a (pure) Nash Equilibrium? A solution concept involving games where all players know the strategies of all others. If there is a set of strategies with the property that no player can benefit by changing her strategy while the other players keep their strategies unchanged, then that set of strategies and the corresponding payoffs constitute the Nash Equilibrium. Adapted from Roger McCain s Game Theory: A Nontechnical Introduction to the Analysis of Strategy

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st Suppose tie is broken by deciding to stay in 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar But if players are not 1 st truthful, weird things can happen 2 nd 3 rd

What is a Nash Equilibrium? Example: voting ers dilemma Everett Pete Delmar 1 st 2 nd 3 rd

Problem 1: Can we decrease the number of pure Nash equilibria? (especially eliminating the senseless ones )

The truthfulness incentive Each player s utility is not just dependent on the end result, but players also receive a small ε when voting truthfully. The incentive is not large enough as to influence a voter s choice when it can affect the result.

The truthfulness incentive Example Everett Pete Delmar 1 st 2 nd 3 rd

Problem 2: How can we identify pure Nash equilibria?

Action Graph Games A compact way to represent games with 2 properties: Anonymity: payoff depends on own action and number of players for each action. A A A A>B B>A B B B Context specific independence: payoff depends on easily calculable statistic summing other actions. Calculating the equilibria using Support Enumeration Method (worst case exponential, but thanks to heuristics, not common).

Now we have a way to find pure equilibria, and a way to ignore absurd ones. So?

The scenario 5 candidates & 10 voters. Voters have Borda-like utility functions (gets 4 if favorite elected, 3 if 2 nd best elected, etc.) with added truthfulness incentive of ε=10-6. They are randomly assigned a order over the candidates. This was repeated 1,000 times.

Results: number of equilibria 1 0.9 0.8 Share of experiments 0.7 0.6 0.5 0.4 0.3 0.2 All games Games with true as NE Games without true as NE 0.1 0 0 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 105 110 115 120 125 130 135 140 145 Number of PSNE In 63.3% of games, voting truthfully was a Nash equilibrium. 96.2% have less than 10 pure equilibria (without permutations). 1.1% of games have no pure Nash equilibrium at all.

Results: type of equilibria truthful 600 500 Number of equlibria 400 300 200 100 Condorcet NE Truthful NE Non truthful/ Condorcet NE 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Number of PSNE for each experiments 80.4% of games had at least one truthful equilibrium. Average share of truthful-outcome equilibria: 41.56% (without incentive 21.77%).

Results: type of equilibria Condorcet 600 500 Number of equlibria 400 300 200 100 Condorcet NE Truthful NE Non truthful/ Condorcet NE 0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Number of PSNE for each experiments 92.3% of games had at least one Condorcet equilibrium. Average share of Condorcet equilibrium: 40.14%.

Results: social welfare average rank 0.6 Average percentage of equilibra 0.5 0.4 0.3 0.2 All Games (with truthfulness- incenjve) Ignoring Condorcet winners Ignoring truthful winners Without truthfulness incenjve 0.1 0 [0,1) [1,2) [2,3) [3,4) 4 Average ranking (upper value) 71.65% of winners were, on average, above median. 52.3% of games had all equilibria above median.

Results: social welfare raw sum 92.8% of games, there was no pure equilibrium with the worst result (only in 29.7% was best result not an equilibrium). 59% of games had truthful voting as best result (obviously dominated by best equilibrium).

But what about more common situations, when we don t have full information?

Bayes-Nash equilibrium Each player doesn t know what others prefer, but knows the distribution according to which they are chosen. So, for example, Everett and Pete don t know what Delmar prefers, but they know that: 50% 45% 5% 0% 1 st 2 nd 3 rd

Bayes-Nash equilibrium scenario 5 candidates & 10 voters. We choose a distribution: assign a probability to each order. To ease calculations only 6 orders have non-zero probability. We compute equilibria assuming voters are chosen i.i.d from this distribution. All with Borda-like utility functions & truthfulness incentive of ε=10-6. This was repeated 50 times.

Results: number of equilibria # of equilibria (with truthfulness) 40 35 30 25 20 15 10 5 0 0 10 20 30 40 # of equilibria (without truthfulness) Change (from incentive-less scenario) is less profound than in the Nash equilibrium case (76% had only 5 new equilibria).

Results: type of equilibria truthful not truthful 9.52 10.6 5 4.84 4.84 0 0.7 0.7 0.02 0.02 1 candidate 2 candidates 3 candidates 4 candidates 5 candidates 95.2% of equilibria had only 2 or 3 candidates involved in the equilibria. Leading to

Results: proposition In a plurality election with a truthfulness incentive of ε, as long as ε is small enough, for every c 1, c 2 C either c 1 Pareto dominates c 2 (i.e., all voters rank c 1 higher than c 2 ), or there exists a pure Bayes-Nash equilibrium in which each voter votes for his most preferred among these two candidates.

Proof sketch Suppose I prefer c 1 to c 2. c 1 c 2 If it isn t Pareto-dominated, there is a probability P that a voter would prefer c 2 over c 1, hence P n/2 that my vote would be pivotal. c 2 c 1 and If ε is small enough, so one wouldn t be tempted to vote truthfully, each voter voting for preferred type of c 1 or c 2 is an equilibrium

What did we see? Empirical work enables us to better analyze voting systems. E.g., potential tool enabling comparison according likelihood of truthful equilibria Truthfulness incentive induces, we believe, more realistic equilibria. Clustering: in PSNE, clusters formed around the equilibria with better winners. In BNE, clusters formed around subsets of candidates.

Future directions More cases different number of voters and candidates. More voting systems go beyond plurality. More distributions not just random one. More utilities more intricate than Borda. More empirical work utilize this tool to analyze different complex voting problems, bringing about More Nash equilibria

The End (Yes, they escaped ) Thanks for listening!