Experiments with the Volunteer‘s Dilemma Game

Slides:



Advertisements
Similar presentations
Framing Processes in Social Dilemmas. Formal Modelling and Experimental Validation. Christian Steglich, ICS Groningen presentation prepared for the Mathematical.
Advertisements

EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
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.
Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure John B. Van Huyck, Raymond C. Battalio, Richard O. Beil The American Economic.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
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.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
EKONOMSKA ANALIZA PRAVA. Game Theory Outline of the lecture: I. What is game theory? II. Elements of a game III. Normal (matrix) and Extensive (tree)
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Lecture 2A Strategic form games
Game Theory And Competition Strategies
2008/02/06Lecture 21 ECO290E: Game Theory Lecture 2 Static Games and Nash Equilibrium.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
Signaling Models and Experiments A Research Perspective Andreas Diekmann and Wojtek Przepiorka Zurich workshop “Challenges and Visions in the Social Sciences”
A Crash Course in Game Theory Werner Raub Workshop on Social Theory, Trust, Social Networks, and Social Capital II National Chengchi University – NCCU.
An Introduction to Game Theory Part IV: Games with Imperfect Information Bernhard Nebel.
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.
Advanced Microeconomics Instructors: Wojtek Dorabialski & Olga Kiuila Lectures: Mon. & Wed. 9:45 – 11:20 room 201 Office hours: Mon. & Wed. 9:15 – 9:45.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
PRISONER’S DILEMMA By Ajul Shah, Hiten Morar, Pooja Hindocha, Amish Parekh & Daniel Castellino.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Evolutionary Games The solution concepts that we have discussed in some detail include strategically dominant solutions equilibrium solutions Pareto optimal.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
Anonymizing Web Services Through a Club Mechanism With Economic Incentives Mamata Jenamani Leszek Lilien Bharat Bhargava Department of Computer Sciences.
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
Chapter 9 Games with Imperfect Information Bayesian Games.
Social Choice Session 7 Carmen Pasca and John Hey.
Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie Mellon University.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Asymmetry helps to overcome the “diffusion of responsibility” Punitive preferences, monetary incentives and tacit coordination in the punishment of defectors.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 4.1.Dynamic Games of Incomplete Information Lecture
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.
Codeville Revision control computer program – Written by Ross Cohen with some design by Bram Cohen – Use Python – Use merging algorithm called “Codeville.
Ásbjörn H Kristbjörnsson1 The complexity of Finding Nash Equilibria Ásbjörn H Kristbjörnsson Algorithms, Logic and Complexity.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Extensive Form Games With Perfect Information (Illustrations)
1 The Volunteer’s Dilemma (Mixed Strategies). 2 The Volunteer Dilemma Game Simultaneously and independently, players have to decide if they wish to volunteer.
Double Coordination in Small Groups Luigi Mittone, Matteo Ploner, Ivan Soraperra Computable and Experimental Economics Laboratory – University of Trento,
Norm Violation and the Second-Order Free Rider Dilemma Strategic Self-Interest versus Altruistic Punishment Andreas Diekmann (experiments with Wojtek Przepiorka)
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.1.Dynamic Games of Complete and Perfect Information Lecture
Game theory Chapter 28 and 29
Chapter 28 Game Theory.
Yuan Deng Vincent Conitzer Duke University
Microeconomics Course E
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Game theory Chapter 28 and 29
GAME THEORY AND APPLICATIONS
Multiagent Systems Game Theory © Manfred Huber 2018.
GAME THEORY AND APPLICATIONS
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture Game Theory.
Normal Form (Matrix) Games
Presentation transcript:

Experiments with the Volunteer‘s Dilemma Game Andreas Diekmann, Wojtek Przepiorka, Stefan Wehrli ETH Zurich Presentation for the Social Dilemma Conference, Kyoto, August 20-24, 2009

► Volunteer‘s Dilemma (VOD)

Volunteer’s Dilemma The Volunteer’s Dilemma is a N-player binary choice game (for N ≥ 2) with a step-level production function. A player can produce a collective good at cost K > 0. When the good is produced, each player obtains the benefit U > K > 0. If no player volunteers, the good is not produced and all players receive a payoff 0. N-Player Game: 1 2 … N - 1 Other C-Players C U - K D U → No dominant strategy, but N asymmetric pure equilibria in which one player volunteers while all other defect. Cf. Diekmann (1985) Formal Models & Extensions,e.g.: Volunteer’s Dilemma (Diekmann 1985) Asymmetric VOD (Diekmann 1993, Weesie 1993) Timing and incomplete information in the VOD (Weesie 1993, 1994) Cost sharing in the VOD (Weesie and Franzen 1998) Evolutionary Analysis of the VOD (Myatt and Wallace 2008) Dynamic Volunteer’s Dilemma (Otsubo and Rapoport 2008)

Mixed Nash Equilibrium Choose the probability of defection q such that an actor is indifferent concerning the outcome of strategy C and D U – K = U (1 – qN-1) U – K = U - U qN-1 qN-1 = K/U Defection ► q = N-1√ K/U Cooperation ► p = 1 - N-1√ K/U “Diffusion of Responsibility” derived from a game model

Experiment 1 „E-Mail Help Request“ Replication and extension of Barron and Yechiam (2002) Hello! I am a biologist student and I want to continue my studies at the University of (...). Can you please inform me if there is a biology department at the university of (...)? Thank you very much for your help. Sarah Feldman Low cost help, K is low

Treatments and Sample High(er) cost help, K is high Sarah pretends to have to write an essay in school on „Human beings and apes“. She regrets that her school has no online access to the literature and she asks to send to her a pdf of an article in „Nature“ by F.D. Waals on „Monkeys reject unequal pay“. Group size: N = 1, 2, 3, 4, 5 (Nash-equilibrium hyothesis = diffusion of responsibilty) Low cost versus high(er) cost, increasing K Personalized letter (Dear Mrs. Miller) Gender: Sarah Feldman versus Thomas Feldman (Asymmetric situation, not reported here) Sample: 2 samples of 3374 e-mail addresses from 41 universities in Austria, Germany, and Switzerland

Results Group Size

, Gender, and Cost-Effect

Asymmetric Volunteer’s Dilemma Heterogeneity of costs and gains: Ui, Ki for i = 1, …, N; Ui > (Ui – Ki) > 0 Special case: A “strong” cooperative player receives Uk – Kk , N-1 symmetric “weak” players’ get U – K whereby: Uk – Kk > U – K Strategy profile of an “asymmetric”, efficient (Pareto optimal) Nash equilibrium: s = (Ck, D, D, D, D, …,D) i.e. the “strong player” is the volunteer (the player with the lowest cost and/or the highest gain). All other players defect. ► In the asymmetric dilemma: Exploitation of the strong player by the weak actors. ►Paradox of mixed Nash equilibrium: The strongest player has the smallest likelihood to take action!

Evolution of Social Norms in Repeated Games Asymmetric VOD. There are two types of Nash-equilibria in an asymmetric VOD. The mixed Nash-equilibrium and the asymmetric pure strategy equilibrium. We expect the asymmetric equilibrium to emerge in an asymmetric game. In our special version, we expect a higher probability of the “strong” player to take action, i.e. to cooperate than “weak” players. (Exploitation of the “strong” by the “weak”)

Design Experiment II 1. Symmetric VOD (control): U = 80, K = 50 Group size N = 3, series of interactions with 48 to 56 repetions, 120 subjects 1. Symmetric VOD (control): U = 80, K = 50 2. Asymmetric 1: Weak players: U = 80, K = 50, Strong player: U = 80, K = 30 3. Asymmetric 2: Weak players: U = 80, K = 50, Strong player U = 80, K = 10 The collective good has always the same value U = 80. Strong players have lower cost to produce the collective good.

Results Experiment II: The Importance of Learning

Results Experiment II: Dynamics of Behaviour

Results Experiment II: Exploitation of the strong player

Conclusions: Asymmetric Volunteer‘s Dilemma Group size (symmetric game, experiment III, not presented): Complexity of coordination. The efficient provision of the public good decreases with group size. Learning: Evolution of norms. The efficient provision of public good and successfull coordination is increasing with the number of repetitions of the game. Player‘s strength: Exploitation of strong players. In the asymmetric VOD, the public good was provided to a much higher degree by the strong player compared to weak players (although the probability of efficient public good provision was not larger than for the symmetric VOD). Strong player‘s higher likelihood of action is expected by the Harsanyi/Selten theory of equilibrium selection.

Solution of a „Volunteer‘s Dilemma“ by Emperor Penguins Wikipedia Commons

Mixed Nash Equilibrium Choose the probability of defection q such that an actor is indifferent concerning the outcome of strategy C and D U – K = U (1 – qN-1) U – K = U - U qN-1 qN-1 = K/U Defection ► q = N-1√ K/U Cooperation ► p = 1 - N-1√ K/U

Thomas Feldman Sarah Feldman

Experiment I: „E-Mail help requests“ Replication and extension of Barron and Yechiam (2002) Group size 1, 2, 3, 4, 5 Core hypothesis: Decline of cooperation with group size N

Design Experiment II: Asymmetric VOD

Experiments II and III: Evolution of Social Norms in Repeated Games: Hypotheses H1 Repeated symmetric VOD. There are N asymmetric Nash-equilibria in a stage game. Actors take turn to volunteer (C). The outcome is “efficient” (Pareto optimal) and actors achieve an equal payoff distribution with payoff U – K/N per player. a) We expect a coordination rule to emerge over time (social learning) b) Coordination is more problematic in larger groups. H2 Asymmetric VOD. There are two types of Nash-equilibria in an asymmetric VOD. The mixed Nash-equilibrium and the asymmetric pure strategy equilibrium. a) We expect the asymmetric equilibrium to emerge in an asymmetric game. In our special version, we expect a higher probability of the “strong” player to take action, i.e. to cooperate than “weak” players. (Exploitation of the “strong” by the “weak”) b) A focal point should help to solve the coordination problem and the focal player is expected to develop a higher intensity of volunteering.

Design Experiment II: Symmetric VOD

Results Experiment II

Results Experiment II

Results Experiment III

Results Experiment III

Results Experiment III