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.

Slides:



Advertisements
Similar presentations
Some Problems from Chapt 13
Advertisements

Infinitely Repeated Games
Crime, Punishment, and Forgiveness
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Game Theory “Доверяй, Но Проверяй” - Russian Proverb (Trust, but Verify) - Ronald Reagan Mike Shor Lecture 6.
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.
David Bryce © Adapted from Baye © 2002 Game Theory: The Competitive Dynamics of Strategy MANEC 387 Economics of Strategy MANEC 387 Economics.
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.
6-1 LECTURE 6: MULTIAGENT INTERACTIONS An Introduction to MultiAgent Systems
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.
The basics of Game Theory Understanding strategic behaviour.
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.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
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 Lecture 9.
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.
Repeated Prisoner’s Dilemma If the Prisoner’s Dilemma is repeated, cooperation can come from strategies including: “Grim Trigger” Strategy – one.
Dynamic Games of Complete Information.. Repeated games Best understood class of dynamic games Past play cannot influence feasible actions or payoff functions.
Strategic Decisions Making in Oligopoly Markets
Lecture 5 Oligopoly and Strategic Behavior Managerial Economics ECON 511 Professor Changqi Wu.
Finance 30210: Managerial Economics The Basics of Game Theory.
Yale Lectures 21 and Repeated Games: Cooperation vs the End Game.
Final Lecture. ``Life can only be understood backwards; but it must be lived forwards.” Søren Kierkegaard Thoughts on subgame perfection?
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
APEC 8205: Applied Game Theory Fall 2007
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
1 Section 2d Game theory Game theory is a way of thinking about situations where there is interaction between individuals or institutions. The parties.
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.
Dynamic Games. Overview In this unit we study: Combinations of sequential and simultaneous games Solutions to these types of games Repeated games How.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
Recent Research Studies on Cooperative Games In the recent years since around 2003 I have been doing research following up on a specific idea for the finding.
C H A P T E R 13 Game Theory and Competitive Strategy CHAPTER OUTLINE
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)
Game Theory Formalizing the Hobbesian Dilemma. A. Assumptions 1. Assumptions a. Rational choice – People act according to their preferences (desires,
1 Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution – Non-Commercial 3.0 License.
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
Finite Iterated Prisoner’s Dilemma Revisited: Belief Change and End Game Effect Jiawei Li (Michael) & Graham Kendall University of Nottingham.
© 2012 Noordhoff Uitgevers Seen in many American Tv-series Prisoner’s dilemma.
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
1 GAME THEORY AND OLIGOPOLY l Principles of Microeconomic Theory, ECO 284 l John Eastwood l CBA 247 l l address:
Subgames and Credible Threats (with perfect information) Econ 171.
Punishment, Detection, and Forgiveness in Repeated Games.
GAME THEORY and its Application Chapter 06. Outlines... Introduction Prisoner`s dilemma Nash equilibrium Oligopoly price fixing Game Collusion for profit.
Computation of Mixed Strategy Equilibria in Repeated Games Juho Timonen Instructor: PhD (Tech) Kimmo Berg Supervisor: Prof. Harri Ehtamo Saving.
Econ 545, Spring 2016 Industrial Organization Anticompetitive actions: Cartels and collusion.
Econ 545, Spring 2016 Industrial Organization Dynamic Games.
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.
ECON 330 Lecture 17 Monday, November 25.
Game Theory II – Repeated Games
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Game Theory: The Nash Equilibrium
Lecture 10 Coordination and Reputation
Presentation transcript:

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 possibilities How to improve the outcome you achieve from a game by making your current play contingent on how your opponent played in the past. How to make the other player be cooperative. Warning Warning: We shall also learn when repeated play gains us nothing.

Games People Play.

The Prisoners’ Dilemma Finite repetition. What happens when the game is repeated with the same opponent a finite number of times? Criminal #2 ConfessDeny Criminal#1 Confess 10,10 1, 25 Deny 25,1 3,3

Games People Play. The Prisoners’ Dilemma Finite repetition. The last play of the game is a one-shot-game. So the equilibrium is {C,C}. Now in the last by on play the players know {C,C} will be played in the last stage. So play {C,C} in the last but one stage and so on. This is just backwards induction. But was it the outcome of actual play? Criminal #2 ConfessDeny Criminal#1 Confess 10,10 1, 25 Deny 25,1 3,3

Games People Play.

The Prisoners’ Dilemma Indeterminate number of repetitions. What happens when the number of repetitions and thus the end of the game is unknown? Criminal #2 ConfessDeny Criminal#1 Confess 10,10 1, 25 Deny 25,1 3,3

Games People Play. The Prisoners’ Dilemma Indeterminate number of repetitions. The key element here is that the players can adopt contingent strategies. If you do this on this round of the game, then I will respond on the next round. This option remains available if there is some chance there will be a next round. Criminal #2 ConfessDeny Criminal1# Confess 10,10 1, 25 Deny 25,1 3,3

Games People Play. The Prisoners’ Dilemma Trigger Strategy Equilibria. If someone “misbehaves” in one round of the game they can be punished in the next. This option remains available if there is some chance there will be a next round. If this threat is sufficient to change the players strategies then we have found a new equilibrium termed a trigger strategy equilibrium. The simplest form of trigger strategy is called tit-for-tat. Whatever you do in this round of the game I will do in the next round.

Games People Play. Yogi on Trigger Strategy Equilibria "You should always go to other people's funerals; otherwise, they won't come to yours." – Yogi Berra.

Games People Play. The Prisoners’ Dilemma Trigger Strategy Equilibria – Tit-for-tat. For sake of the example let the payoff matrix be Nixon #2 CD Nixon #1 C 10,10 1,15 D 15,1 3,3 Let both Nixons be initially playing deny. #1 considers playing confess This gets him 1 today. But 10 next period when #2 plays tit-for-tat and also denies. Alternatively he can continue with deny. This gets him 3 today. Then 3 in the next period as #2 plays tit-for-tat and also plays deny. Since 6 < 11 he plays deny today and deny tomorrow, as does #2 who faces identical incentives.

Games People Play. The Prisoners’ Dilemma Trigger Strategy Equilibria. Tit-for-tat is not the only possible punishment. In some circumstances more of a threat is needed to ensure cooperation (check out our example with the original numbers). One possibility is the “Grim Punishment Strategy” which states if you cheat on our deal I will punish you forever. Since {C,C} is a Nash equilibrium in our game this is not ridiculous. More extreme still, but somewhat strange, is the “Severe Punishment Strategy” I do something worse to you than Nash. I do this not because if I do not you punish me for not punishing you and visa versa !!

Games People Play. The Prisoners’ Dilemma Infinitely Repeated Games and Discounting. It might seem that almost any outcome can be supported by a grim strategy since the punishment appears to be infinite. This isn’t the case because we are impatient, that is we discount the future. A dollar today is better than a dollar in a years time. Thus since punishments occur in the future and the rewards from non-cooperation occur today it may be difficult to enforce a good outcome. As an example consider discounting with a tit-for-tat trigger strategy.

Games People Play. The Prisoners’ Dilemma Nixon #2 CD Nixon#1 C 10,10 1,15 D 15,1 3,3 Nixon #1 considers playing confess This gets him 1 today. But  10) next period when #2 plays tit-for-tat and also denies. Alternatively he can continue with deny. This gets him 3 today. Then  (3) in the next period as #2 plays tit-for-tat and also plays deny. The Strategy fails if (recall small number are better in this example). 3+  (3) > 1+  (10) or  And the same incentives apply to #2.

Games People Play. Yogi on Discounting – Yogi Berra. "A nickel isn't worth a dime today." – Yogi Berra.