1 Coordinating Collective Resistance through Communication and Repeated Interaction Timothy N. Cason, Purdue Univ. Vai-Lam Mui, Monash Univ.

Slides:



Advertisements
Similar presentations
Vincent Conitzer CPS Repeated games Vincent Conitzer
Advertisements

Some Problems from Chapt 13
Infinitely Repeated Games
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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Crime, Punishment, and Forgiveness
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
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.
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
Cheap talk and cooperation in Stackelberg games Raimo P. Hämäläinen Ilkka Leppänen Systems Analysis Laboratory Aalto University.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
1 Game Theory. 2 Agenda Game Theory Matrix Form of a Game Dominant Strategy and Dominated Strategy Nash Equilibrium Game Trees Subgame Perfection.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Infinitely Repeated Games Econ 171. Finitely Repeated Game Take any game play it, then play it again, for a specified number of times. The game that is.
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Game Theory: Inside Oligopoly
1 Evolution & Economics No. 5 Forest fire p = 0.53 p = 0.58.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
Chapter 9: Economics of Strategy: Game theory
A Memetic Framework for Describing and Simulating Spatial Prisoner’s Dilemma with Coalition Formation Sneak Review by Udara Weerakoon.
Yale Lectures 21 and Repeated Games: Cooperation vs the End Game.
Repeated Interaction and Reputation Effects. Repeated Interaction Creates possibility for reputation effects –reputations for resolve –reputations for.
Outline  In-Class Experiment on a Coordination Game  Test of Equilibrium Selection I :Van Huyck, Battalio, and Beil (1990)  Test of Equilibrium Selection.
APEC 8205: Applied Game Theory Fall 2007
QR 38 3/20/07, More on repeated games in IR I.Folk theorem II.Other solutions to the PD III.Repeated PDs in practice.
Repeated games - example This stage game is played 2 times Any SPNE where players behave differently than in a 1-time game? Player 2 LMR L1, 10, 05, 0.
TOPIC 6 REPEATED GAMES The same players play the same game G period after period. Before playing in one period they perfectly observe the actions chosen.
PRISONER’S DILEMMA By Ajul Shah, Hiten Morar, Pooja Hindocha, Amish Parekh & Daniel Castellino.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
1 Game Theory Sequential bargaining and Repeated Games Univ. Prof.dr. M.C.W. Janssen University of Vienna Winter semester Week 46 (November 14-15)
Punishment and Forgiveness in Repeated Games. A review of present values.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
Dynamic Games & The Extensive Form
Moshe Tennenholtz, Aviv Zohar Learning Equilibria in Repeated Congestion Games.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
Motivation This experiment was a public good experiment to see if groups contribute differently than individuals.  intermediate social structure This.
Lecture 5 Leadership and Reputation Reputations arise in situations where there is an element of repetition, and also where coordination between players.
Explicit versus Implicit Contracts for Dividing the Benefits of Cooperation Marco Casari and Timothy Cason Purdue University.
Equilibrium transitions in stochastic evolutionary games Dresden, ECCS’07 Jacek Miękisz Institute of Applied Mathematics University of Warsaw.
Punishment, Detection, and Forgiveness in Repeated Games.
Final Lecture. Problem 2, Chapter 13 Exploring the problem Note that c, x yields the highest total payoff of 7 for each player. Is this a Nash equilibrium?
Mixed Strategies and Repeated Games
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.
Institute of Physics Wroclaw University of Technology 28/09/2005 How can statistical mechanics contribute to social sciences? Piotr Magnuszewski, Andrzej.
Game Theory (Microeconomic Theory (IV)) Instructor: Yongqin Wang School of Economics, Fudan University December, 2004.
Punishment, Detection, and Forgiveness in Repeated Games.
Lec 23 Chapter 28 Game Theory.
When Can Limited Randomness Be Used in Repeated Games? Moni Naor Weizmann Institute of Science Joint work with Pavel Hubáček and Jon Ullman Columbia University.
OVERCOMING COORDINATION FAILURE THROUGH NEIGHBORHOOD CHOICE ~AN EXPERIMENTAL STUDY~ Maastricht University Arno Riedl Ingrid M.T. Rohde Martin Strobel.
Naked Exclusion: An Experimental Study of Contracts with Externalities Claudia M. Landeo Kathryn E. Spier University of Alberta Harvard Law School Economics.
Yuan Deng Vincent Conitzer Duke University
ECON 330 Lecture 17 Monday, November 25.
Advanced Political Economics
Advanced Political Economics
Dynamic Games of Complete Information
Managerial Economics Kyle Anderson
Chapter 29 Game Theory Key Concept: Nash equilibrium and Subgame Perfect Nash equilibrium (SPNE)
Game Theory.
Multiagent Systems Repeated Games © Manfred Huber 2018.
Lecture 10 Coordination and Reputation
Presentation transcript:

1 Coordinating Collective Resistance through Communication and Repeated Interaction Timothy N. Cason, Purdue Univ. Vai-Lam Mui, Monash Univ.

2 The Divide-and-Conquer CR Game AcquiesceChallenge Acquiesce12, 2, 212, 2, 1 Challenge12, 1, 20, 7, 7 Subordinate B Subord. A Leader Transgress against both AcquiesceChallenge Acquiesce6, 8, 86, 8, 7 Challenge6, 7, 80, 7, 7 Subordinate B Subord. A Not Transgress AcquiesceChallenge Acquiesce8, 2, 98, 2, 8 Challenge8, 1, 90, 7, 7 Subordinate B Subord. A Transgress against A Transgress against B (symmetric payoffs to matrix in subgame above)

3 Transgression and Resistance What institutions and social mechanisms can constrain leaders who have incentives to exploit their power? –A recent theme in political economy and organizational economics –Coordination problem in collective resistance

4 Transgression, Collective Resistance, and Communication Multiple equilibria The outcome of no transgression against any subordinate can not be supported as part of a SPNE with purely self- interested agents The “beneficiary” subordinate, who receives some surplus when transgression occurs against the other, has a dominant strategy to acquiesce Communication should not change the fact that no transgression cannot be supported as an equilibrium However, if some beneficiaries are altruistic punishers, then some joint resistance can occur in the divide-and- conquer (DAC) subgame This also implies that (cheap talk) communication might facilitate coordination against transgression (Cason and Mui (2006) found support for this hypothesis)

5 What about Repeated Interaction? Is repetition also effective in facilitating collective resistance in the absence of communication? –Our previous results suggest that even finite repetition may help increase resistance and reduce transgression (type identification) –Due to multiple SPNE in the stage game, cooperation among subordinates is an equilibrium even for (short) finite repetition –Weingast (1997), citing the folk theorems, emphasizes infinite repetition Is repetition more effective than communication in facilitating collective resistance and deterring transgression?

6 Experimental Design (468 Total subjects) Random Matching Long Horizon Finite Repetition (50 periods) Equivalent Horizon Finite Repetition (8 periods) Indefinite Repetition (7/8 prob of continuation) No Communication 8 Sessions (72 Subjects) 6 at Monash Univ., 2 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ. Ex Post Communication 8 Sessions (72 Subjects) 6 at Monash Univ., 2 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ. 6 Sessions (54 Subjects) 2 at Monash Univ., 4 at Purdue Univ.

7 Results Summary: The Big Picture Repetition reduces the transgression rate, but communication (even with random matching) is at least as effective as the best form of repetition Communication, but not repetition, significantly increases the subordinates’ coordinated resistance Type identification of the other subordinate appears to be better facilitated through (restrictive) communication than repeated play

8 No Transgression Rates Communication Random Matching, No Comm. Baseline

9 Rates of No Transgression Treatment Averages Dropping Periods 1-20 Random Matching Long Horizon Finite Repetition Equivalent Horizon Finite Repetition Indefinite Repetition No Communication 7.5%32.6%20.2%12.1% Ex Post Communication 24.7%55.7%39.9%46.8% Note: Red arrows denote significant differences at p-value<0.05; blue arrows denote significant differences at p-value<0.10 (one-tailed Mann-Whitney tests)

10 No Transgression Rates: Summary Repeated play—particularly repeated play over a long horizon—reduces the rate that leaders transgress. Cheap talk, in the form of binary signals of intentions ex post, is just as effective as the best type of repeated play (Long Horizon) in reducing the transgression rate (Mann- Whitney U=20, n=8, m=6; ns). Holding the matching protocol constant, adding cheap talk always reduces the transgression rate, although this effect is only marginally significant in the finite repetition treatments. The No Transgression rate exceeds 50 percent in the treatment with a long but finite horizon and cheap talk, compared to less than 10 percent in the baseline random matching treatment with no communication.

11 Successful Joint Resistance Rates

12 Random Matching Long Horizon Finite Repetition Equivalent Horizon Finite Repetition Indefinite Repetition No Communication 7.1%14.0%8.4%9.5% Ex Post Communication 14.8%22.4%16.0%26.9% Successful Joint Resistance Rate Treatment Averages Dropping Periods 1-20 Note: Red arrows denote significant differences at p-value<0.05; blue arrows denote significant differences at p-value<0.10 (one-tailed Mann-Whitney tests)

13 Successful Joint Resistance Rates: Summary Repeated play does not increase the rate of successful joint resistance to DAC transgression in the No Communication condition. Within the communication condition, only indefinite repetition increases the joint resistance to DAC rate, compared to communication/random matching. Communication increases the rate of successful joint resistance, compared to no communication and random matching baseline, for all matching treatments (random effects probit model; highest p-value<0.01).

14 Successful Joint Resistance Rate Treatment Averages Dropping Periods 1-20 Random Matching Long Horizon Finite Repetition Equivalent Horizon Finite Repetition Indefinite Repetition No Communication 7.1%14.0%8.4%9.5% Ex Post Communication 14.8%22.4%16.0%26.9% Note: Red arrows denote significant differences at p-value<0.05; blue arrows denote significant differences at p-value<0.10 (one-tailed Mann-Whitney tests)