P.J. Healy California Institute of Technology Learning Dynamics for Mechanism Design An Experimental Comparison of Public Goods Mechanisms.

Slides:



Advertisements
Similar presentations
Chapter 17: Making Complex Decisions April 1, 2004.
Advertisements

Funding Public goods with Lotteries: Experimental Evidence John Morgan; Martin Sefton Heriberto Gonzalez October, 2007.
Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Learning Dynamics for Mechanism Design Paul J. Healy California Institute of Technology An Experimental Comparison of Public Goods Mechanisms.
Nash Implementation of Lindahl Equilibria Sébastien Rouillon Journées LAGV, 2007.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
© 2009 Institute of Information Management National Chiao Tung University Game theory The study of multiperson decisions Four types of games Static games.
Do software agents know what they talk about? Agents and Ontology dr. Patrick De Causmaecker, Nottingham, March
Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure John B. Van Huyck, Raymond C. Battalio, Richard O. Beil The American Economic.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
1 Game Theory. By the end of this section, you should be able to…. ► In a simultaneous game played only once, find and define:  the Nash equilibrium.
An Introduction to... Evolutionary Game Theory
Belief Learning in an Unstable Infinite Game Paul J. Healy CMU.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
Regret Minimization and the Price of Total Anarchy Paper by A. Blum, M. Hajiaghayi, K. Ligett, A.Roth Presented by Michael Wunder.
1 Regret-based Incremental Partial Revelation Mechanism Design Nathanaël Hyafil, Craig Boutilier AAAI 2006 Department of Computer Science University of.
This paper reports an experimental study based on the popular Chinos game, in which three players, arranged in sequence, have to guess the total number.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
An Introduction to Game Theory Part I: Strategic Games
Satisfaction Equilibrium Stéphane Ross. Canadian AI / 21 Problem In real life multiagent systems :  Agents generally do not know the preferences.
1 Duke PhD Summer Camp August 2007 Outline  Motivation  Mutual Consistency: CH Model  Noisy Best-Response: QRE Model  Instant Convergence: EWA Learning.
Algoritmi per Sistemi Distribuiti Strategici
1 Best-Reply Mechanisms Noam Nisan, Michael Schapira and Aviv Zohar.
Review of Yale Lectures 1 and 2 What is a strictly dominated strategy? Why should you never play one? Why do rational choices sometimes lead to poor decisions?
6/2/2001 Cooperative Agent Systems: Artificial Agents Play the Ultimatum Game Steven O. Kimbrough Presented at FMEC 2001, Oslo Joint work with Fang Zhong.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
XYZ 6/18/2015 MIT Brain and Cognitive Sciences Convergence Analysis of Reinforcement Learning Agents Srinivas Turaga th March, 2004.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Outline  In-Class Experiment on Centipede Game  Test of Iterative Dominance Principle I: McKelvey and Palfrey (1992)  Test of Iterative Dominance Principle.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Simple search methods for finding a Nash equilibrium Ryan Porter, Eugene Nudelman, and Yoav Shoham Games and Economic Behavior, Vol. 63, Issue 2. pp ,
A Study of Computational and Human Strategies in Revelation Games 1 Noam Peled, 2 Kobi Gal, 1 Sarit Kraus 1 Bar-Ilan university, Israel. 2 Ben-Gurion university,
Bottom-Up Coordination in the El Farol Game: an agent-based model Shu-Heng Chen, Umberto Gostoli.
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
History-Dependent Graphical Multiagent Models Quang Duong Michael P. Wellman Satinder Singh Computer Science and Engineering University of Michigan, USA.
1 A unified approach to comparative statics puzzles in experiments Armin Schmutzler University of Zurich, CEPR, ENCORE.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Derivative Action Learning in Games Review of: J. Shamma and G. Arslan, “Dynamic Fictitious Play, Dynamic Gradient Play, and Distributed Convergence to.
Learning in Multiagent systems
University of Ottawa - Bio 4118 – Applied Biostatistics © Antoine Morin and Scott Findlay 08/10/ :23 PM 1 Some basic statistical concepts, statistics.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Various topics Petter Mostad Overview Epidemiology Study types / data types Econometrics Time series data More about sampling –Estimation.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
Slide 1 Copyright © 2002 by O. Mikhail, Graphs are © by Pearson Education, Inc. Consumer and Firm Behavior: The Work-Leisure Decision and Profit Maximization.
Incentives for Sharing in Peer-to-Peer Networks By Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge.
Equilibria in Network Games: At the Edge of Analytics and Complexity Rachel Kranton Duke University Research Issues at the Interface of Computer Science.
1. 2 Some details on the Simplex Method approach 2x2 games 2xn and mx2 games Recall: First try pure strategies. If there are no saddle points use mixed.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Coordination and Learning in Dynamic Global Games: Experimental Evidence Olga Shurchkov MIT The Economic Science Association World Meeting 2007.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Choose one of the numbers below. You will get 1 point if your number is the closest number to 3/4 of the average of the numbers chosen by all class members,
On the Difficulty of Achieving Equilibrium in Interactive POMDPs Prashant Doshi Dept. of Computer Science University of Georgia Athens, GA Twenty.
OVERCOMING COORDINATION FAILURE THROUGH NEIGHBORHOOD CHOICE ~AN EXPERIMENTAL STUDY~ Maastricht University Arno Riedl Ingrid M.T. Rohde Martin Strobel.
L23 Public Goods.
L23 Public Goods.
Toshiji Kawagoe Future University – Hakodate and Hirokazu Takizawa
L24 Public Goods.
The Public Goods Environment
UNIT II: The Basic Theory
Principles of Network Development and Evolution: An Experimental Study A review of the paper by Callander and Plott by Kash Barker Callander, S., and.
Collaboration in Repeated Games
Presentation transcript:

P.J. Healy California Institute of Technology Learning Dynamics for Mechanism Design An Experimental Comparison of Public Goods Mechanisms

The Repeated Public Goods Implementation Problem Example: Condo Association “special assessment” –Fixed set of agents regularly choosing public good levels. –Goal is to maximize efficiency across all periods –What mechanism should be used? Questions: –Are the “one-shot” mechanisms the best solution to the repeated problem? –Can one simple learning model approximate behavior in a variety of games with different equilibrium properties? –Which existing mechanisms are most efficient in the dynamic setting?

Previous Experiments on Public Goods Mechanisms I Dominant Strategy (VCG) mechanism experiments –Attiyeh, Franciosi and Isaac ’00 –Kawagoe and Mori ’01 & ’99 pilot –Cason, Saijo, Sjostrom, & Yamato ’03 –Convergence to strict dominant strategies –Weakly dominated strategies are observed

Previous Experiments on Public Goods Mechanisms II Nash Equilibrium mechanisms –Voluntary Contribution experiments –Chen & Plott ’96 –Chen & Tang ’98 –Convergence iff supermodularity (stable equil.) Results consistent with best response behavior

k-period Best Response model –Agents best respond to pure strat. beliefs –Belief = unweighted average of the others’ strategies in the previous k periods Needs convex strategy space –Rational behavior, inconsistent beliefs –Pure strategies only A Simple Learning Model

–Strictly dominated strategies: never played –Weakly dominated strategies: possible –Always converges in supermodular games –Stable/convergence => Nash equilibrium –Can be very unstable (cycles w/ equilibrium) A Simple Learning Model: Predictions

New experiments over 5 public goods mechanisms –Voluntary Contribution –Proportional Tax –Groves-Ledyard –Walker –Continuous VCG (“cVCG”) with 2 parameters Identical environment (endow., prefs., tech.) 4 sessions each with 5 players for 50 periods Computer Interface –History window & “What-If Scenario Analyzer” A New Set of Experiments

Agents: Private Good: Public Good: Endowments: Preferences: Technology: Mechanisms: The Environment

The Mechanisms Voluntary Contribution Proportional Tax Groves-Ledyard Walker VCG

Experimental Results I: Choosing k Which value of k minimizes the M.A.D. across all mechanisms, sessions, players and periods? k=5 is the most accurate

Experimental Results: 5-B.R. vs. Equilibrium Null Hypothesis: Non-stationarity => period-by-period tests Non-normality of errors => non-parametric tests –Permutation test with 2,000 sample permutations Problem: If then the test has little power Solution: –Estimate test power as a function of –Perform the test on the data only where power is sufficiently large.

Simulated Test Power

5-period B.R. vs. Equilibrium Voluntary Contribution (strict dom. strats): Groves-Ledyard (stable Nash equil): Walker (unstable Nash equil): 73/81 tests reject H 0 –No apparent pattern of results across time Proportional Tax: 16/19 tests reject H 0

Interesting properties of the 2-parameter cVCG mechanism Best response line in 2-dimensional strategy space

Best Response in the cVCG mechanism Convert data to polar coordinates Dom. Strat. = origin, B.R. line = 0-degree line

Experimental Results III: Efficiency Outcomes are closest to Pareto optimal in cVCG –cVCG > GL ≥ PT > VC > WK (same for efficiency) –Sensitivity to parameter selection Variance of outcomes: –cVCG is lowest, followed by Groves-Ledyard –Walker has highest Walker mechanism performs very poorly –Efficiency below the endowment –Individual rationality violated 42% of last 10 periods

Discussion & Conclusions Data are consistent with the learning model. –Repercussions for theoretical research Should worry about dynamics –k-period best response studied here, but other learning models may apply Example: Instability of the Walker mechanism cVCG mechanism can perform efficiently Open questions: –cVCG behavior with stronger conflict between incentives and efficiency –Sensitivity of results to parameter changes –Effect of “What-If Scenario Analyzer” tool

Voluntary Contribution Mechanism Results