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

Slides:



Advertisements
Similar presentations
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Advertisements

Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Voting and social choice Vincent Conitzer
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Plurality Voting with Truth-biased Agents Vangelis Markakis Joint work with: Svetlana Obraztsova, David R. M. Thompson Athens University of Economics and.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
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.
Mixed Strategies For Managers
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
For any player i, a strategy weakly dominates another strategy if (With at least one S -i that gives a strict inequality) strictly dominates if where.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
 1. Introduction to game theory and its solutions.  2. Relate Cryptography with game theory problem by introducing an example.  3. Open questions and.
Social Choice Topics to be covered:
Convergence of Iterative Voting AAMAS 2012 Valencia, Spain Omer Lev & Jeffrey S. Rosenschein.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Algorithmic Game Theory - Basic Solution Concepts and Computational Issues Éva Tardos and Vijay V. Vazirani Presentation Reiknirit, rökfræði og reiknanleiki.
Non-cooperative Game Theory Notes by Alberto Bressan.
Sep. 5, 2013 Lirong Xia Introduction to Game Theory.
Slide 1 of 13 So... What’s Game Theory? Game theory refers to a branch of applied math that deals with the strategic interactions between various ‘agents’,
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Temporal Action-Graph Games: A New Representation for Dynamic Games Albert Xin Jiang University of British Columbia Kevin Leyton-Brown University of British.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Reviewing Bayes-Nash Equilibria Two Questions from the midterm.
CPS Voting and social choice
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
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.
APEC 8205: Applied Game Theory Fall 2007
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
CPS 170: Artificial Intelligence Game Theory Instructor: Vincent Conitzer.
Starbucks, Beating The Prisoners Dillema Brooke Hatcher Econ 202 April 28 th, 2012.
Economics for Business II Day 12 – Some Macro Numbers and Answers Dr. Andrew L. H. Parkes “A Macroeconomic Understanding for use in Business” 卜安吉.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
KRUGMAN'S MICROECONOMICS for AP* Game Theory Margaret Ray and David Anderson Micro: Econ: Module.
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
Voter Turnout. Overview Recap the “Paradox” of Voting Incentives and Voter Turnout Voter Mobilization.
Great Theoretical Ideas in Computer Science.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Lec 23 Chapter 28 Game Theory.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Q 2.1 Nash Equilibrium Ben
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Communication Complexity as a Lower Bound for Learning in Games
1.3 The Borda Count Method.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture Game Theory.
Section 14.1 Voting Methods.
Introduction to Game Theory
Normal Form (Matrix) Games
Introduction to Game Theory
Presentation transcript:

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 prisoners’ dilemma… EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot

What is a Nash Equilibrium? Example: voting prisoners’ dilemma… EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot Suppose tie is broken by deciding to stay in prison

EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot What is a Nash Equilibrium? Example: voting prisoners’ dilemma…

EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot What is a Nash Equilibrium? Example: voting prisoners’ dilemma…

EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot What is a Nash Equilibrium? Example: voting prisoners’ dilemma… Condorcet winner Nash Equilibrium

What is a Nash Equilibrium? Example: voting prisoners’ dilemma… EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot But if players are not truthful, weird things can happen…

EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot Nash Equilibrium What is a Nash Equilibrium? Example: voting prisoners’ dilemma…

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.

EverettPeteDelmar 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot Escape Stay in prison Escape Riot Nash Equilibrium The truthfulness incentive Example

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. 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 = They are randomly assigned a preference order over the candidates. 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 = They are randomly assigned a preference order over the candidates. This was repeated 1,000 times.

Results: number of equilibria 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 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 92.3% of games had at least one Condorcet equilibrium. Average share of Condorcet equilibrium: 40.14%.

Results: social welfare average rank 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: 1 st preference 2 nd preference 3 rd preference Stay in prison Escape Riot 50% Stay in prison Escape Riot 45% Stay in prison Escape Riot 0% Stay in prison Escape Riot 5%

Bayes-Nash equilibrium scenario 5 candidates & 10 voters. We choose a distribution: assign a probability to each preference 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 = candidates & 10 voters. We choose a distribution: assign a probability to each preference 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 = This was repeated 50 times.

Results: number of equilibria Change (from incentive-less scenario) is less profound than in the Nash equilibrium case (76% had only 5 new equilibria).

Results: type of equilibria 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. If it isn’t Pareto-dominated, there is a probability P that a voter would prefer c 2 over c 1, and hence P n/2 that my vote would be pivotal. 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 c1c1 c2c2 …… c2c2 c1c1

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

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…

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