Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue
|
|
- Egbert Banks
- 5 years ago
- Views:
Transcription
1 Introduction to Industrial Organization Professor: Caixia Shen Fall 014 Lecture Note 6 Games and Strategy (ch.4)-continue Outline: Modeling by means of games Normal form games Dominant strategies; dominated strategies, Iterated elimination of dominated strategies Nash equilibrium Preview: Cournot model of duopoly Preview: Bertrand model of duopoly Sequential games: subgame-perfect equilibrium and commitment Preview: Stackelberg model of duopoly Repeated games 7. Sequential games: backward induction and perfect, commitment Previously we learned simultaneous-move games, now we are going to talk about dynamic games. Consider an example of an industry that is currently monopolized. A second firm must decide whether or not to enter the industry. Given this situation, the incumbent firm must decide whether to price aggressively or not. The incumbent s decision is taken as a function of the entrant s decision. This means entrant move first, and in incumbent moves second. Unlike in static game using normal form representation, we will use a game tree (extensive-form representation) to illustrate a dynamic game. An example is given in figure 4.6. In figure 4.6, a circle denotes a decision node. The game starts with decision n node 1. At this 1
2 node, player 1 (the entrant) makes a choice between e and e, which means enter or not enter. If the entrant does not enter, then the game ends with payoffs π 1 = 0 (the entrant s payoff) and π = 50 (the incumbent s payoff). If player choose enter, then we move on to decision node. This node corresponds to player making a choice between r and r, which means retaliate entry or not retaliate entry. There are two Nash equilibria in this game: (e, r ) and ( e, r). Let s now check that both are NEs. First, for (e, r ) to be an NE, no players has no incentive to change its strategy given what the other player does. First, if player 1 chooses e, then player s best choice is to choose r, since it gets 0 otherwise it would get -10. Likewise, given that player chooses r, player 1 best response is to choose e, it gets 10 otherwise it would get 0. Second, for ( e, r) to be an NE, no player wants to deviate its strategy given the other player s equilibrium strategy. Given that player chooses r, player 1 is better off by choosing e : this yields player a payoff of 0, where e would yield -10. As for player, given that player 1 plays e, its payoff is 50, regardless of which strategy it chooses. It follows that r iis an optimal strategy, although it is not the only one. Credible threat or not? Although two solutions are indeed two Nash equilibria, the second equilibrium does not make much sense. Player 1 is not entering because of the threat that player will choose to retaliate. But is this threat credible? If player 1 were to enter, would player decide to retaliate? Clearly, the answer is NO. by retaliating, player gets -10, compared with 0 from no retaliation. We conclude that (e, r) is not a reasonable prediction of what one might expect to be played, although it is an NE. Backward induction Then we must think of a finer solution concept to get rid of this type of unreasonable NEs. One way to solve this problem is to solve the game backward, that is, to apply the principle of backward induction. We first consider node, and conclude that optimal decision is r. Then, we solve for the decision in node 1 given the decision previously found for node. Given that player will choose r, it is now clear that the optimal decision at node 1 is e. we thus select the first Nash equilibrium as the only one that is intuitively reasonable. Subgame perfect equilibrium Now think of that player chooses e at decision node 1. We are not led to player decision node but rather to an entire new game, a simultaneous-move game as in figure 4.5. Because
3 this game is part of the game, we call it a subgame of the larger one. In this setting, solving the game backward would amount to first solving for the Nash equilibrium of the subgame, and then given the solution for the subgame, solving for the entire game. Equilibria that are derived in this way are called subgame-perfect equilibria. In the game of figure 4.6, the equilibrium (e, r) was dismissed on the basis that ir requires player to make the incredible commitment of playing r in case player 1 chooses e. Such threat is not credible because, given that player 1 has chosen e, player s best choice is r. But suppose that player writes an enforceable and non renegotiable contract whereby, if player 1 chooses e, player chooses r. The contract is such that player were not to choose r and chose r instead, player would incur a penalty of 40, lowering its total payoff to -0. The situation is illustrated in figure 4.7. The first decision now belongs to player, who must choose between writing the bond described above (strategy b) and not doing anything (strategy b bar). If player chooses b, then the game in figure 4.6 is played. If instead player chooses b, then a different game is played, one that takes into account the implications of signing the bond. Let us solve the left-had subgame backward,. When it comes to player to choose between r and r, the optimal choice is r. in fact, this gives player a payoff of -10, whereas the alternative would yield -10 (player would have to pay for breaking the bond). Given that player chooses r, player 1 finds it optimal to choose e. It is better to receive a payoff of zero than to receive -10, the outcome of e followed by r. In summary, the subgame on the left-hand side gives player an equilibrium payoff of 50, the result of combination of is e and r. 3
4 We can finally move back to one more stage and look at player s optimal choice between b and b. From what saw above, player s optimal choice is to choose b and eventually receive a payoff of 50. The alternative, b, eventually leads to a payoff of 0 only. This example illustrates two important points: first it shows that a credible commitment may have significant strategic value. By signing a bond that imposes a large penalty when playing r, player credibly commits to playing r when the time comes to choose between r and r. In doing so, player induces player 1 to choose e, which in turn works for player s benefit. Specifically, introducing this credible commitment raises player s payoff from 0 to 50. The value of commitment is 30 in this example. Second, if we believe that player is credibly committed to choosing r, then we should model this by changing player s payoffs or by changing the order of moves. This can be done as in figure 4.8. (page 58) In this game, we model player as choosing r or r bar before player 1 chooses its strategy. The actual choice of r or r bar may occur in time after player 1 chooses e or e bar. However, if player precommits to playing r, we can model that by assuming player moves first. In fact, by solving the game in figure 4.8 backward, we get the same solution as in figure 4.7, namely the second Nash equilibrium of the game initially considered. 4
5 8. Stackelberg model of duopoly Stackelberg (1934) proposed a dynamic model of duopoly in which a dominant (or leader) firm moves first and a subordinate (a follower) firm moves second. At some points in the history of the U.S. automobile industry, for example, General Motors has seemed to play such a leadership role. It is straightforward to extend what follows to allow for more than one following firm, such as Ford, Chrysler, and so on. Following Stackelberg, we will develop the model under the assumption that the firms choose quantities, as in the Cournot model. The timing of the game is as follows: 1) firm 1 chooses a quantity q 1 >0; ) firm observes q 1 and then chooses a quantity q >=0; 3) the payoff to firm i is given by the profit function π i q i, q j = q i [p Q c] Where p(q)=a-q is the market-clearing price when the aggregate quantity on the market is Q=q 1 +q, and c is the constant marginal cost of production, fixed cost is zero. To solve for the backward-induction outcome of this game, we first compute firm s reaction to an arbitrary quantity by firm 1. R (q 1 ) solves max π q 1, q = max q [a q 1 q c] Which yields R q 1 = a q q c Provided q 1 <a-c. Since firm 1 can solve firm s problem as well as firm can solve it, firm should anticipate that the quantity choice q 1 will be met with reaction R q 1. Thus, firm 1 s problem in the first stage of the game amounts to a q 1 c max π 1 q 1, R q 1 = max q 1 a q 1 R q 1 c = max q 1, Which yields q a c a c 1 = and R q 1 = 4 As the backwards-induction outcome of the Stackelberg duopoly game. Recall we learned last class that in the Nash equilibrium of the Cournot game each firm produces (a-c)/3. Thus, aggregate quantity in the backwards-induction outcome of the Stackelberg game, 3(a-c)/4, is greater than aggregate quantity in the Nash equilibrium of the Cournot game, (a-c)/3, so the market-clearing price is lower in the Stackelberg game. In the Stackelberg game, however, firm 1 could have chosen its Cournot quantity, (a-c)/3, in which case firm would have responded with its Cournot quantity. Thus, in the Stackelberg, firm 1 could have achieved its Cournot profit level but chose to do otherwise, so firm 1 s profit in the Stackelberg game must exceed its profit in the Cournot game. But the market-clearing price is lower in the Stackelberg game, so aggregate profits are lower, so the fact that firm 1 is better off implies that firm is worse off in the Stackelberg than in the Cournot game. 5
6 The observation that firm does worse in the Stackelberg than in the Cournot game illustrates an important different between single-and multi-person decision problems. In single-person decision theory, having more information can never make the decision maker worse off. In game theory, however, having more information can make a player worse off. In the Stackelberg game, the information in question is firm 1 s quantity: firm know q1, and firm 1 knows that firm knows q1. To see the effect this information has, consider the modified sequential-move game in which firm 1 chooses q1, after which firm 1 chooses q but does so without observing q1. If firm believes that firm 1 has chosen its Stackelberg quantity q1*=(a-c)/, then firm s best response is again R (q 1 )=(a-c)/4. But if firm 1 anticipates that firm will hold this belief and so choose this quantity, the firm 1 prefers to choose its best response to (a-c)/4, rather than its Stackelberg quantity (a-c)/. Thus, firm should not believe that firm 1 has chosen its Stackelberg quantity. Rather, the unique Nash equilibrium of this modified sequential-move game is for both firms to choose the quantity (a-c)/3---precisely the Nash equilibrium of the Cournot game, where the firms move simultaneously. Thus, having firm 1 know that firm knows q1 hurts firm. 9. Repeated games A useful way to model the situation whereby players react to each other s strategic moves is to consider a repeated game. Consider a simultaneous-choice game like the one in figure 4.1. Because in this game each player chooses one action only once, we refer to it as a one-shot game. A repeated game is defined by a one-shot game which is repeated a number of times. In one-shot game, the strategy is easy to define. Like figure In this game, each player has three actions/strategies to choose from: T, M, B for player 1; and L, C, R for each player. Now suppose this one-shot game is repeated twice. In each period, player 1 still has three actions to choose from. However, the set of possible strategies for player 1 is now much more complex. A strategy for player 1 has to indicate what to choose in period 1 and what to 6
7 choose in period as a function of the actions that were taken in period 1. There are 9 possible outcomes in the first period, three possible actions in the second period, and three possible actions in the first period, player 1 has 3 times 3 to the power of 9, or 50,049 possible strategies. In the one-shot game, the Nash equilibria are (M,C) and (B,R). One first observation is that the repeated play of the equilibrium strategies of the one-shot game forms an equilibrium of the repeated game. For example, (M,C) in both periods is an equilibrium. This implicit strategies that lead to such equilibrium of the repeated game are, or player 1 choose M in period1 and choose M in period regardless what happened in period 1, and likewise for player. That is players choose history-independent strategies. Whether there are equlibria of the repeated game that do not correspond to equilibria of the one-shot game. Consider the following strategy for player 1: play T on period 1. In period, play M if period 1 actions were (T,L); otherwise, play B. As for player, take the following strategy: play L in period 1. In period, play C if period 1 actions were (T,L); otherwise play R. And check this is an equilibrium for this repeated game. 7
Sequential Games When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these
When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these settings, the assumption of sequential decision making is more realistic.
More informationECON 312: Games and Strategy 1. Industrial Organization Games and Strategy
ECON 312: Games and Strategy 1 Industrial Organization Games and Strategy A Game is a stylized model that depicts situation of strategic behavior, where the payoff for one agent depends on its own actions
More informationECON 301: Game Theory 1. Intermediate Microeconomics II, ECON 301. Game Theory: An Introduction & Some Applications
ECON 301: Game Theory 1 Intermediate Microeconomics II, ECON 301 Game Theory: An Introduction & Some Applications You have been introduced briefly regarding how firms within an Oligopoly interacts strategically
More informationCHAPTER LEARNING OUTCOMES. By the end of this section, students will be able to:
CHAPTER 4 4.1 LEARNING OUTCOMES By the end of this section, students will be able to: Understand what is meant by a Bayesian Nash Equilibrium (BNE) Calculate the BNE in a Cournot game with incomplete information
More informationBackward Induction and Stackelberg Competition
Backward Induction and Stackelberg Competition Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Backward Induction
More informationMicroeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016
Microeconomics II Lecture 2: Backward induction and subgame perfection Karl Wärneryd Stockholm School of Economics November 2016 1 Games in extensive form So far, we have only considered games where players
More informationEconomics 201A - Section 5
UC Berkeley Fall 2007 Economics 201A - Section 5 Marina Halac 1 What we learnt this week Basics: subgame, continuation strategy Classes of games: finitely repeated games Solution concepts: subgame perfect
More information14.12 Game Theory Lecture Notes Lectures 10-11
4.2 Game Theory Lecture Notes Lectures 0- Muhamet Yildiz Repeated Games In these notes, we ll discuss the repeated games, the games where a particular smaller game is repeated; the small game is called
More informationDYNAMIC GAMES. Lecture 6
DYNAMIC GAMES Lecture 6 Revision Dynamic game: Set of players: Terminal histories: all possible sequences of actions in the game Player function: function that assigns a player to every proper subhistory
More informationInternational Economics B 2. Basics in noncooperative game theory
International Economics B 2 Basics in noncooperative game theory Akihiko Yanase (Graduate School of Economics) October 11, 2016 1 / 34 What is game theory? Basic concepts in noncooperative game theory
More information1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1
Chapter 1 Introduction Game Theory is a misnomer for Multiperson Decision Theory. It develops tools, methods, and language that allow a coherent analysis of the decision-making processes when there are
More informationGame Theory -- Lecture 6. Patrick Loiseau EURECOM Fall 2016
Game Theory -- Lecture 6 Patrick Loiseau EURECOM Fall 06 Outline. Stackelberg duopoly and the first mover s advantage. Formal definitions 3. Bargaining and discounted payoffs Outline. Stackelberg duopoly
More informationChapter 13. Game Theory
Chapter 13 Game Theory 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 friend coolly replies, I don
More informationDynamic Games of Complete Information
Dynamic Games of Complete Information Dynamic Games of Complete and Perfect Information F. Valognes - Game Theory - Chp 13 1 Outline of dynamic games of complete information Dynamic games of complete information
More informationThe Mother & Child Game
BUS 4800/4810 Game Theory Lecture Sequential Games and Credible Threats Winter 2008 The Mother & Child Game Child is being BD Moms responds This is a Sequential Game 1 Game Tree: This is the EXTENDED form
More informationSequential games. Moty Katzman. November 14, 2017
Sequential games Moty Katzman November 14, 2017 An example Alice and Bob play the following game: Alice goes first and chooses A, B or C. If she chose A, the game ends and both get 0. If she chose B, Bob
More informationThe extensive form representation of a game
The extensive form representation of a game Nodes, information sets Perfect and imperfect information Addition of random moves of nature (to model uncertainty not related with decisions of other players).
More informationECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept
CLASSIFICATION ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES Sequential Games Simultaneous Representation Tree Matrix Equilibrium concept Rollback (subgame
More informationGames in Extensive Form, Backward Induction, and Subgame Perfection:
Econ 460 Game Theory Assignment 4 Games in Extensive Form, Backward Induction, Subgame Perfection (Ch. 14,15), Bargaining (Ch. 19), Finitely Repeated Games (Ch. 22) Games in Extensive Form, Backward Induction,
More informationAppendix A A Primer in Game Theory
Appendix A A Primer in Game Theory This presentation of the main ideas and concepts of game theory required to understand the discussion in this book is intended for readers without previous exposure to
More informationGame Theory. Wolfgang Frimmel. Subgame Perfect Nash Equilibrium
Game Theory Wolfgang Frimmel Subgame Perfect Nash Equilibrium / Dynamic games of perfect information We now start analyzing dynamic games Strategic games suppress the sequential structure of decision-making
More informationStrategies and Game Theory
Strategies and Game Theory Prof. Hongbin Cai Department of Applied Economics Guanghua School of Management Peking University March 31, 2009 Lecture 7: Repeated Game 1 Introduction 2 Finite Repeated Game
More informationExtensive Form Games. Mihai Manea MIT
Extensive Form Games Mihai Manea MIT Extensive-Form Games N: finite set of players; nature is player 0 N tree: order of moves payoffs for every player at the terminal nodes information partition actions
More informationGame Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).
Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized
More informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationGame Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.
Game Theory 44812 (1393-94 2 nd term) Dr. S. Farshad Fatemi Graduate School of Management and Economics Sharif University of Technology Spring 2015 Dr. S. Farshad Fatemi (GSME) Game Theory Spring 2015
More informationDynamic Games: Backward Induction and Subgame Perfection
Dynamic Games: Backward Induction and Subgame Perfection Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 22th, 2017 C. Hurtado (UIUC - Economics)
More informationNon-Cooperative Game Theory
Notes on Microeconomic Theory IV 3º - LE-: 008-009 Iñaki Aguirre epartamento de Fundamentos del Análisis Económico I Universidad del País Vasco An introduction to. Introduction.. asic notions.. Extensive
More information8.F The Possibility of Mistakes: Trembling Hand Perfection
February 4, 2015 8.F The Possibility of Mistakes: Trembling Hand Perfection back to games of complete information, for the moment refinement: a set of principles that allow one to select among equilibria.
More informationFebruary 11, 2015 :1 +0 (1 ) = :2 + 1 (1 ) =3 1. is preferred to R iff
February 11, 2015 Example 60 Here s a problem that was on the 2014 midterm: Determine all weak perfect Bayesian-Nash equilibria of the following game. Let denote the probability that I assigns to being
More informationGame Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati
Game Theory and Economics Prof. Dr. Debarshi Das Humanities and Social Sciences Indian Institute of Technology, Guwahati Module No. # 05 Extensive Games and Nash Equilibrium Lecture No. # 03 Nash Equilibrium
More informationRepeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)
Repeated Games Economics 302 - Microeconomic Theory II: Strategic Behavior Shih En Lu Simon Fraser University (with thanks to Anke Kessler) ECON 302 (SFU) Repeated Games 1 / 25 Topics 1 Information Sets
More informationLecture 9. General Dynamic Games of Complete Information
Lecture 9. General Dynamic Games of Complete Information Till now: Simple dynamic games and repeated games Now: General dynamic games but with complete information (for dynamic games with incomplete information
More informationIntroduction to Game Theory
Introduction to Game Theory Part 2. Dynamic games of complete information Chapter 4. Dynamic games of complete but imperfect information Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas
More informationGame Theory for Strategic Advantage Alessandro Bonatti MIT Sloan
Game Theory for Strategic Advantage 15.025 Alessandro Bonatti MIT Sloan Look Forward, Think Back 1. Introduce sequential games (trees) 2. Applications of Backward Induction: Creating Credible Threats Eliminating
More informationEconS Representation of Games and Strategies
EconS 424 - Representation of Games and Strategies Félix Muñoz-García Washington State University fmunoz@wsu.edu January 27, 2014 Félix Muñoz-García (WSU) EconS 424 - Recitation 1 January 27, 2014 1 /
More informationGames in Extensive Form
Games in Extensive Form the extensive form of a game is a tree diagram except that my trees grow sideways any game can be represented either using the extensive form or the strategic form but the extensive
More informationIntroduction to Game Theory I
Nicola Dimitri University of Siena (Italy) Rome March-April 2014 Introduction to Game Theory 1/3 Game Theory (GT) is a tool-box useful to understand how rational people choose in situations of Strategic
More informationTopic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition
SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one
More informationChapter 30: Game Theory
Chapter 30: Game Theory 30.1: Introduction We have now covered the two extremes perfect competition and monopoly/monopsony. In the first of these all agents are so small (or think that they are so small)
More information4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction
1 Intermediate Microeconomics W3211 ecture 20: Game Theory 2 Introduction Columbia University, Spring 2016 Mark Dean: mark.dean@columbia.edu 2 The Story So Far. 3 Today 4 ast lecture we began to study
More informationLecture 7. Repeated Games
ecture 7 epeated Games 1 Outline of ecture: I Description and analysis of finitely repeated games. Example of a finitely repeated game with a unique equilibrium A general theorem on finitely repeated games.
More informationLecture 5: Subgame Perfect Equilibrium. November 1, 2006
Lecture 5: Subgame Perfect Equilibrium November 1, 2006 Osborne: ch 7 How do we analyze extensive form games where there are simultaneous moves? Example: Stage 1. Player 1 chooses between fin,outg If OUT,
More informationLecture 24. Extensive-Form Dynamic Games
Lecture 4. Extensive-orm Dynamic Games Office Hours this week at usual times: Tue 5:5-6:5, ri - Practice inal Exam available on course website. A Graded Homework is due this Thursday at 7pm. EC DD & EE
More informationGames of Perfect Information and Backward Induction
Games of Perfect Information and Backward Induction Economics 282 - Introduction to Game Theory Shih En Lu Simon Fraser University ECON 282 (SFU) Perfect Info and Backward Induction 1 / 14 Topics 1 Basic
More informationDynamic games: Backward induction and subgame perfection
Dynamic games: Backward induction and subgame perfection ectures in Game Theory Fall 04, ecture 3 0.0.04 Daniel Spiro, ECON300/400 ecture 3 Recall the extensive form: It specifies Players: {,..., i,...,
More informationExtensive Form Games and Backward Induction
Recap Subgame Perfection ackward Induction Extensive Form ames and ackward Induction ISCI 330 Lecture 3 February 7, 007 Extensive Form ames and ackward Induction ISCI 330 Lecture 3, Slide Recap Subgame
More information(a) Left Right (b) Left Right. Up Up 5-4. Row Down 0-5 Row Down 1 2. (c) B1 B2 (d) B1 B2 A1 4, 2-5, 6 A1 3, 2 0, 1
Economics 109 Practice Problems 2, Vincent Crawford, Spring 2002 In addition to these problems and those in Practice Problems 1 and the midterm, you may find the problems in Dixit and Skeath, Games of
More informationComputational Methods for Non-Cooperative Game Theory
Computational Methods for Non-Cooperative Game Theory What is a game? Introduction A game is a decision problem in which there a multiple decision makers, each with pay-off interdependence Each decisions
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 The Story So Far... Last week we Introduced the concept of a dynamic (or extensive form) game The strategic (or normal) form of that game In terms of solution concepts
More informationfinal examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:
The final examination on May 31 may test topics from any part of the course, but the emphasis will be on topic after the first three homework assignments, which were covered in the midterm. Topics from
More informationReading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.
Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992. Additional readings could be assigned from time to time. They are an integral part of the class and you are expected to read
More informationMS&E 246: Lecture 15 Perfect Bayesian equilibrium. Ramesh Johari
MS&E 246: ecture 15 Perfect Bayesian equilibrium amesh Johari Dynamic games In this lecture, we begin a study of dynamic games of incomplete information. We will develop an analog of Bayesian equilibrium
More informationSession Outline. Application of Game Theory in Economics. Prof. Trupti Mishra, School of Management, IIT Bombay
36 : Game Theory 1 Session Outline Application of Game Theory in Economics Nash Equilibrium It proposes a strategy for each player such that no player has the incentive to change its action unilaterally,
More information1 Game Theory and Strategic Analysis
Page 1 1 Game Theory and Strategic Analysis 11. 12. 13. 14. Static Games and Nash Equilibrium Imperfect Competition Explicit and Implicit Cooperation Strategic Commitment (a) Sequential games and backward
More informationResource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory
Resource Allocation and Decision Analysis (ECON 8) Spring 4 Foundations of Game Theory Reading: Game Theory (ECON 8 Coursepak, Page 95) Definitions and Concepts: Game Theory study of decision making settings
More informationGames. Episode 6 Part III: Dynamics. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto
Games Episode 6 Part III: Dynamics Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Dynamics Motivation for a new chapter 2 Dynamics Motivation for a new chapter
More informationTHEORY: NASH EQUILIBRIUM
THEORY: NASH EQUILIBRIUM 1 The Story Prisoner s Dilemma Two prisoners held in separate rooms. Authorities offer a reduced sentence to each prisoner if he rats out his friend. If a prisoner is ratted out
More informationEconS 424- Strategy and Game Theory Reputation and Incomplete information in a public good project How to nd Semi-separating equilibria?
EconS 424- Strategy and Game Theory Reputation and Incomplete information in a public good project How to nd Semi-separating equilibria? April 14, 2014 1 A public good game Let us consider the following
More informationECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly
ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly Relevant readings from the textbook: Mankiw, Ch. 17 Oligopoly Suggested problems from the textbook: Chapter 17 Questions for
More informationExtensive Games with Perfect Information. Start by restricting attention to games without simultaneous moves and without nature (no randomness).
Extensive Games with Perfect Information There is perfect information if each player making a move observes all events that have previously occurred. Start by restricting attention to games without simultaneous
More informationLecture 13(ii) Announcements. Lecture on Game Theory. None. 1. The Simple Version of the Battle of the Sexes
Lecture 13(ii) Announcements None Lecture on Game Theory 1. The Simple Version of the Battle of the Sexes 2. The Battle of the Sexes with Some Strategic Moves 3. Rock Paper Scissors 4. Chicken 5. Duopoly
More informationNORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form
1 / 47 NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch March 19, 2018: Lecture 5 2 / 47 Plan Normal form
More informationState Trading Companies, Time Inconsistency, Imperfect Enforceability and Reputation
State Trading Companies, Time Inconsistency, Imperfect Enforceability and Reputation Tigran A. Melkonian and S.R. Johnson Working Paper 98-WP 192 April 1998 Center for Agricultural and Rural Development
More informationDECISION MAKING GAME THEORY
DECISION MAKING GAME THEORY THE PROBLEM Two suspected felons are caught by the police and interrogated in separate rooms. Three cases were presented to them. THE PROBLEM CASE A: If only one of you confesses,
More informationU strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.
Problem Set 3 (Game Theory) Do five of nine. 1. Games in Strategic Form Underline all best responses, then perform iterated deletion of strictly dominated strategies. In each case, do you get a unique
More informationImperfect Information Extensive Form Games
Imperfect Information Extensive Form Games ISCI 330 Lecture 15 March 6, 2007 Imperfect Information Extensive Form Games ISCI 330 Lecture 15, Slide 1 Lecture Overview 1 Recap 2 Imperfect Information Extensive
More informationGame Theory. Wolfgang Frimmel. Dominance
Game Theory Wolfgang Frimmel Dominance 1 / 13 Example: Prisoners dilemma Consider the following game in normal-form: There are two players who both have the options cooperate (C) and defect (D) Both players
More informationBackward Induction. ISCI 330 Lecture 14. March 1, Backward Induction ISCI 330 Lecture 14, Slide 1
ISCI 330 Lecture 4 March, 007 ISCI 330 Lecture 4, Slide Lecture Overview Recap ISCI 330 Lecture 4, Slide Subgame Perfection Notice that the definition contains a subtlety. n agent s strategy requires a
More informationRationality and Common Knowledge
4 Rationality and Common Knowledge In this chapter we study the implications of imposing the assumptions of rationality as well as common knowledge of rationality We derive and explore some solution concepts
More informationExtensive Form Games: Backward Induction and Imperfect Information Games
Extensive Form Games: Backward Induction and Imperfect Information Games CPSC 532A Lecture 10 October 12, 2006 Extensive Form Games: Backward Induction and Imperfect Information Games CPSC 532A Lecture
More informationCSCI 699: Topics in Learning and Game Theory Fall 2017 Lecture 3: Intro to Game Theory. Instructor: Shaddin Dughmi
CSCI 699: Topics in Learning and Game Theory Fall 217 Lecture 3: Intro to Game Theory Instructor: Shaddin Dughmi Outline 1 Introduction 2 Games of Complete Information 3 Games of Incomplete Information
More informationGAME THEORY: STRATEGY AND EQUILIBRIUM
Prerequisites Almost essential Game Theory: Basics GAME THEORY: STRATEGY AND EQUILIBRIUM MICROECONOMICS Principles and Analysis Frank Cowell Note: the detail in slides marked * can only be seen if you
More informationLecture #3: Networks. Kyumars Sheykh Esmaili
Lecture #3: Game Theory and Social Networks Kyumars Sheykh Esmaili Outline Games Modeling Network Traffic Using Game Theory Games Exam or Presentation Game You need to choose between exam or presentation:
More informationGame Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)
Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Extensive Form Game I It uses game tree to represent the games.
More informationModeling Strategic Environments 1 Extensive form games
Modeling Strategic Environments 1 Extensive form games Watson 2, pages 11-23 Bruno Salcedo The Pennsylvania State University Econ 42 Summer 212 Extensive form games In order to fully describe a strategic
More informationEcon 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016
Econ 302: Microeconomics II - Strategic Behavior Problem Set #5 June13, 2016 1. T/F/U? Explain and give an example of a game to illustrate your answer. A Nash equilibrium requires that all players are
More informationGame Theory. 6 Dynamic Games with imperfect information
Game Theory 6 Dynamic Games with imperfect information Review of lecture five Game tree and strategies Dynamic games of perfect information Games and subgames ackward induction Subgame perfect Nash equilibrium
More informationECON 282 Final Practice Problems
ECON 282 Final Practice Problems S. Lu Multiple Choice Questions Note: The presence of these practice questions does not imply that there will be any multiple choice questions on the final exam. 1. How
More informationDomination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown
Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in
More informationMicroeconomics of Banking: Lecture 4
Microeconomics of Banking: Lecture 4 Prof. Ronaldo CARPIO Oct. 16, 2015 Administrative Stuff Homework 1 is due today at the end of class. I will upload the solutions and Homework 2 (due in two weeks) later
More information1 Simultaneous move games of complete information 1
1 Simultaneous move games of complete information 1 One of the most basic types of games is a game between 2 or more players when all players choose strategies simultaneously. While the word simultaneously
More informationBehavioral Strategies in Zero-Sum Games in Extensive Form
Behavioral Strategies in Zero-Sum Games in Extensive Form Ponssard, J.-P. IIASA Working Paper WP-74-007 974 Ponssard, J.-P. (974) Behavioral Strategies in Zero-Sum Games in Extensive Form. IIASA Working
More informationEconS Backward Induction and Subgame Perfection
EconS 424 - Backward Induction and Subgame Perfection Félix Muñoz-García Washington State University fmunoz@wsu.edu March 24, 24 Félix Muñoz-García (WSU) EconS 424 - Recitation 5 March 24, 24 / 48 Watson,
More informationIntroduction Economic Models Game Theory Models Games Summary. Syllabus
Syllabus Contact: kalk00@vse.cz home.cerge-ei.cz/kalovcova/teaching.html Office hours: Wed 7.30pm 8.00pm, NB339 or by email appointment Osborne, M. J. An Introduction to Game Theory Gibbons, R. A Primer
More informationLecture 11 Strategic Form Games
Lecture 11 Strategic Form Games Jitesh H. Panchal ME 597: Decision Making for Engineering Systems Design Design Engineering Lab @ Purdue (DELP) School of Mechanical Engineering Purdue University, West
More informationEconomics of Strategy (ECON 4550) Maymester 2015 Foundations of Game Theory
Economics of Strategy (ECON 4550) Maymester 05 Foundations of Game Theory Reading: Game Theory (ECON 4550 Courseak, Page 95) Definitions and Concets: Game Theory study of decision making settings in which
More informationMultiagent Systems: Intro to Game Theory. CS 486/686: Introduction to Artificial Intelligence
Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent
More informationRepeated games. Felix Munoz-Garcia. Strategy and Game Theory - Washington State University
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
More informationINSTRUCTIONS: all the calculations on the separate piece of paper which you do not hand in. GOOD LUCK!
INSTRUCTIONS: 1) You should hand in ONLY THE ANSWERS ASKED FOR written clearly on this EXAM PAPER. You should do all the calculations on the separate piece of paper which you do not hand in. 2) Problems
More informationRefinements of Sequential Equilibrium
Refinements of Sequential Equilibrium Debraj Ray, November 2006 Sometimes sequential equilibria appear to be supported by implausible beliefs off the equilibrium path. These notes briefly discuss this
More informationExtensive-Form Games with Perfect Information
Extensive-Form Games with Perfect Information Yiling Chen September 22, 2008 CS286r Fall 08 Extensive-Form Games with Perfect Information 1 Logistics In this unit, we cover 5.1 of the SLB book. Problem
More informationSome introductory notes on game theory
APPENDX Some introductory notes on game theory The mathematical analysis in the preceding chapters, for the most part, involves nothing more than algebra. The analysis does, however, appeal to a game-theoretic
More informationIntroduction to Game Theory
Introduction to Game Theory Part 1. Static games of complete information Chapter 1. Normal form games and Nash equilibrium Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe
More informationMohammad Hossein Manshaei 1394
Mohammad Hossein Manshaei manshaei@gmail.com 394 Some Formal Definitions . First Mover or Second Mover?. Zermelo Theorem 3. Perfect Information/Pure Strategy 4. Imperfect Information/Information Set 5.
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationChapter 7, 8, and 9 Notes
Chapter 7, 8, and 9 Notes These notes essentially correspond to parts of chapters 7, 8, and 9 of Mas-Colell, Whinston, and Green. We are not covering Bayes-Nash Equilibria. Essentially, the Economics Nobel
More informationIntroduction to Game Theory
Introduction to Game Theory Lecture 2 Lorenzo Rocco Galilean School - Università di Padova March 2017 Rocco (Padova) Game Theory March 2017 1 / 46 Games in Extensive Form The most accurate description
More informationSF2972 GAME THEORY Normal-form analysis II
SF2972 GAME THEORY Normal-form analysis II Jörgen Weibull January 2017 1 Nash equilibrium Domain of analysis: finite NF games = h i with mixed-strategy extension = h ( ) i Definition 1.1 Astrategyprofile
More informationAn Application of Game Theory to Electronic Communications Markets *
An Application of Game Theory to Electronic Communications Markets * Bernhard von Stengel London School of Economics November 2011 This article gives an introductory survey of non-cooperative game theory.
More information