Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory

Size: px
Start display at page:

Download "Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Game Theory"

Transcription

1 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 in which the outcome for each decision maker depends upon not only their own actions, but also upon the actions of other decision makers Within economics, Game Theory is very useful for analyzing the behavior of firms in the intermediate market structures between Monopoly and Perfect Competition Pioneered by John von-neumann and Oskar Morgenstern s book Theory of Games and Economic Behavior (944) Three basic elements of any game:. Players decision makers whose behavior is to be analyzed. Strategies the different options or courses of action from which a player is able to choose 3. Payoffs numerical measures of the desirability of every possible outcome which could arise as a result of the strategies chosen by the players Complete Information an environment in which every player knows all of the strategies available to all players and the resulting payoff for all players at each possible outcome Incomplete Information an environment in which at least one of the players does not know all of the information that would be potentially relevant for making a decision at some point in the game e.g., perhaps the other player can be of one of two different types, and I don t know for certain which type he is Sequential Move Game a game in which players make their decisions in sequence, with the choices made in the past being observable by all players when a present decision is being made Simultaneous Move Game a game in which players must each choose their strategies without being able to observe the strategy chosen by others (either the players choose their strategies at the same time, or it is as if they choose them at the same time) One-Shot Game a game that is played between the same players only one time Repeated Game a game that is played between the same players more than one time

2 Cooperative Game a game in which players can enter into binding agreements before the start of the game Non-Cooperative Game a game in which players cannot enter into binding agreements before the start of the game Nash Equilibrium a set of strategies, one for each player, that are stable in the sense that no player could increase his own payoff by choosing a different strategy, given the strategies chosen by the other players very often, a Nash Equilibrium will serve as a reasonable prediction of play, since at the equilibrium strategies every player is behaving in a way that is in his own self-interest (given the behavior of others) Named after the game theorist John F. Nash, Jr. (994 Nobel Prize in Economics) Best Reply for Player a strategy is a best reply to a chosen strategy of Player if the strategy in question gives Player a greater payoff than any other available strategy Note: a set of strategies is a Nash Equilibrium if and only if each player is choosing a strategy that is a best reply to the strategies being played by others Dominant Strategy for Player a strategy is a dominant strategy if it is (strictly) a best reply to all available strategies of Player Strategic Rule of Thumb # if you have a dominant strategy, use it Dominated Strategy for Player a strategy is a dominated strategy there is some other available strategy that gives Player a (strictly) higher payoff than the strategy in question, for all available strategies of Player Strategic Rule of Thumb # if you have a dominated strategy, do not use it Strategic Rule of Thumb #3 if your rival has a dominant strategy, expect her to use it Strategic Rule of Thumb #4 if your rival has a dominated strategy, expect her to never use it Prisoner s Dilemma a game in which every player has a dominant strategy (so that the game has a unique equilibrium characterized by all players using their dominant strategies), but in which there is some other outcome at which the payoff of every single player is higher than the equilibrium payoff Mixed Extension of a Game an interpretation of a game in which the strategy choice of a player is allowed to be a probability distribution over their available pure strategies Nash s Existence Theorem for every game with any finite number of players, each with a finite number of available pure strategies, there exists at least one Nash Equilibrium (potentially in mixed strategies )

3 A simple x game in which each player has a dominant strategy Firm A Firm B High Price B Low Price B High Price A, 8 6, 96 Low Price A 44, 4 84, 56 In each cell the first number specifies the payoff of player (the player whose strategies are specified by each distinct row) and the second number specifies the payoff of player (the player whose strategies are specified by each distinct column) Each player gets to choose their own strategy, but has no control over the strategy chosen by their rival (i.e., player gets to choose the row, while player gets to choose the column ) To identify a Nash Equilibrium, we must systematically address the question What should each player do? Let us first examine the choice of Firm A Firm A has no control over the choice of Firm B, and further Firm A does not know what Firm B will necessarily do, but However, Firm A could determine what its own best choice would be for each of the things Firm B could possibly do Further (if necessary), Firm A could also try to figure out what Firm B will do (based upon what is best for Firm B to do ) From the perspective of Firm A If Firm B were to choose High Price B, then Firm A would want to choose Low Price A, since 44 If Firm B were to choose Low Price B, then Firm A would want to choose Low Price A, since In this game, for Firm A : Low Price A is a best reply to a choice of High Price by Firm B Low Price A is a best reply to a choice of Low Price by Firm B Low Price A is a best reply to anything B can do Note that Firm B also has a dominant strategy. From the perspective of Firm B If Firm A were to choose High Price A, then Firm B would want to choose Low Price B, since 96 8 If Firm A were to choose Low Price A, then Firm B would want to choose Low Price B, since 56 4 Firm B High Price B Low Price B High Price A, 8 6, 96 Firm A Low Price A 44, 4 84, 56 The unique Nash Equilibrium is for Firm A to choose Low Price A and for Firm B to choose Low Price B. As a result, Firm A realizes a payoff of (84) and Firm B realizes a payoff of (56)

4 A simple x game in which only one player has a dominant strategy Firm A Firm B High Price B Low Price B High Price A 5, 5 96, 64 Low Price A 5, 38 5, 35 Drawing the Best Reply arrows : Firm B High Price B Low Price B High Price A 5, 5 96, 64 Firm A Low Price A 5, 38 5, 35 By either Strategic Rule of Thumb # or # we see that Firm A should choose Low Price. But, what should Firm B do? Strategic Rule of Thumb #3 if your rival has a dominant strategy, expect her to use it Strategic Rule of Thumb #4 if your rival has a dominated strategy, expect her to never use it Thus, Firm B should choose High Price => the unique Nash Equilibrium is: Firm A Firm B High Price B Low Price B High Price A 5, 5 96, 64 Low Price A 5, 38 5, 35

5 Two examples of product development decisions: Example 3: ( anti-coordination game ) Volkswagen and Ford must each decide to either develop or not develop a new compact hybrid car Suppose the payoffs are: Ford Develop Hybrid Not Develop Develop Hybrid, 95, VW Not Develop 5, 5 85, 9 Start by recognizing that, for the given payoffs, neither player has a dominant strategy Ford Develop Hybrid Not Develop Develop Hybrid, 95, VW Not Develop 5, 5 85, 9 There are two Pure Strategy Nash Equilibria (one in which VW develops the hybrid and Ford does not, and another in which Ford develops the hybrid and VW does not) Mixed Extension: Let q denote the probability with which VW chooses Develop (so that q denotes the probability with which VW chooses Not Develop ) Let p denote the probability with which Ford chooses Develop (so that p denotes the probability with which Ford chooses Not Develop ) Deriving the Best Response Correspondence for VW, see that Develop (i.e., q ) is the strictly better choice if and only if ( p) ( p) 5( p) 85( p) 35( p) 5 p 35 7 p Similarly, deriving the Best Reply Correspondence for Ford, recognize that Develop (i.e., p ) is the strictly better choice if and only if 95( q) 5( q) ( q) 9( q) 5( q) 5q 5 3 q. 75 4

6 Visually q BR T ( p).75 p BR F (q).875 The graph above illustrates all three equilibria of this game: i. Pure Strategy Nash Equilibrium in which VW chooses Develop and Ford chooses Not Develop ( q and p ) ii. Pure Strategy Nash Equilibrium in which VW chooses Not Develop and Ford chooses Develop ( q and p ) iii. Mixed Strategy Nash Equilibrium in which VW chooses Develop with probability q.75 and Ford chooses Develop with probability p. 875 Example 4: ( cat and mouse game ) Suppose Lexus and Hyundai must choose a design for their model, either sleek or boxy Hyundai wants their car to look like the Lexus, while Lexus wants their car to look different than the Hyundai Hyundai Sleek Hyundai Boxy Hyundai Sleek Lexus 6, 4, 9 Lexus Boxy Lexus 7, 3, No Pure Strategy Nash Equilibrium => consider the Mixed Extension of the game Let q denote the probability with which Hyundai chooses Sleek (so that q denotes the probability with which Hyundai chooses Boxy ) Let p denote the probability with which Lexus chooses Sleek (so that p denotes the probability with which Lexus chooses Boxy ) Deriving the Best Response Correspondence for Hyundai, recognize that Sleek (i.e., q ) is the strictly better choice if and only if 4( p) ( p) 9( p) ( p) 5 p ( p) p.6 6 6

7 Similarly, deriving the Best Reply Correspondence for Lexus, recognize that Sleek (i.e., p ) is the strictly better choice if and only if 6( q) ( q) 7( q) 3( q) 7( q) q 7 7 q. 875 Visually q 8 8 BR H ( p) p BR L (q) The graph above illustrates the unique equilibrium of this game => a Mixed Strategy Nash 7 Equilibrium in which Hyundai chooses Sleek with probability q 8 and Lexus chooses Sleek with probability p 6

8 Another example of Determining a Mixed Strategy Equilibrium: Consider the following game: Player Left Right Player Top 4, 7, Bottom 6, 3, 5 This game does not have any Pure Strategy Nash Equilibria Consider the Mixed Extension of the game, in which q denotes the probability with which Player chooses Left (so that q denotes the probability with which Player chooses Right ) p denotes the probability with which Player chooses Top (so that p denotes the probability with which Player chooses Bottom ) Derive and graphically illustrate the Best Reply Correspondence for each player Consider the choice by Player when Player chooses Left with probability q and Right with probability q T Player s expected payoff from choosing Top is: 4q ( q) 6q B Player s expected payoff from choosing Bottom is: 6q ( q) 4q Thus, Player s payoff is strictly greater from choosing Top as opposed to Bottom (in which case his best reply is p ) if and only if 8 q. 8 T B Further, Player s payoff is strictly greater from choosing Bottom as opposed to Top (in which case his best reply is p ) if and only if q. 8 Finally, Player would realize the exact same expected payoff from choosing Top, Bottom, or any randomization between the two (in which case any value of p is a best reply ) if and only if q. 8 Visually, the Best Reply Correspondence of Player can be illustrated as:.8 q 5 4 BR ( q ) Similarly, considering the choice by Player when Player chooses Top with probability p and Bottom with probability p L Player s expected payoff from choosing Left is: 7 p 3( p) 3 4 p R p 5( p) 5 Player s expected payoff from choosing Right is: 4 p p

9 Thus, Player s payoff is strictly greater from choosing Left as opposed to Right (in which case his best reply is q ) if and only if L R p Further, Player s payoff is strictly greater from choosing Right as opposed to Left (in which case his best reply is q ) if and only if p. 5 Finally, Player would realize the exact same expected payoff from choosing Left, Right, or any randomization between the two (in which case any value of q is a best reply ) if and only if p. 5 Visually, the Best Reply Correspondence of Player can be illustrated as: q BR ( p).5 Drawing the two correspondences in the same graph, we have: p q BR ( p).8.5 p BR ( q ) If Player chooses p *. 5 and Player chooses q *. 8, then each player is choosing a mixed strategy that is a best reply to the strategy being played by his rival => this pair of mixed strategies is a Nash Equilibrium!

10 Multiple Choice Questions:. Consider a two player game between Player and Player. Player has two available strategies: Strategy A and Strategy B. Player has two available strategies: Strategy c and Strategy d. If Strategy A of Player is a Best Reply to a choice of Strategy c by Player, then A. Strategy A cannot be a dominant strategy for Player. B. Strategy B cannot be a dominant strategy for Player. C. Player must use Strategy A at any Nash Equilibrium of the game. D. More than one (perhaps all) of the above answers is correct.. Which of the following statements corresponds to one of the decision making rules of thumb discussed in lecture? A. If you have a dominant strategy, use it. B. If your rival has a dominant strategy, expect her to never use it. C. If you have a dominant strategy, recognize that your rival will expect that you will never use it. D. More than one (perhaps all) of the above answers is correct. 3. Which of the following is NOT one of the three basic elements of a game? A. Players. B. Rules of the Game. C. Strategies. D. More than one of the above answers is correct (since more than one of the above is NOT one of the three basic elements of a game ). 4. In a simultaneous move game with two players, it must always be the case that A. the sum of the payoffs of both players is maximized at an outcome that is a Nash Equilibrium. B. the sum of the payoffs of both players is minimized at an outcome that is a Nash Equilibrium. C. there is at least one Nash Equilibrium (potentially in mixed strategies ). D. More than one (perhaps all) of the above answers is correct. 5. A game that is played between the same players more than one time is called a A. One-Shot Game. B. Repeated Game. C. Game of Incomplete Information. D. Game of Complete Information. 6. In the Mixed Extension of a game, A. the strategy chosen by each of your rivals should be viewed as entirely random. B. the strategy choice of each player is allowed to be a probability distribution over his available pure strategies. C. there can never be any Nash Equilibria. D. players are never allowed to play Pure Strategies.

11 7. Nash s Existence Theorem states that A. individuals can only every overcome a Prisoners Dilemma by repeated interaction. B. the unique equilibrium of any simultaneous move game can be determined by Iterated Elimination of Dominated Strategies. C. the unique Subgame Perfect Nash Equilibrium of any sequential move game can be determined by backward induction. D. every game with a finite number of players, each with a finite number of available pure strategies, has at least one Nash Equilibrium (potentially in Mixed Strategies ). 8. The pioneering work Theory of Games and Economic Behavior was written by A. Adam Smith. B. John F. Nash, Jr. and Lloyd Shapley. C. John Maynard Keynes. D. John von-neumann and Oskar Morgenstern. 9. A refers to a game in which every player has a dominant strategy (so that the game has a unique equilibrium characterized by all players using their dominant strategies), but in which there is some other outcome at which the payoff of every single player is higher than their equilibrium payoff. A. Cat and Mouse Game B. Prisoners Dilemma C. repeated game D. Best Reply Correspondence Problem Solving or Short Answer Questions:. Determine all Nash Equilibria of each of the following games. A. Player Top 3,, Player Bottom, 4, 5 B. Player Player Top 4, 9, 5 Bottom, 7, 3

12 . For each of the following games, determine if either player has a Dominant Strategy and identify all Pure Strategy Nash Equilbria. A. Player Top, 5, 3 Player Bottom 8, 7 6, B. C. D. Player Player Player Player Top, 5 6, 9 Bottom 8, 4, 3 Player Top, 5 4, Bottom 6,, 5 Player Top 3, 5, 35 Bottom, 45 4, 5 3. Consider the player simultaneous move game below: Player Player Top 8, 65 5, 45 Bottom 7, 75 35, 55 3A. Does this game fit the definition of a Prisoner s Dilemma? Clearly explain why or why not. 3B. Determine all Nash Equilibria of this game.

13 4. Golden Fleece and JonShawn are two firms that produce men s clothing. They must simultaneously choose their product lines for next year. They each broadly have a choice of either a traditional line or a trendy line. Historically, the clothing of Golden Fleece has tended to appeal to consumers with conservative tastes, while the clothing of JonShawn has tended to appeal to those consumers who want to be on the cutting edge of fashion. If the two firms choose similar lines, then their products will be less differentiated from one another. As a result, they would be competing for essentially the same segment of consumers, making joint profits lower. More precisely, the profits of the firms will be: GF 95 and JS 7, if both introduce a traditional line ; GF 85 and JS, if both introduce a trendy line ; GF 55 and JS, if Golden Fleece introduces a Trendy line and JonShawn introduces a traditional line ; and GF 85 and JS, if Golden Fleece introduces a traditional line and JonShawn introduces a trendy line. 4A. Illustrate the interaction between these two firms by way of a payoff matrix. 4B. Identify all Pure Strategy Nash Equilibria of this game. 4C. Considering the Mixed Extension of the game (in which Golden Fleece chooses traditional line with probability p and JonShawn chooses traditional line with probability q ), graphically illustrate the Best Reply Correspondence of each player. Based upon this graph, identify any Mixed Strategy Nash Equilibria of this game. 5. Consider the following two player simultaneous move game: Player Player Top a, b, Bottom, c, d Specify values of a, b, c, and d for which: 5A. Top is a dominant strategy for Player and Left is a dominant strategy for Player. 5B. neither player has a dominant strategy and there are no Pure Strategy Equilibria. 5C. neither player has a dominant strategy and there are two Pure Strategy Equilibria. 5D. there are no Pure Strategy Equilibria and the unique Mixed Strategy Equilibrium is characterized by Player choosing Top with probability 5 and Player choosing Left with probability 3.

14 Answers to Multiple Choice Questions:. B. A 3. B 4. C 5. B 6. B 7. D 8. D 9. B Answers to Problem Solving or Short Answer Questions: A. This game has two Pure Strategy Nash Equilibria as follows: Player Top 3,, Player Bottom, 4, 5 Additionally, letting p denote the probability with which Player plays Top and letting q denote the probability with which Player plays Left, a Mixed Strategy Nash Equilibrium can be determined as: T B 3q ( q) q ( q) q q * and L R p 4( p) 5( p) 4 3p 5 5p p * B. This game does not have any Pure Strategy Nash Equilibria: Player Top 4, 9, 5 Player Bottom, 7, 3 However, by Nash s Existence Theorem we know that there must exist a Mixed Strategy Equilibrium. Letting p denote the probability with which Player plays Top and letting q denote the probability with which Player plays Left, a Mixed Strategy Nash Equilibrium can be determined as: T B 4q ( q) ( q) q q q * 3 and

15 L R p 7( p) 5 p 3( p) 9 p 7 p 3 p * 5 A. Player has a dominant strategy of Top (it is a best reply for each available strategy of Player ). Player has a dominant strategy of Left (it is a best reply for each available strategy of Player ). Thus, the unique equilibrium of the game is a Pure Strategy Nash Equilibrium in which Player plays Top and Player plays Left. B. Player does not have a dominant strategy ( Bottom is the best reply to Left, while Top is the best reply to Right ). Player has a dominant strategy of Right (it is a best reply for each available strategy of Player ). Thus, the unique equilibrium of the game is a Pure Strategy Nash Equilibrium in which Player plays Right (his dominant strategy) and Player plays Top (her best reply to the dominant strategy of Player ). C. Neither player has a dominant strategy. For Player, Top is the best reply to Left, while Bottom is the best reply to Right. For Player, Left is the best reply to Top, while Right is the best reply to Bottom. Thus, the game has two Pure Strategy Nash Equilibria one in which Player plays Top and Player plays Left, and another in which Player plays Bottom and Player plays Right. D. Neither player has a dominant strategy. For Player, Top is the best reply to Left, while Bottom is the best reply to Right. For Player, Right is the best reply to Top, while Left is the best reply to Bottom. Thus, the game has no Pure Strategy Nash Equilibria. 3A. The definition of a Prisoner s Dilemma was: a game in which every player has a dominant strategy (so that the game has a unique equilibrium characterized by all players using their dominant strategies), but in which there is some other outcome at which the payoff of every single player is higher than the equilibrium payoff. For the game under consideration, both players do have dominant strategies ( Top is the dominant strategy for Player and Left is the dominant strategy for Player ). However, when Player plays Top and Player plays Left, the realized payoffs are (8) for Player and (65) for Player. That is, each player is realizing the highest payoff that she could possibly realize. From here, it is clear that this is not a Prisoner s Dilemma (since there is not some other outcome at which the payoff of every single player is higher than the equilibrium payoff ). 3B. Since each player has a dominant strategy, the unique Nash Equilibrium is for each player to follow her dominant strategy. That is, the unique Nash Equilibrium is for Player to play Top and for Player to play Left. 4A. Given the description of the game, the resulting payoff matrix is: Golden Fleece JonShawn Traditional Trendy Traditional 95, 7 85, Trendy 55, 85,

16 4B. Drawing the Best Reply Arrows as below: Golden Fleece JonShawn Traditional Trendy Traditional 95, 7 85, Trendy 55, 85, We see that there are two Pure Strategy Nash Equilibrum, one in which Golden Fleece chooses Trendy and JonShawn chooses Traditional, and one in which Golden Fleece chooses Traditional and JonShawn chooses Trendy. 4C. The Best Reply Correspondence for Golden Fleece can be derived by first recognizing when Golden Fleece would have a strict preference for choosing p (i.e., always choosing a traditional line). This will be the case so long as: Trad Trend GF 95 q 85( q) 55q 85( q) GF ( q) 6q 6q 5 q Thus, choosing p (i.e., always choosing trendy) is the best reply if q Finally, if q 5. 65, then any value of p between zero and one is a best reply. 8 Similarly, for JonShawn, we have that q (i.e., always choosing a traditional line) is the unique best reply if: Trad Trend JS 7 p ( p) p ( p) JS 8( p) 5p 3p p It follows that choosing q (i.e., always choosing a trendy line) is the best reply if p Finally, if p , then any value of q between zero and one is a 3 3 best reply. Graphically: q q BR ( p) p (q) p BR For the mixed extension of the game, we have a Nash Equilibrium wherever the two Best Reply Correspondences intersect. Thus, the graph above identifies not just the two aforementioned Pure Strategy Nash Equilibria (of ( p, q) (, ) and ( p, q) (,) ), but 8 5 ( p, q),. also reveals the existence of a Mixed Strategy Nash Equilibrium with 3 8

17 5A. For Top to be a dominant strategy for Player, we need a and c. For Left to be a dominant strategy for Player, we need b and d. 5B. For neither player to have a dominant strategy and for no Pure Strategy Equilibria to exist, we need the best response arrows to result in a cycle. One way to have this is for a, b, c, and d. 5C. For neither player to have a dominant strategy and for two Pure Strategy Equilibria to exist, we need the best response arrows to be such that either: Top/Left and Bottom/Right each have both arrows pointing inward; or Top/Right and Bottom/Left each have both arrows pointing inward. To have the former, we would need a, b, c, and d. 5D. Again, to have no Pure Strategy Equilibria we need the best response arrows to result in a cycle. As noted in (7B), one way to have this is with a, b, c, and d. In order for Player to optimally choose a mixed strategy when Player is playing Left with probability 3, we need: a ( ) ( ) a c a c Similarly, in order for Player to optimally choose a mixed strategy when Player is playing Top with probability 5, we need: 4 b 4 ( ) ( ) d b d b 6 A set of values satisfying these restrictions is: a 3, c 4, b, and d 3. c d

ECON 2100 Principles of Microeconomics (Summer 2016) Game Theory and Oligopoly

ECON 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 information

Economics of Strategy (ECON 4550) Maymester 2015 Foundations of Game Theory

Economics 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 information

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

Game Theory: The Basics. Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943) Game Theory: The Basics The following is based on Games of Strategy, Dixit and Skeath, 1999. Topic 8 Game Theory Page 1 Theory of Games and Economics Behavior John Von Neumann and Oskar Morgenstern (1943)

More information

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,

More information

ECON 282 Final Practice Problems

ECON 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 information

Exercises for Introduction to Game Theory SOLUTIONS

Exercises for Introduction to Game Theory SOLUTIONS Exercises for Introduction to Game Theory SOLUTIONS Heinrich H. Nax & Bary S. R. Pradelski March 19, 2018 Due: March 26, 2018 1 Cooperative game theory Exercise 1.1 Marginal contributions 1. If the value

More information

ECON 312: Games and Strategy 1. Industrial Organization Games and Strategy

ECON 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 information

Game 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, 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 information

Lecture #3: Networks. Kyumars Sheykh Esmaili

Lecture #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 information

ECON 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 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 information

DECISION MAKING GAME THEORY

DECISION 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 information

Distributed Optimization and Games

Distributed Optimization and Games Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation

More information

Topics in Applied Mathematics

Topics in Applied Mathematics Topics in Applied Mathematics Introduction to Game Theory Seung Yeal Ha Department of Mathematical Sciences Seoul National University 1 Purpose of this course Learn the basics of game theory and be ready

More information

Chapter 30: Game Theory

Chapter 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 information

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I

Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Advanced Microeconomics (Economics 104) Spring 2011 Strategic games I Topics The required readings for this part is O chapter 2 and further readings are OR 2.1-2.3. The prerequisites are the Introduction

More information

Reading Robert Gibbons, A Primer in Game Theory, Harvester Wheatsheaf 1992.

Reading 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 information

Mixed Strategies; Maxmin

Mixed Strategies; Maxmin Mixed Strategies; Maxmin CPSC 532A Lecture 4 January 28, 2008 Mixed Strategies; Maxmin CPSC 532A Lecture 4, Slide 1 Lecture Overview 1 Recap 2 Mixed Strategies 3 Fun Game 4 Maxmin and Minmax Mixed Strategies;

More information

Summary 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 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 information

Computational Methods for Non-Cooperative Game Theory

Computational 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 information

Game Theory. Wolfgang Frimmel. Dominance

Game 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 information

Advanced Microeconomics: Game Theory

Advanced Microeconomics: Game Theory Advanced Microeconomics: Game Theory P. v. Mouche Wageningen University 2018 Outline 1 Motivation 2 Games in strategic form 3 Games in extensive form What is game theory? Traditional game theory deals

More information

EconS Game Theory - Part 1

EconS Game Theory - Part 1 EconS 305 - Game Theory - Part 1 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 8, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 28 November 8, 2015 1 / 60 Introduction Today, we

More information

Chapter 13. Game Theory

Chapter 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 information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2016 Prof. Michael Kearns Game Theory for Fun and Profit The Beauty Contest Game Write your name and an integer between 0 and 100 Let

More information

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides Game Theory ecturer: Ji iu Thanks for Jerry Zhu's slides [based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1 Overview Matrix normal form Chance games Games with hidden information

More information

Lecture 6: Basics of Game Theory

Lecture 6: Basics of Game Theory 0368.4170: Cryptography and Game Theory Ran Canetti and Alon Rosen Lecture 6: Basics of Game Theory 25 November 2009 Fall 2009 Scribes: D. Teshler Lecture Overview 1. What is a Game? 2. Solution Concepts:

More information

Appendix A A Primer in Game Theory

Appendix 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 information

Computing Nash Equilibrium; Maxmin

Computing Nash Equilibrium; Maxmin Computing Nash Equilibrium; Maxmin Lecture 5 Computing Nash Equilibrium; Maxmin Lecture 5, Slide 1 Lecture Overview 1 Recap 2 Computing Mixed Nash Equilibria 3 Fun Game 4 Maxmin and Minmax Computing Nash

More information

The extensive form representation of a game

The 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 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

(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 information

final examination on May 31 Topics from the latter part of the course (covered in homework assignments 4-7) include:

final 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 information

THEORY: NASH EQUILIBRIUM

THEORY: 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 information

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns

Introduction to (Networked) Game Theory. Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100% percent expected to attend

More information

Distributed Optimization and Games

Distributed Optimization and Games Distributed Optimization and Games Introduction to Game Theory Giovanni Neglia INRIA EPI Maestro 18 January 2017 What is Game Theory About? Mathematical/Logical analysis of situations of conflict and cooperation

More information

Terry College of Business - ECON 7950

Terry College of Business - ECON 7950 Terry College of Business - ECON 7950 Lecture 5: More on the Hold-Up Problem + Mixed Strategy Equilibria Primary reference: Dixit and Skeath, Games of Strategy, Ch. 5. The Hold Up Problem Let there be

More information

Game Theory: introduction and applications to computer networks

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 1: introduction Giovanni Neglia INRIA EPI Maestro 30 January 2012 Part of the slides are based on a previous course with D. Figueiredo

More information

Economics 201A - Section 5

Economics 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 information

Sequential Games When there is a sufficient lag between strategy choices our previous assumption of simultaneous moves may not be realistic. In these

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 information

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies.

Section Notes 6. Game Theory. Applied Math 121. Week of March 22, understand the difference between pure and mixed strategies. Section Notes 6 Game Theory Applied Math 121 Week of March 22, 2010 Goals for the week be comfortable with the elements of game theory. understand the difference between pure and mixed strategies. be able

More information

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium

ECO 220 Game Theory. Objectives. Agenda. Simultaneous Move Games. Be able to structure a game in normal form Be able to identify a Nash equilibrium ECO 220 Game Theory Simultaneous Move Games Objectives Be able to structure a game in normal form Be able to identify a Nash equilibrium Agenda Definitions Equilibrium Concepts Dominance Coordination Games

More information

Game theory Computational Models of Cognition

Game theory Computational Models of Cognition Game theory Taxonomy Rational behavior Definitions Common games Nash equilibria Mixed strategies Properties of Nash equilibria What do NE mean? Mutually Assured Destruction 6 rik@cogsci.ucsd.edu Taxonomy

More information

U strictly dominates D for player A, and L strictly dominates R for player B. This leaves (U, L) as a Strict Dominant Strategy Equilibrium.

U 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 information

NORMAL FORM (SIMULTANEOUS MOVE) GAMES

NORMAL FORM (SIMULTANEOUS MOVE) GAMES NORMAL FORM (SIMULTANEOUS MOVE) GAMES 1 For These Games Choices are simultaneous made independently and without observing the other players actions Players have complete information, which means they know

More information

NORMAL FORM GAMES: invariance and refinements DYNAMIC GAMES: extensive form

NORMAL 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 information

Lecture 7: Dominance Concepts

Lecture 7: Dominance Concepts Microeconomics I: Game Theory Lecture 7: Dominance Concepts (see Osborne, 2009, Sect 2.7.8,2.9,4.4) Dr. Michael Trost Department of Applied Microeconomics December 6, 2013 Dr. Michael Trost Microeconomics

More information

CS510 \ Lecture Ariel Stolerman

CS510 \ Lecture Ariel Stolerman CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will

More information

Dominance and Best Response. player 2

Dominance and Best Response. player 2 Dominance and Best Response Consider the following game, Figure 6.1(a) from the text. player 2 L R player 1 U 2, 3 5, 0 D 1, 0 4, 3 Suppose you are player 1. The strategy U yields higher payoff than any

More information

Lecture 5: Subgame Perfect Equilibrium. November 1, 2006

Lecture 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 information

Game Theory ( nd term) Dr. S. Farshad Fatemi. Graduate School of Management and Economics Sharif University of Technology.

Game 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 information

Microeconomics 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 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 information

Multiagent 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 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 information

1\2 L m R M 2, 2 1, 1 0, 0 B 1, 0 0, 0 1, 1

1\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 information

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col.

1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. I. Game Theory: Basic Concepts 1. Simultaneous games All players move at same time. Represent with a game table. We ll stick to 2 players, generally A and B or Row and Col. Representation of utilities/preferences

More information

Minmax and Dominance

Minmax and Dominance Minmax and Dominance CPSC 532A Lecture 6 September 28, 2006 Minmax and Dominance CPSC 532A Lecture 6, Slide 1 Lecture Overview Recap Maxmin and Minmax Linear Programming Computing Fun Game Domination Minmax

More information

ECO 199 B GAMES OF STRATEGY Spring Term 2004 B February 24 SEQUENTIAL AND SIMULTANEOUS GAMES. Representation Tree Matrix Equilibrium concept

ECO 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 information

Math 464: Linear Optimization and Game

Math 464: Linear Optimization and Game Math 464: Linear Optimization and Game Haijun Li Department of Mathematics Washington State University Spring 2013 Game Theory Game theory (GT) is a theory of rational behavior of people with nonidentical

More information

1. Introduction to Game Theory

1. Introduction to Game Theory 1. Introduction to Game Theory What is game theory? Important branch of applied mathematics / economics Eight game theorists have won the Nobel prize, most notably John Nash (subject of Beautiful mind

More information

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.

Note: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice. Game Theoretic Solutions Def: A strategy s i 2 S i is strictly dominated for player i if there exists another strategy, s 0 i 2 S i such that, for all s i 2 S i,wehave ¼ i (s 0 i ;s i) >¼ i (s i ;s i ):

More information

LECTURE 26: GAME THEORY 1

LECTURE 26: GAME THEORY 1 15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 26: GAME THEORY 1 INSTRUCTOR: GIANNI A. DI CARO ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation

More information

DYNAMIC GAMES. Lecture 6

DYNAMIC 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 information

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Topic 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 information

Games. 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 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 information

Microeconomics of Banking: Lecture 4

Microeconomics 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 information

Game Theory: Introduction. Game Theory. Game Theory: Applications. Game Theory: Overview

Game Theory: Introduction. Game Theory. Game Theory: Applications. Game Theory: Overview Game Theory: Introduction Game Theory Game theory A means of modeling strategic behavior Agents act to maximize own welfare Agents understand their actions affect actions of other agents ECON 370: Microeconomic

More information

1 Simultaneous move games of complete information 1

1 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 information

Normal Form Games: A Brief Introduction

Normal Form Games: A Brief Introduction Normal Form Games: A Brief Introduction Arup Daripa TOF1: Market Microstructure Birkbeck College Autumn 2005 1. Games in strategic form. 2. Dominance and iterated dominance. 3. Weak dominance. 4. Nash

More information

Student Name. Student ID

Student Name. Student ID Final Exam CMPT 882: Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte Student Name Student ID Instructions. This exam is worth 30% of your final mark in this course.

More information

Non-Cooperative Game Theory

Non-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 information

3 Game Theory II: Sequential-Move and Repeated Games

3 Game Theory II: Sequential-Move and Repeated Games 3 Game Theory II: Sequential-Move and Repeated Games Recognizing that the contributions you make to a shared computer cluster today will be known to other participants tomorrow, you wonder how that affects

More information

Multiagent 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 Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue

Introduction to Industrial Organization Professor: Caixia Shen Fall 2014 Lecture Note 6 Games and Strategy (ch.4)-continue 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

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Managing with Game Theory Hongying FEI Feihy@i.shu.edu.cn Poker Game ( 2 players) Each player is dealt randomly 3 cards Both of them order their cards as they want Cards at

More information

n-person Games in Normal Form

n-person Games in Normal Form Chapter 5 n-person Games in rmal Form 1 Fundamental Differences with 3 Players: the Spoilers Counterexamples The theorem for games like Chess does not generalize The solution theorem for 0-sum, 2-player

More information

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro

CMU Lecture 22: Game Theory I. Teachers: Gianni A. Di Caro CMU 15-781 Lecture 22: Game Theory I Teachers: Gianni A. Di Caro GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent systems Decision-making where several

More information

CSCI 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 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 information

CMU-Q Lecture 20:

CMU-Q Lecture 20: CMU-Q 15-381 Lecture 20: Game Theory I Teacher: Gianni A. Di Caro ICE-CREAM WARS http://youtu.be/jilgxenbk_8 2 GAME THEORY Game theory is the formal study of conflict and cooperation in (rational) multi-agent

More information

Multiagent 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 Multiagent Systems: Intro to Game Theory CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far almost everything we have looked at has been in a single-agent setting Today - Multiagent

More information

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas

UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas UC Berkeley Haas School of Business Economic Analysis for Business Decisions (EWMBA 201A) Game Theory I (PR 5) The main ideas Lectures 5-6 Aug. 29, 2009 Prologue Game theory is about what happens when

More information

ECO 5341 Strategic Behavior Lecture Notes 3

ECO 5341 Strategic Behavior Lecture Notes 3 ECO 5341 Strategic Behavior Lecture Notes 3 Saltuk Ozerturk SMU Spring 2016 (SMU) Lecture Notes 3 Spring 2016 1 / 20 Lecture Outline Review: Dominance and Iterated Elimination of Strictly Dominated Strategies

More information

Game Theory two-person, zero-sum games

Game Theory two-person, zero-sum games GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising and marketing campaigns,

More information

Game theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in

Game theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in Game Theory Game theory attempts to mathematically capture behavior in strategic situations, or games, in which an individual s success in making choices depends on the choices of others. A game Γ consists

More information

Applied Game Theory And Strategic Behavior Chapter 1 and Chapter 2. Author: Siim Adamson TTÜ 2010

Applied Game Theory And Strategic Behavior Chapter 1 and Chapter 2. Author: Siim Adamson TTÜ 2010 Applied Game Theory And Strategic Behavior Chapter 1 and Chapter 2 review Author: Siim Adamson TTÜ 2010 Introduction The book Applied Game Theory And Strategic Behavior is written by Ilhan Kubilay Geēkil

More information

4/21/2016. Intermediate Microeconomics W3211. Lecture 20: Game Theory 2. The Story So Far. Today. But First.. Introduction

4/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 information

Game Theory and Randomized Algorithms

Game 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 information

2. The Extensive Form of a Game

2. The Extensive Form of a Game 2. The Extensive Form of a Game In the extensive form, games are sequential, interactive processes which moves from one position to another in response to the wills of the players or the whims of chance.

More information

Dominant and Dominated Strategies

Dominant and Dominated Strategies Dominant and Dominated Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Junel 8th, 2016 C. Hurtado (UIUC - Economics) Game Theory On the

More information

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6

Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6 MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September

More information

Sequential games. Moty Katzman. November 14, 2017

Sequential 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 information

Repeated Games. Economics Microeconomic Theory II: Strategic Behavior. Shih En Lu. Simon Fraser University (with thanks to Anke Kessler)

Repeated 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 information

Simultaneous Move Games

Simultaneous Move Games Simultaneous Move Games These notes essentially correspond to parts of chapters 7 and 8 of Mas-Colell, Whinston, and Green. Most of this material should be a review from BPHD 8100. 1 Introduction Up to

More information

February 11, 2015 :1 +0 (1 ) = :2 + 1 (1 ) =3 1. is preferred to R iff

February 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 information

Introduction to Game Theory

Introduction 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 information

Games in Extensive Form

Games 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 information

Econ 302: Microeconomics II - Strategic Behavior. Problem Set #5 June13, 2016

Econ 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 information

Games in Extensive Form, Backward Induction, and Subgame Perfection:

Games 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 information

BS2243 Lecture 3 Strategy and game theory

BS2243 Lecture 3 Strategy and game theory BS2243 Lecture 3 Strategy and game theory Spring 2012 (Dr. Sumon Bhaumik) Based on: Rasmusen, Eric (1992) Games and Information, Oxford, UK and Cambridge, Mass.: Blackwell; Chapters 1 & 2. Games what are

More information

Introduction: What is Game Theory?

Introduction: What is Game Theory? Microeconomics I: Game Theory Introduction: What is Game Theory? (see Osborne, 2009, Sect 1.1) Dr. Michael Trost Department of Applied Microeconomics October 25, 2013 Dr. Michael Trost Microeconomics I:

More information

Asynchronous Best-Reply Dynamics

Asynchronous Best-Reply Dynamics Asynchronous Best-Reply Dynamics Noam Nisan 1, Michael Schapira 2, and Aviv Zohar 2 1 Google Tel-Aviv and The School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel. 2 The

More information

Chapter 3 Learning in Two-Player Matrix Games

Chapter 3 Learning in Two-Player Matrix Games Chapter 3 Learning in Two-Player Matrix Games 3.1 Matrix Games In this chapter, we will examine the two-player stage game or the matrix game problem. Now, we have two players each learning how to play

More information

Evolutionary Game Theory and Linguistics

Evolutionary Game Theory and Linguistics Gerhard.Jaeger@uni-bielefeld.de February 21, 2007 University of Tübingen Conceptualization of language evolution prerequisites for evolutionary dynamics replication variation selection Linguemes any piece

More information