Crime, Punishment, and Forgiveness

Slides:



Advertisements
Similar presentations
Game Theoretic Analysis of Oligopoly y n Y N 0000 Y N The unique dominant strategy Nash Equilibrium is (y,Y) A game of imperfect.
Advertisements

Vincent Conitzer CPS Repeated games Vincent Conitzer
Some Problems from Chapt 13
Infinitely Repeated Games
Pondering more Problems. Enriching the Alice-Bob story Go to AGo to B Go to A Alice Go to B Go to A Go to B Go shoot pool Alice.
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 “Доверяй, Но Проверяй” - Russian Proverb (Trust, but Verify) - Ronald Reagan Mike Shor Lecture 6.
Managerial Economics & Business Strategy
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
1 Welcome to EC 209: Managerial Economics- Group A By: Dr. Jacqueline Khorassani Week Eleven.
Dispute Settlement Mechanism The role of dispute settlement mechanism –information gathering and dispatching, not enforcement of trade arrangements Main.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
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.
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 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.
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. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Repeated Games and the Prisoner’s Dilemma. Prisoner’s dilemma What if the game is played “repeatedly” for several periods? DefectCooperate Defect10 yr,
17. (A very brief) Introduction to game theory Varian, Chapters 28, 29.
Game Theory Lecture 8.
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.
Repeated Prisoner’s Dilemma If the Prisoner’s Dilemma is repeated, cooperation can come from strategies including: “Grim Trigger” Strategy – one.
Games People Play. 8: The Prisoners’ Dilemma and repeated games In this section we shall learn How repeated play of a game opens up many new strategic.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Playing in the Dark Problems from Ch 8. The OS2 story Introduced by IBM in 1987 to compete with MS Windows. Faster and more reliable than Windows but.
Todd and Steven Divide the Estate Problem Bargaining over 100 pounds of gold Round 1: Todd makes offer of Division. Steven accepts or rejects. Round.
Yale Lectures 21 and Repeated Games: Cooperation vs the End Game.
More on Extensive Form Games. Histories and subhistories A terminal history is a listing of every play in a possible course of the game, all the way to.
Final Lecture. ``Life can only be understood backwards; but it must be lived forwards.” Søren Kierkegaard Thoughts on subgame perfection?
ECON6036 1st semester Format of final exam Same as the mid term
Game Theory: Key Concepts Zero Sum Games Zero Sum Games Non – Zero Sum Games Non – Zero Sum Games Strategic Form Games  Lay out strategies Strategic Form.
APEC 8205: Applied Game Theory Fall 2007
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.
QR 38 3/15/07, Repeated Games I I.The PD II.Infinitely repeated PD III.Patterns of cooperation.
0 MBA 299 – Section Notes 4/25/03 Haas School of Business, UC Berkeley Rawley.
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
Dynamic Games. Overview In this unit we study: Combinations of sequential and simultaneous games Solutions to these types of games Repeated games How.
Some Problems from Chapt 13. Problem 1: A crowded fishery.
Beef or Horse? Cheap talk. Beef or horse? In a restaurant, some customers prefer beef, some prefer horse. Type s likes beef, type t likes horse Waitress.
Problems from Chapter 12. Problem 1, Chapter 12 Find a separating equilibrium Trial-and-error. Two possible separating strategies for Player 1: – Choose.
Social Choice Session 7 Carmen Pasca and John Hey.
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 -
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Finite Iterated Prisoner’s Dilemma Revisited: Belief Change and End Game Effect Jiawei Li (Michael) & Graham Kendall University of Nottingham.
Section 2 – Ec1818 Jeremy Barofsky
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
Noncooperative Collusion The Cournot Oligopoly model was a single-period noncooperative model. In most models of imperfect competition, it is true that.
Punishment, Detection, and Forgiveness in Repeated Games.
Econ 545, Spring 2016 Industrial Organization Anticompetitive actions: Cartels and collusion.
Taking Turns in the Dark: (Subgame perfection with incomplete information ) Econ 171.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
Arguments for Recovering Cooperation Conclusions that some have drawn from analysis of prisoner’s dilemma: – the game theory notion of rational action.
Dynamic Games of Complete Information
Vincent Conitzer CPS Repeated games Vincent Conitzer
Game Theory Fall Mike Shor Topic 5.
Vincent Conitzer Repeated games Vincent Conitzer
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Game Theory Spring Mike Shor Topic 5.
Vincent Conitzer CPS Repeated games Vincent Conitzer
Presentation transcript:

Crime, Punishment, and Forgiveness Econ 171

Infinitely repeated prisoners’ dilemma and the “Grim Trigger Strategy” Suppose 2 players play repeated prisoners dilemma, where the probability is d<1 that you will play another round after the end of each round. The grim trigger strategy is to play cooperate on the first round and play cooperate on every round so long as the other doesn’t defect. If the other defects, the grim trigger strategy plays defect on all future rounds.

When is there a symmetric SPNE where all play Grim Trigger? Suppose that the other player is playing Grim Trigger. If you play Grim Trigger as well, then you will cooperate as long as the game continues and and you will receive a payoff of R. Your expected payoff from playing Grim Trigger if the other guy is playing Grim Trigger is therefore R(1+d +d2 + d3 + d4 + ….+ )=R/(1-d)

What if you defect against Grim Trigger If you defect and the other guy is playing Grim Trigger, you will get a payoff of T>R the first time that you defect. But after this, the other guy will always play defect. The best you can do, then is to always defect as well. Your expected payoff from defecting is therefore T+ P(d +d2 + d3 + d4 + ….+ ) =T+Pd/1-d

Cooperate vs Defect If other guy is playing Grim trigger and nobody has yet defected, your expected payoff from playing cooperate is R/(1-d) If other guy is playing Grim trigger and nobody has yet defected, your expected payoff from playing defect is T+Pd/(1-d) Cooperate isR/(1-d) better for you if R/(1-d)>T+Pd/(1-d) which implies d>(T-R)/(T-P) Example If T=10, R=5, P=2, then condition is d>5/8. If d is too small, it pays to “take the money and run”

Other equilbria? Grim trigger is a SPNE if d is large enough. Are there other SPNEs? Yes, for example both play Always Defect is an equilibrium. If other guy is playing Always Defect, what is your best response in any subgame? Another is Play Defect the first 10 rounds, then play Grim Trigger.

A FISHERMAN’S CATCH AND PAYOFF Number of Number of Own Own Boats Other People’s PAYOFF Boats 1 2 25 1 3 20 1 4 15 2 2 45 2 3 35 2 4 20

What is the Nash equilibrium for the stage game for the three fishermen? All send one boat. All send two boats. There is more than one Nash equilibrium for the stage game. There are no pure strategy Nash equilibria, but there is a mixed strategy Nash equilibrium for the stage game. There are no pure or mixed strategy Nash equilibria for the stage game.

Can efficiency be sustained by the Grim Trigger? Suppose that the other two fishermen are playing the grim trigger strategy of sending one boat until somebody sends two boats and if anybody ever sends two boats, you send two boats ever after. If you and the others play the grim trigger strategy, you will always send 1 boat and so will they.

If others are playing grim trigger strategy, would you want to? If you play grim trigger, you will always send 1 boat. Your payoff will be 25 in every period. Assume that a fisherman discounts later profits at rate d. Value of this stream is then 25(1+d+d2+d3 +…)=25(1/1-d) If instead you send 2 boats, you will get payoff of 45 the first time, but only 20 thereafter. Value of this stream is 45+ 20(d+d2+d3 +…) Grim trigger is bigger if 20<5 (d+d2+d3 +…) This means 20<5d/(1-d) which implies d>4/5

Problem 7 The stage game: Payoff to player 1 is V1(x1,x2)=5+x1-2x2 Strategy set for each player is the interval [1,4] What is a Nash equilibrium for the stage game?

What is a Nash equilibrium for the stage game? Both players choose 4 Both players choose 3 Both players choose 2 Both players choose 1 There is no pure strategy Nash equilibrium.

Part b (i) If the strategy set is X={2,3}, when is there a subgame perfect Nash equilibrium in which both players always play 2 so long as nobody has ever played anything else. Compare payoff v(2,2) forever with payoff v(3,2) in first period, then v(3,3) ever after. That is, compare 3 forever with 4 in the first period and then 2 forever.

Part b(ii) X=[1,4] When is there a subgame perfect equilibrium where everybody does y so long as nobody has ever done anything differently and everybody does z>y if anyone ever does anything other than y? First of all, it must be that z=4. Because actions after a violation must be Nash for stage game. When is it true that getting V(y,y) forever is better than getting V(4,y) in the first period and then V(4,4) forever.

Comparison V(y,y) forever is worth V(y,y)/(1-d)=(5-y)/(1-d) V(4,y) and then V(4,4) forever is worth 9-y+1d+1d2+…=9-y+d/1-d) Works out that V(y,y)>V(4,y) if d(8-y)>4

Forgiveness Does the grim trigger strategy have to be so unrelenting? In the real world, why might it not be a good idea to have an unforgiving punishment? This question is much wrestled with in religion and in politics.

Tit for Tat What is both players play the following strategy in infinitely repeated P.D? Cooperate on the first round. Then on any round do what the other guy did on the previous round. Suppose other guy plays tit for tat. If I play tit for tat too, what will happen?

Payoffs If you play tit for tat when other guy is playing tit for tat, you get expected payoff of R(1+d +d2 + d3 + d4 + ….+ )=R/(1-d) Suppose instead that you choose to play “Always defect” when other guy is tit for tat. You will get T+ P(d +d2 + d3 + d4 + ….+ ) =T+Pd/1-d Same comparison as with Grim Trigger. Tit for tat is a better response to tit for tat than always defect if d>(T-R)/(T-P)

Another try Sucker punch him and then get him to forgive you. If other guy is playing tit for tat and you play D on first round, then C ever after, you will get payoff of T on first round, S on second round, and then R for ever. Expected payoff is T+ Sd+d2R(1+d +d2 + d3 + d4 + ….+ )=T+ Sd+d2R/(1-d).

Which is better? Tit for tat and Cheat and ask forgiveness give same payoff from round 3 on. Cheat and ask for forgiveness gives T in round 1 and S in round 2. Tit for tat give R in all rounds. So tit for tat is better if R+dR>T+dS, which means d(R-S)>T-R or d>(T-R)(R-S) If T=10, R=6, and S=1, this would mean if d>4/5. But if T=10, R=5, and S=1, this would be the case only if d>5/4, which can’t happen. In this case, tit for tat could not be a Nash equilibrium.