DOCSLIB.ORG

Lecture 19: Infinitely Repeated Games

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 19: Infinitely Repeated Games Lecture 19: Infinitely Repeated Games Mauricio Romero Lecture 19: Infinitely Repeated Games Introduction to Infinitely Repeated Games Lecture 19: Infinitely Repeated Games Introduction to Infinitely Repeated Games I This happened because there was a last period from which we could induct backwards (and there was a domino effect!) I When the game is instead infinitely repeated, this argument no longer applies since there is no such thing as a last period I One of the features of finitely repeated games was that if the stage game had a unique Nash equilibrium, then the only subgame perfect Nash equilibrium was the repetition of that unique stage game Nash equilibrium I When the game is instead infinitely repeated, this argument no longer applies since there is no such thing as a last period I One of the features of finitely repeated games was that if the stage game had a unique Nash equilibrium, then the only subgame perfect Nash equilibrium was the repetition of that unique stage game Nash equilibrium I This happened because there was a last period from which we could induct backwards (and there was a domino effect!) I One of the features of finitely repeated games was that if the stage game had a unique Nash equilibrium, then the only subgame perfect Nash equilibrium was the repetition of that unique stage game Nash equilibrium I This happened because there was a last period from which we could induct backwards (and there was a domino effect!) I When the game is instead infinitely repeated, this argument no longer applies since there is no such thing as a last period I We start with a stage game whose utilities are given by u1; u2;:::; un I Each player i has an action set Ai I In each period t = 0; 1; 2;:::, players simultaneously choose an action ai 2 Ai and the chosen action profile (a1; a2;:::; an) is observed by all players I Then play moves to period t + 1 and the game continues in the same manner. I Lets first define what an infinitely repeated game is I Each player i has an action set Ai I In each period t = 0; 1; 2;:::, players simultaneously choose an action ai 2 Ai and the chosen action profile (a1; a2;:::; an) is observed by all players I Then play moves to period t + 1 and the game continues in the same manner. I Lets first define what an infinitely repeated game is I We start with a stage game whose utilities are given by u1; u2;:::; un I In each period t = 0; 1; 2;:::, players simultaneously choose an action ai 2 Ai and the chosen action profile (a1; a2;:::; an) is observed by all players I Then play moves to period t + 1 and the game continues in the same manner. I Lets first define what an infinitely repeated game is I We start with a stage game whose utilities are given by u1; u2;:::; un I Each player i has an action set Ai I Then play moves to period t + 1 and the game continues in the same manner. I Lets first define what an infinitely repeated game is I We start with a stage game whose utilities are given by u1; u2;:::; un I Each player i has an action set Ai I In each period t = 0; 1; 2;:::, players simultaneously choose an action ai 2 Ai and the chosen action profile (a1; a2;:::; an) is observed by all players I Lets first define what an infinitely repeated game is I We start with a stage game whose utilities are given by u1; u2;:::; un I Each player i has an action set Ai I In each period t = 0; 1; 2;:::, players simultaneously choose an action ai 2 Ai and the chosen action profile (a1; a2;:::; an) is observed by all players I Then play moves to period t + 1 and the game continues in the same manner. I Each information set of each player i associated with a finitely repeated game corresponded to a history of action profiles chosen in the past I We can represent each information set of player i by a history: 0 1 0 0 0 t 0 1 t−1 h = (;); h = (a := (a1;:::; an));:::; h = (a ; a ;:::; a ) I We denote the set of all histories at time t as Ht I It is impossible to draw the extensive form of this infinitely repeated game I We can represent each information set of player i by a history: 0 1 0 0 0 t 0 1 t−1 h = (;); h = (a := (a1;:::; an));:::; h = (a ; a ;:::; a ) I We denote the set of all histories at time t as Ht I It is impossible to draw the extensive form of this infinitely repeated game I Each information set of each player i associated with a finitely repeated game corresponded to a history of action profiles chosen in the past I We denote the set of all histories at time t as Ht I It is impossible to draw the extensive form of this infinitely repeated game I Each information set of each player i associated with a finitely repeated game corresponded to a history of action profiles chosen in the past I We can represent each information set of player i by a history: 0 1 0 0 0 t 0 1 t−1 h = (;); h = (a := (a1;:::; an));:::; h = (a ; a ;:::; a ) I It is impossible to draw the extensive form of this infinitely repeated game I Each information set of each player i associated with a finitely repeated game corresponded to a history of action profiles chosen in the past I We can represent each information set of player i by a history: 0 1 0 0 0 t 0 1 t−1 h = (;); h = (a := (a1;:::; an));:::; h = (a ; a ;:::; a ) I We denote the set of all histories at time t as Ht Prisoner's Dilemma C2 D2 C1 1; 1 −1; 2 D1 2; −1 0; 0 I For time t, Ht consists of 4t possible histories I This means that there is a one-to-one mapping between all possible histories and the information sets if we actually wrote out the whole extensive form game tree I As a result, we can think of each ht 2 Ht as representing a particular information set for each player i in each time t I For example, if the stage game is the prisoner's dilemma, at period 1, there are 4 possible histories: 1 f(C1; C2); (C1; D2); (D1; C2); (D1; D2)g = H : I This means that there is a one-to-one mapping between all possible histories and the information sets if we actually wrote out the whole extensive form game tree I As a result, we can think of each ht 2 Ht as representing a particular information set for each player i in each time t I For example, if the stage game is the prisoner's dilemma, at period 1, there are 4 possible histories: 1 f(C1; C2); (C1; D2); (D1; C2); (D1; D2)g = H : I For time t, Ht consists of 4t possible histories I As a result, we can think of each ht 2 Ht as representing a particular information set for each player i in each time t I For example, if the stage game is the prisoner's dilemma, at period 1, there are 4 possible histories: 1 f(C1; C2); (C1; D2); (D1; C2); (D1; D2)g = H : I For time t, Ht consists of 4t possible histories I This means that there is a one-to-one mapping between all possible histories and the information sets if we actually wrote out the whole extensive form game tree I For example, if the stage game is the prisoner's dilemma, at period 1, there are 4 possible histories: 1 f(C1; C2); (C1; D2); (D1; C2); (D1; D2)g = H : I For time t, Ht consists of 4t possible histories I This means that there is a one-to-one mapping between all possible histories and the information sets if we actually wrote out the whole extensive form game tree I As a result, we can think of each ht 2 Ht as representing a particular information set for each player i in each time t I It is simply a prescription of what player i would do at every information set or history I Therefore, it is a function that describes: [ t si : H ! Ai : t≥0 t I Intuitively, si describes exactly what player i would do at every possible history h , t t where si (h ) describes what player i would do at history h I What is a strategy in an infinitely repeated game? I Therefore, it is a function that describes: [ t si : H ! Ai : t≥0 t I Intuitively, si describes exactly what player i would do at every possible history h , t t where si (h ) describes what player i would do at history h I What is a strategy in an infinitely repeated game? I It is simply a prescription of what player i would do at every information set or history t I Intuitively, si describes exactly what player i would do at every possible history h , t t where si (h ) describes what player i would do at history h I What is a strategy in an infinitely repeated game? I It is simply a prescription of what player i would do at every information set or history I Therefore, it is a function that describes: [ t si : H ! Ai : t≥0 I What is a strategy in an infinitely repeated game? I It is simply a prescription of what player i would do at every information set or history I Therefore, it is a function that describes: [ t si : H ! Ai : t≥0 t I Intuitively, si describes exactly what player i would do at every possible history h , t t where si (h ) describes what player i would do at history h I There can be more complicated strategies such as the following: ( t t Ci if t = 0 or h = (C; C;:::; C); si (h ) = Di otherwise: I The above is called a grim trigger strategy t I For example in the infinitely repeated prisoner's dilemma, the strategy si (h ) = Ci t for all h and all t is the strategy in which player i always plays Ci regardless of the history I The above is called a grim trigger strategy t I For example in the infinitely repeated prisoner's dilemma, the strategy si (h ) = Ci t for all h and all t is the strategy in which player i always plays Ci regardless of the history I There can be more complicated strategies such as the following: ( t t Ci if t = 0 or h = (C; C;:::; C); si (h ) = Di otherwise: t I For example in the infinitely repeated prisoner's dilemma, the strategy si (h ) = Ci t for all h and all t is the strategy in which player i always plays Ci regardless
Load more

Recommended publications
  • Repeated Games
    6.254 : Game Theory with Engineering Applications Lecture 15: Repeated Games Asu Ozdaglar MIT April 1, 2010 1 Game Theory: Lecture 15 Introduction Outline Repeated Games (perfect monitoring) The problem of cooperation Finitely-repeated prisoner's dilemma Infinitely-repeated games and cooperation Folk Theorems Reference: Fudenberg and Tirole, Section 5.1. 2 Game Theory: Lecture 15 Introduction Prisoners' Dilemma How to sustain cooperation in the society? Recall the prisoners' dilemma, which is the canonical game for understanding incentives for defecting instead of cooperating. Cooperate Defect Cooperate 1, 1 −1, 2 Defect 2, −1 0, 0 Recall that the strategy profile (D, D) is the unique NE. In fact, D strictly dominates C and thus (D, D) is the dominant equilibrium. In society, we have many situations of this form, but we often observe some amount of cooperation. Why? 3 Game Theory: Lecture 15 Introduction Repeated Games In many strategic situations, players interact repeatedly over time. Perhaps repetition of the same game might foster cooperation. By repeated games, we refer to a situation in which the same stage game (strategic form game) is played at each date for some duration of T periods. Such games are also sometimes called \supergames". We will assume that overall payoff is the sum of discounted payoffs at each stage. Future payoffs are discounted and are thus less valuable (e.g., money and the future is less valuable than money now because of positive interest rates; consumption in the future is less valuable than consumption now because of time preference). We will see in this lecture how repeated play of the same strategic game introduces new (desirable) equilibria by allowing players to condition their actions on the way their opponents played in the previous periods.
    [Show full text]
  • Lecture Notes
    GRADUATE GAME THEORY LECTURE NOTES BY OMER TAMUZ California Institute of Technology 2018 Acknowledgments These lecture notes are partially adapted from Osborne and Rubinstein [29], Maschler, Solan and Zamir [23], lecture notes by Federico Echenique, and slides by Daron Acemoglu and Asu Ozdaglar. I am indebted to Seo Young (Silvia) Kim and Zhuofang Li for their help in finding and correcting many errors. Any comments or suggestions are welcome. 2 Contents 1 Extensive form games with perfect information 7 1.1 Tic-Tac-Toe ........................................ 7 1.2 The Sweet Fifteen Game ................................ 7 1.3 Chess ............................................ 7 1.4 Definition of extensive form games with perfect information ........... 10 1.5 The ultimatum game .................................. 10 1.6 Equilibria ......................................... 11 1.7 The centipede game ................................... 11 1.8 Subgames and subgame perfect equilibria ...................... 13 1.9 The dollar auction .................................... 14 1.10 Backward induction, Kuhn’s Theorem and a proof of Zermelo’s Theorem ... 15 2 Strategic form games 17 2.1 Definition ......................................... 17 2.2 Nash equilibria ...................................... 17 2.3 Classical examples .................................... 17 2.4 Dominated strategies .................................. 22 2.5 Repeated elimination of dominated strategies ................... 22 2.6 Dominant strategies ..................................
    [Show full text]
  • Finitely Repeated Games
    Repeated games 1: Finite repetition Universidad Carlos III de Madrid 1 Finitely repeated games • A finitely repeated game is a dynamic game in which a simultaneous game (the stage game) is played finitely many times, and the result of each stage is observed before the next one is played. • Example: Play the prisoners’ dilemma several times. The stage game is the simultaneous prisoners’ dilemma game. 2 Results • If the stage game (the simultaneous game) has only one NE the repeated game has only one SPNE: In the SPNE players’ play the strategies in the NE in each stage. • If the stage game has 2 or more NE, one can find a SPNE where, at some stage, players play a strategy that is not part of a NE of the stage game. 3 The prisoners’ dilemma repeated twice • Two players play the same simultaneous game twice, at ! = 1 and at ! = 2. • After the first time the game is played (after ! = 1) the result is observed before playing the second time. • The payoff in the repeated game is the sum of the payoffs in each stage (! = 1, ! = 2) • Which is the SPNE? Player 2 D C D 1 , 1 5 , 0 Player 1 C 0 , 5 4 , 4 4 The prisoners’ dilemma repeated twice Information sets? Strategies? 1 .1 5 for each player 2" for each player D C E.g.: (C, D, D, C, C) Subgames? 2.1 5 D C D C .2 1.3 1.5 1 1.4 D C D C D C D C 2.2 2.3 2 .4 2.5 D C D C D C D C D C D C D C D C 1+1 1+5 1+0 1+4 5+1 5+5 5+0 5+4 0+1 0+5 0+0 0+4 4+1 4+5 4+0 4+4 1+1 1+0 1+5 1+4 0+1 0+0 0+5 0+4 5+1 5+0 5+5 5+4 4+1 4+0 4+5 4+4 The prisoners’ dilemma repeated twice Let’s find the NE in the subgames.
    [Show full text]
  • Norms, Repeated Games, and the Role of Law
    Norms, Repeated Games, and the Role of Law Paul G. Mahoneyt & Chris William Sanchiricot TABLE OF CONTENTS Introduction ............................................................................................ 1283 I. Repeated Games, Norms, and the Third-Party Enforcement P rob lem ........................................................................................... 12 88 II. B eyond T it-for-Tat .......................................................................... 1291 A. Tit-for-Tat for More Than Two ................................................ 1291 B. The Trouble with Tit-for-Tat, However Defined ...................... 1292 1. Tw o-Player Tit-for-Tat ....................................................... 1293 2. M any-Player Tit-for-Tat ..................................................... 1294 III. An Improved Model of Third-Party Enforcement: "D ef-for-D ev". ................................................................................ 1295 A . D ef-for-D ev's Sim plicity .......................................................... 1297 B. Def-for-Dev's Credible Enforceability ..................................... 1297 C. Other Attractive Properties of Def-for-Dev .............................. 1298 IV. The Self-Contradictory Nature of Self-Enforcement ....................... 1299 A. The Counterfactual Problem ..................................................... 1300 B. Implications for the Self-Enforceability of Norms ................... 1301 C. Game-Theoretic Workarounds ................................................
    [Show full text]
  • Lecture Notes
    Chapter 12 Repeated Games In real life, most games are played within a larger context, and actions in a given situation affect not only the present situation but also the future situations that may arise. When a player acts in a given situation, he takes into account not only the implications of his actions for the current situation but also their implications for the future. If the players arepatient andthe current actionshavesignificant implications for the future, then the considerations about the future may take over. This may lead to a rich set of behavior that may seem to be irrational when one considers the current situation alone. Such ideas are captured in the repeated games, in which a "stage game" is played repeatedly. The stage game is repeated regardless of what has been played in the previous games. This chapter explores the basic ideas in the theory of repeated games and applies them in a variety of economic problems. As it turns out, it is important whether the game is repeated finitely or infinitely many times. 12.1 Finitely-repeated games Let = 0 1 be the set of all possible dates. Consider a game in which at each { } players play a "stage game" , knowing what each player has played in the past. ∈ Assume that the payoff of each player in this larger game is the sum of the payoffsthat he obtains in the stage games. Denote the larger game by . Note that a player simply cares about the sum of his payoffs at the stage games. Most importantly, at the beginning of each repetition each player recalls what each player has 199 200 CHAPTER 12.
    [Show full text]
  • A Quantum Approach to Twice-Repeated Game
    Quantum Information Processing (2020) 19:269 https://doi.org/10.1007/s11128-020-02743-0 A quantum approach to twice-repeated 2 × 2game Katarzyna Rycerz1 · Piotr Fr˛ackiewicz2 Received: 17 January 2020 / Accepted: 2 July 2020 / Published online: 29 July 2020 © The Author(s) 2020 Abstract This work proposes an extension of the well-known Eisert–Wilkens–Lewenstein scheme for playing a twice repeated 2 × 2 game using a single quantum system with ten maximally entangled qubits. The proposed scheme is then applied to the Prisoner’s Dilemma game. Rational strategy profiles are examined in the presence of limited awareness of the players. In particular, the paper considers two cases of a classical player against a quantum player game: the first case when the classical player does not know that his opponent is a quantum one and the second case, when the classical player is aware of it. To this end, the notion of unawareness was used, and the extended Nash equilibria were determined. Keywords Prisoners dilemma · Quantum games · Games with unawareness 1 Introduction In the recent years, the field of quantum computing has developed significantly. One of its related aspects is quantum game theory that merges together ideas from quantum information [1] and game theory [2] to open up new opportunities for finding optimal strategies for many games. The concept of quantum strategy was first mentioned in [3], where a simple extensive game called PQ Penny Flip was introduced. The paper showed that one player could always win if he was allowed to use quantum strategies against the other player restricted to the classical ones.
    [Show full text]
  • Repeated Games
    Repeated games Felix Munoz-Garcia Strategy and Game Theory - Washington State University Repeated games are very usual in real life: 1 Treasury bill auctions (some of them are organized monthly, but some are even weekly), 2 Cournot competition is repeated over time by the same group of firms (firms simultaneously and independently decide how much to produce in every period). 3 OPEC cartel is also repeated over time. In addition, players’ interaction in a repeated game can help us rationalize cooperation... in settings where such cooperation could not be sustained should players interact only once. We will therefore show that, when the game is repeated, we can sustain: 1 Players’ cooperation in the Prisoner’s Dilemma game, 2 Firms’ collusion: 1 Setting high prices in the Bertrand game, or 2 Reducing individual production in the Cournot game. 3 But let’s start with a more "unusual" example in which cooperation also emerged: Trench warfare in World War I. Harrington, Ch. 13 −! Trench warfare in World War I Trench warfare in World War I Despite all the killing during that war, peace would occasionally flare up as the soldiers in opposing tenches would achieve a truce. Examples: The hour of 8:00-9:00am was regarded as consecrated to "private business," No shooting during meals, No firing artillery at the enemy’s supply lines. One account in Harrington: After some shooting a German soldier shouted out "We are very sorry about that; we hope no one was hurt. It is not our fault, it is that dammed Prussian artillery" But... how was that cooperation achieved? Trench warfare in World War I We can assume that each soldier values killing the enemy, but places a greater value on not getting killed.
    [Show full text]
  • An Example with Frequency-Dependent Stage Payoffs
    A Service of Leibniz-Informationszentrum econstor Wirtschaft Leibniz Information Centre Make Your Publications Visible. zbw for Economics Joosten, Reinoud Working Paper A small Fish War: an example with frequency- dependent stage payoffs Papers on Economics and Evolution, No. 0506 Provided in Cooperation with: Max Planck Institute of Economics Suggested Citation: Joosten, Reinoud (2005) : A small Fish War: an example with frequency- dependent stage payoffs, Papers on Economics and Evolution, No. 0506, Max Planck Institute for Research into Economic Systems, Jena This Version is available at: http://hdl.handle.net/10419/20025 Standard-Nutzungsbedingungen: Terms of use: Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Documents in EconStor may be saved and copied for your Zwecken und zum Privatgebrauch gespeichert und kopiert werden. personal and scholarly purposes. Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle You are not to copy documents for public or commercial Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich purposes, to exhibit the documents publicly, to make them machen, vertreiben oder anderweitig nutzen. publicly available on the internet, or to distribute or otherwise use the documents in public. Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, If the documents have been made available under an Open gelten abweichend von diesen Nutzungsbedingungen die in der dort Content Licence (especially Creative Commons Licences), you genannten Lizenz gewährten Nutzungsrechte. may exercise further usage rights as specified in the indicated licence. www.econstor.eu # 0506 A small Fish War: An example with frequency-dependent stage payoffs by Reinoud Joosten The Papers on Economics and Evolution are edited by the Max Planck Institute for Evolutionary Economics Group, MPI Jena.
    [Show full text]
  • Quantum Conditional Strategies for Prisoners' Dilemmata Under The
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 30 May 2019 doi:10.20944/preprints201905.0366.v1 Peer-reviewed version available at Appl. Sci. 2019, 9, 2635; doi:10.3390/app9132635 Article Quantum conditional strategies for prisoners’ dilemmata under the EWL scheme Konstantinos Giannakis* , Georgia Theocharopoulou, Christos Papalitsas, Sofia Fanarioti, and Theodore Andronikos* Department of Informatics, Ionian University, Tsirigoti Square 7, Corfu, 49100, Greece; {kgiann, zeta.theo, c14papa, sofiafanar, andronikos}@ionio.gr * Correspondence: [email protected] (K.G.); [email protected] (Th.A.) 1 Abstract: Classic game theory is an important field with a long tradition of useful results. Recently, 2 the quantum versions of classical games, such as the Prisoner’s Dilemma (PD), have attracted a lot of 3 attention. Similarly, state machines and specifically finite automata have also been under constant 4 and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the 5 quantum finite automata, have been studied extensively. In this work, we examine some well-known 6 game conditional strategies that have been studied within the framework of the repeated PD game. 7 Then, we try to associate these strategies to proper quantum finite automata that receive them as 8 inputs and recognize them with probability 1, achieving some interesting results. We also study the 9 quantum version of PD under the Eisert-Wilkens-Lewenstein scheme, proposing a novel conditional 10 strategy for the repeated version of this game. 11 Keywords: quantum game theory, quantum automata, prisoner’s dilemma, conditional strategies, 12 quantum strategies 13 1. Introduction 14 Quantum game theory has gained a lot of research interest since the first pioneering works of the 15 late ’90s [1–5].
    [Show full text]
  • Infinitely Repeated Games
    Infinitely Repeated Games Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign [email protected] Jun 12th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Infinitely Repeated Games 2 How Players evaluate payoffs in infinitely repeated games? 3 An Infinitely Repeated Prisoner’s Dilemma 4 A General Analysis C. Hurtado (UIUC - Economics) Game Theory Infinitely Repeated Games On the Agenda 1 Infinitely Repeated Games 2 How Players evaluate payoffs in infinitely repeated games? 3 An Infinitely Repeated Prisoner’s Dilemma 4 A General Analysis C. Hurtado (UIUC - Economics) Game Theory 1 / 19 Infinitely Repeated Games Infinitely Repeated Games If a game has a unique Nash equilibrium, then its finite repetition has a unique SPNE (Exercise). Our intuition, however, is that long-term relationships may be fundamentally different from one-shot meetings. Infinitely repeated games also model a long-term relationship in which the players do not know a priori when they will stop repeating the game: there is no pre-ordained number of repetitions. Recall the terminology: The game that is being repeated is the stage game. The stages of the game are t = 0, 1, 2, .... An infinitely repeated game is also sometimes called a supergame. C. Hurtado (UIUC - Economics) Game Theory 2 / 19 How Players evaluate payoffs in infinitely repeated games? On the Agenda 1 Infinitely Repeated Games 2 How Players evaluate payoffs in infinitely repeated games? 3 An Infinitely Repeated Prisoner’s Dilemma 4 A General Analysis C. Hurtado (UIUC - Economics) Game Theory 3 / 19 How Players evaluate payoffs in infinitely repeated games? How Players evaluate payoffs in infinitely repeated games? A player receives an infinite number of payoffs in the game corresponding to the infinite number of plays of the stage game.
    [Show full text]
  • MS&E 246: Lecture 10 Repeated Games
    MS&E 246: Lecture 10 Repeated games Ramesh Johari What is a repeated game? A repeated game is: A dynamic game constructed by playing the same game over and over. It is a dynamic game of imperfect information. This lecture • Finitely repeated games • Infinitely repeated games • Trigger strategies • The folk theorem Stage game At each stage, the same game is played: the stage game G. Assume: • G is a simultaneous move game •In G, player i has: •Action set Ai • Payoff Pi(ai, a-i) Finitely repeated games G(K) : G is repeated K times Information sets: All players observe outcome of each stage. What are: strategies? payoffs? equilibria? History and strategies Period t history ht: ht = (a(0), …, a(t-1)) where a(τ) = action profile played at stage τ Strategy si: Choice of stage t action si(ht) ∈ Ai for each history ht i.e. ai(t) = si(ht) Payoffs Assume payoff = sum of stage game payoffs Example: Prisoner’s dilemma Recall the Prisoner’s dilemma: Player 1 defect cooperate defect (1,1) (4,0) Player 2 cooperate (0,4) (2,2) Example: Prisoner’s dilemma Two volunteers Five rounds No communication allowed! Round 1 2 3 4 5 Total Player 1 1 1 1 1 1 5 Player 2 1 1 1 1 1 5 SPNE Suppose aNE is a stage game NE. Any such NE gives a SPNE: NE Player i plays ai at every stage, regardless of history. Question: Are there any other SPNE? SPNE How do we find SPNE of G(K)? Observe: Subgame starting after history ht is identical to G(K - t) SPNE: Unique stage game NE Suppose G has a unique NE aNE Then regardless of period K history hK , last stage has unique NE aNE NE ⇒ At SPNE, si(hK) = ai SPNE: Backward induction At stage K -1, given s-i(·), player i chooses si(hK -1) to maximize: Pi(si(hK -1), s-i(hK -1)) + Pi(s(hK)) payoff at stage K -1 payoff at stage K SPNE: Backward induction At stage K -1, given s-i(·), player i chooses si(hK -1) to maximize: NE Pi(si(hK -1), s-i(hK -1)) + Pi(a ) payoff at stage K -1 payoff at stage K We know: at last stage, aNE is played.
    [Show full text]
  • Chapter 10 Game Theory: Inside Oligopoly
    Managerial Economics & Business Strategy Chapter 10 Game Theory: Inside Oligopoly McGraw-Hill/Irwin Copyright © 2010 by the McGraw-Hill Companies, Inc. All rights reserved. Overview I. Introduction to Game Theory II. Simultaneous-Move, One-Shot Games III. Infinitely Repeated Games IV. Finitely Repeated Games V. Multistage Games 10-2 Game Environments Players’ planned decisions are called strategies. Payoffs to players are the profits or losses resulting from strategies. Order of play is important: – Simultaneous-move game: each player makes decisions with knowledge of other players’ decisions. – Sequential-move game: one player observes its rival’s move prior to selecting a strategy. Frequency of rival interaction – One-shot game: game is played once. – Repeated game: game is played more than once; either a finite or infinite number of interactions. 10-3 Simultaneous-Move, One-Shot Games: Normal Form Game A Normal Form Game consists of: – Set of players i ∈ {1, 2, … n} where n is a finite number. – Each players strategy set or feasible actions consist of a finite number of strategies. • Player 1’s strategies are S 1 = {a, b, c, …}. • Player 2’s strategies are S2 = {A, B, C, …}. – Payoffs. • Player 1’s payoff: π1(a,B) = 11. • Player 2’s payoff: π2(b,C) = 12. 10-4 A Normal Form Game Player 2 Strategy ABC a 12 ,11 11 ,12 14 ,13 b 11 ,10 10 ,11 12 ,12 Player 1 Player c 10 ,15 10 ,13 13 ,14 10-5 Normal Form Game: Scenario Analysis Suppose 1 thinks 2 will choose “A”. Player 2 Strategy ABC a 12 ,11 11 ,12 14 ,13 b 11 ,10 10 ,11 12 ,12 Player 1 Player c 10 ,15 10 ,13 13 ,14 10-6 Normal Form Game: Scenario Analysis Then 1 should choose “a”.
    [Show full text]