1 Self-government and Impossibility Theorem: How to find a good allocation mechanism? Anita Gantner Wolfgang Höchtl Rupert Sausgruber University of Innsbruck.

Slides:



Advertisements
Similar presentations
Computational Game Theory Amos Fiat Spring 2012
Advertisements

Funding Public goods with Lotteries: Experimental Evidence John Morgan; Martin Sefton Heriberto Gonzalez October, 2007.
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 10: Mechanism Design Lecturer: Moni Naor.
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
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.
On the Robustness of Preference Aggregation in Noisy Environments Ariel D. Procaccia, Jeffrey S. Rosenschein and Gal A. Kaminka.
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 and social choice Vincent Conitzer
1 Public choice Alexander W. Cappelen Econ
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.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
Negotiation Martin Beer, School of Computing & Management Sciences, Sheffield Hallam University, Sheffield, United Kingdom
Distributed Rational Decision Making Author: Tuomas W. Sandholm Speakers: Praveen Guddeti (1---5) Tibor Moldovan (6---9) CSE 976, April 15, 2002.
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure John B. Van Huyck, Raymond C. Battalio, Richard O. Beil The American Economic.
Arrow’s impossibility theorem EC-CS reading group Kenneth Arrow Journal of Political Economy, 1950.
DECISION MARKETS WITH GOOD INCENTIVES Yiling Chen (Harvard), Ian Kash (Harvard), Internet and Network Economics, 2011.
Mechanism Design and the VCG mechanism The concept of a “mechanism”. A general (abstract) solution for welfare maximization: the VCG mechanism. –This is.
Strategic voting in run-off elections Jean-François L ASLIER (Ecole Polytechnique, France) Karine V AN DER S TRAETEN (Toulouse School of Economics, France)
Article review A good way of checking your understanding is to give a short speech giving an overview of the article or explaining something interesting.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Ties Matter: Complexity of Voting Manipulation Revisited based on joint work with Svetlana Obraztsova (NTU/PDMI) and Noam Hazon (CMU) Edith Elkind (Nanyang.
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
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.
SECOND PART: Algorithmic Mechanism Design. Mechanism Design MD is a subfield of economic theory It has a engineering perspective Designs economic mechanisms.
Reshef Meir Jeff Rosenschein Hebrew University of Jerusalem, Israel Maria Polukarov Nick Jennings University of Southampton, United Kingdom COMSOC 2010,
1 Manipulation of Voting Schemes: A General Result By Allan Gibbard Presented by Rishi Kant.
Reshef Meir School of Computer Science and Engineering Hebrew University, Jerusalem, Israel Joint work with Maria Polukarov, Jeffery S. Rosenschein and.
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Strategic Behavior in Multi-Winner Elections A follow-up on previous work by Ariel Procaccia, Aviv Zohar and Jeffrey S. Rosenschein Reshef Meir The School.
Social Welfare, Arrow + Gibbard- Satterthwaite, VCG+CPP 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A A.
Collusion and the use of false names Vincent Conitzer
Introduction complexity has been suggested as a means of precluding strategic behavior. Previous studies have shown that some voting protocols are hard.
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Yang Cai Sep 8, An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey Auction Case Study:
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
CPS 173 Mechanism design Vincent Conitzer
1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.
More on Social choice and implementations 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A Using slides by Uri.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
The Cost and Windfall of Manipulability Abraham Othman and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Experimental Economics and Neuroeconomics. An Illustration: Rules.
Chapter 12 Decision Rights The Level of Empowerment.
Mechanism design. Goal of mechanism design Implementing a social choice function f(u 1, …, u |A| ) using a game Center = “auctioneer” does not know the.
Microeconomics 2 John Hey. Last 2 weeks of teaching Today: lecture 33 on Public Goods. Tomorrow: lecture 34 on Asymmetric Information. Next Monday: last.
Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.
Great Theoretical Ideas in Computer Science.
Mechanism design (strategic “voting”) Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Strategic Altruism Enrique Fatas LINEEX University of Valencia Antonio Morales LINEEX University of Malaga.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
Arrow’s Impossibility Theorem
Choosing the Lesser Evil: Helping Students Understand Voting Systems
CPS Mechanism design Michael Albert and Vincent Conitzer
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Applied Mechanism Design For Social Good
Unit 4 SOCIAL INTERACTIONS.
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
The Public Goods Environment
Auction Theory תכנון מכרזים ומכירות פומביות
Vincent Conitzer CPS Mechanism design Vincent Conitzer
Presentation transcript:

1 Self-government and Impossibility Theorem: How to find a good allocation mechanism? Anita Gantner Wolfgang Höchtl Rupert Sausgruber University of Innsbruck ESA Rome 2007

Self-government and Impossibility Theorem 2 City of Vienna supports artists through grants allocation by jury of experts increasing discontent with outcomes jury members accused of supporting their protégés now the community can distribute the funds in self-governance according to own rules In 2006: 315,000 Euros allocated by self-government Question: What is a good allocation mechanism? What behavior can be expected in such situation? Motivation

Self-government and Impossibility Theorem 3 Economist's Approach Goal of artists ' community: to find a system that leads to a good representation of the preferences in the community Goal in Economist's language: to find a solution by means of Mechanism design Political decision making (voting systems) In search for a suitable mechanism Desirable property: members should vote sincerely  need to confine strategic voting

Self-government and Impossibility Theorem 4 Theory: General Results Impossibility results of Gibbard and Satterthwaite for arbitrary environments: any preference aggregation method is vulnerable to strategic manipulation by voters Positive result of Clarke Groves mechanism for quasilinear environments: socially optimal implementation in dominant strategies is feasible  Need to characterize particular situation and behavior in order to find suitable solution

Self-government and Impossibility Theorem 5 Specifics of the Situation Network structure artists cooperate, thus networks are built  collusion is possible strong likes and dislikes encourage strategic voting Selection of winners not a unique winner, but: a subset of projects (candidates) is selected Clarke Groves mechanism is not collusion proof Are we in a hopeless quest for optimal solution? Then we should search for a "good" solution.

Self-government and Impossibility Theorem 6 Our Approach Test various mechanisms in the experimental lab overall goal: find a good mechanism preliminary goal: understand behavior take into account the specific network structure see whether and how this affects outcomes of different mechanisms try mechanisms that vary in amount of information they require maybe less information leads to better outcomes in a situation that is prone to collusion and strategic behavior?

Self-government and Impossibility Theorem 7 Representation in the Lab A community is represented by 5 voters majority: group of 3 voters with identical preferences minority: group of 2 voters with identical preferences voting over 4 alternatives Network communication within groups no communication between groups Winner selection: multiple winners

Self-government and Impossibility Theorem 8 Three Mechanisms Cumulative voting each voter distributes 100 points across all available alternatives each alternative thus gets between 0 and 100 points winners: 2 alternatives with highest total points Borda count method each voter ranks the 4 alternatives alternative with rank k gets 4-k points add points across voters for each alternative winners: 2 alternatives with highest total points Pivotal (Groves Clarke) mechanism each voter reports a value for each alternative if sum of reports for an alternative is positive  „ winner “ winners: endogenous number

Self-government and Impossibility Theorem 9 Experimental Setup Experiment at University of Innsbruck Lab 100 subjects (40 Cumul, 20 Borda, 40 Pivot) 10 repetitions within same group, same position payoff = sum of 10 rounds avg. payoff = Euro Parameters: alternative  voters  AlphaBetaGammaDelta Majority (3 voters) Minority (2 voters)

Self-government and Impossibility Theorem 10 Properties of Parametrization If all agents vote according to true preferences, Alpha & Beta will be selected Cumulative voting: minority can ensure winner Beta majority should ensure winner Alpha Borda count: majority can ensure winners Alpha & Delta by strategically ranking Delta over Alpha minority has no leverage Pivotal mechanism discrete values from [-60, 60] in steps of 10 possible dominant strategy: report true preferences  Alpha & Beta many Nash Equilibria, in particular one in which majority ensures Alpha & Delta by overreporting such that no one pays Clarke tax

Self-government and Impossibility Theorem 11 Results: Winners in Three Treatments Payoffs Maj Min CumulativeBordaPivot A & B105080%20%8% A & D40-303%58%83% B & D * %0% A & C * 0-100%18%1% * B & D and A & C are inefficient outcomes (A & B better for both types) Note: in Pivotal mechanism: - few outcomes with 3 or 1 winner (< 10%) observed - outcome ABD (4%): payoff 20 to majority, 10 to minority - outcome A (4%) : payoff 30 to majority, 10 to minority

Self-government and Impossibility Theorem 12 Results: Cumulative voting and Borda Cumulative voting: minority votes strategically in 98%  winner Beta ensured majority makes mistakes: in 18% Delta > Alpha  inefficient outcome Beta & Delta Borda count: sophisticated 1st strategic step: Delta ranked over Alpha on average not found 2nd strategic step: 2 vote DACB, 1 votes DABC no evidence for this sophisticated coordination

Self-government and Impossibility Theorem 13 Results: Behavior in Cumulative & Borda Over time: subjects vote less truthful and more strategic

Self-government and Impossibility Theorem 14 Results: Behavior in Pivotal Mechanism Minority Note: two dominant strategies: truthful report and next highest valuation for Beta, Gamma, Delta: evidence for truthful report only for Alpha: truthful report rejected, overreporting dominant strategy chosen Majority for all alternatives: overreport if positive payoff, underreport if negative payoff

Self-government and Impossibility Theorem 15 Summary environment with communication: outcomes are closer to theory predictions high proportion of strategic behavior in simpler setting (Cumulative voting) lower proportion of strategic behavior in more sophisticated setting and limited steps of reasoning (Borda) bad news for our problem: strong evidence of collusion without concern for other group Clarke Groves fails: truthful reports of minority efficient collusion of majority (not pivotal  no tax) Simplest system (Cumulative voting) yields best result from social point of view