Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.

Slides:



Advertisements
Similar presentations
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Advertisements

Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
Chapter 10 Game Theory and Strategic Behavior
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
OLIGOPOLY A market structure in which there are few firms, each of which is large relative to the total industry. Key idea: Decision of firms are interdependent.
Game Theory. “If you don’t think the math matters, then you don’t know the right math.” Chris Ferguson 2002 World Series of Poker Champion.
EKONOMSKA ANALIZA PRAVA. Game Theory Outline of the lecture: I. What is game theory? II. Elements of a game III. Normal (matrix) and Extensive (tree)
Network Theory and Dynamic Systems Game Theory: Mixed Strategies
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Chapter 11 Game Theory and the Tools of Strategic Business Analysis.
Games What is ‘Game Theory’? There are several tools and techniques used by applied modelers to generate testable hypotheses Modeling techniques widely.
ECO290E: Game Theory Lecture 4 Applications in Industrial Organization.
Game Theory.
An Introduction to Game Theory Part I: Strategic Games
GAME THEORY.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Strategy and Game Theory
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Chapter 10 GAME THEORY AND STRATEGIC EQUILIBRIUM Copyright ©2002 by South-Western, a division of Thomson Learning. All rights reserved. MICROECONOMIC THEORY.
Nash Equilibrium - definition A mixed-strategy profile σ * is a Nash equilibrium (NE) if for every player i we have u i (σ * i, σ * -i ) ≥ u i (s i, σ.
Game Applications Chapter 29. Nash Equilibrium In any Nash equilibrium (NE) each player chooses a “best” response to the choices made by all of the other.
Today: Some classic games in game theory
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Monetary Economics Game and Monetary Policymaking.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Chapter 5 Game Theory and the Tools of Strategic Business Analysis.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Game theory 2 Lukáš Lehotský
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
5.1.Static Games of Incomplete Information
Topics to be Discussed Gaming and Strategic Decisions
ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?
Lec 23 Chapter 28 Game Theory.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Advanced Subjects in GT Outline of the tutorials Static Games of Complete Information Introduction to games Normal-form (strategic-form) representation.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Game theory Chapter 28 and 29
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Q 2.1 Nash Equilibrium Ben
Chapter 28 Game Theory.
Microeconomics Course E
Simultaneous Move Games: Discrete Strategies
Game theory Chapter 28 and 29
Choices Involving Strategy
Multiagent Systems Game Theory © Manfred Huber 2018.
Game Theory and Strategic Play
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Lecture Game Theory.
Game Theory: The Nash Equilibrium
Presentation transcript:

Chapter 6 © 2006 Thomson Learning/South-Western Game Theory

Overview 1. Games – concepts 2. Prisoners’ Dilemma 3. Mixed Strategies 4. Multiple Equilibria 5. Tragedy of Commons 2

1.Games - concepts 3

4 Basic Concepts All games have three basic elements: Players Strategies Payoffs Players can make binding agreements in cooperative games, but can not in noncooperative games, which are studied in this chapter.

5 Players A player is a decision maker and can be anything from individuals to entire nations. Players have the ability to choose among a set of possible actions. Games are often characterized by the fixed number of players. Generally, the specific identity of a player is not important to the game.

6 Strategies A strategy is a course of action available to a player. Strategies may be simple or complex. In noncooperative games each player is uncertain about what the other will do since players can not reach agreements among themselves.

7 Payoffs Payoffs are the final returns to the players at the conclusion of the game. Payoffs are usually measured in utility although sometimes also monetarily. In general, players are able to rank the payoffs from most preferred to least preferred. Players seek the highest payoff available.

8 Equilibrium Concepts In the theory of markets an equilibrium occurred when all parties to the market had no incentive to change his or her behavior. When strategies are chosen, an equilibrium would also provide no incentives for the players to alter their behavior further. The most frequently used equilibrium concept is a Nash equilibrium.

9 Nash Equilibrium The most widely used approach to defining equilibrium in games is that proposed by Cournot and generalized in the 1950s by John Nash. A Nash equilibrium is a set of strategies, one for each player, that are each best responses against one another.

2. Prisoners’ Dilemma 10

11 Nash Equilibrium In a two-player games, a Nash equilibrium is a pair of strategies (a*,b*) such that a* is an optimal strategy for A against b* and b* is an optimal strategy for B against a*. Players can not benefit from knowing the equilibrium strategy of their opponents. Every game has a Nash equilibrium, and some games may have several.

12 The Prisoner’s Dilemma The Prisoner’s Dilemma is a game in which the optimal outcome for the players is unstable – there is a temptation to deviate. The name comes from the following situation. Two people are arrested for a crime. The district attorney has little evidence but is anxious to extract a confession.

13 The Prisoner’s Dilemma The DA separates the suspects and tells each, “If you confess and your companion doesn’t, I can promise you reduced (one year) sentence, whereas your companion will get ten years. If you both confess, you will each get a three year sentence.” Each suspect knows that if neither confess, they will be tried for a lesser crime and will receive two-year sentences.

14 TABLE 6-1: The Prisoner’s Dilemma

15 The Prisoner’s Dilemma The normal form (i.e. matrix) of the game is shown in Table 6-1. The confess strategy dominates for both players so it is a Nash equilibrium. However, an agreement to remain silent (not to confess) would reduce their prison terms by one year each. This agreement would appear to be the rational solution.

16 The Prisoner’s Dilemma: Extensive Form The representation of the game as a tree is referred to as the extensive form. Action proceeds from top to bottom.

17 Figure 6-1: The Prisoner’s Dilemma: Extensive Form... Confess Silent -3, -3-10, -1-1, -10-2, -2 A BB

18 Table 6-2: Solving for Nash Equilibrium in Prisoner’s Dilemma Using the Underlining Method Step 1

19 Table 6-2: Solving for Nash Equilibrium in Prisoner’s Dilemma Using the Underlining Method Step 2

20 Table 6-2: Solving for Nash Equilibrium in Prisoner’s Dilemma Using the Underlining Method Step 3

21 Table 6-2: Solving for Nash Equilibrium in Prisoner’s Dilemma Using the Underlining Method Step 4

22 Table 6-2: Solving for Nash Equilibrium in Prisoner’s Dilemma Using the Underlining Method Step 5

23 Dominant Strategies A dominant strategy refers to the best response to any strategy chosen by the other player. When a player has a dominant strategy in a game, there is good reason to predict that this is how the player will play the game.

3. Mixed Strategies 24

25 Mixed Strategies A mixed strategy refers to when the player randomly selects from several possible actions. By contrast, the strategies in which a player chooses one action or another with certainty are called pure strategies.

26 Table 6-3: Matching Pennies Game in Normal Form

27 Figure 6-2: Matching Pennies Game in Extensive Form... Heads Tails 1, -1-1, 1 1, -1 A BB

28 Table 6-4: Solving for Pure-Strategy Nash Equilibrium in Matching Pennies Game 1/2

29 Solving for Mixed-Strategy Equilibrium Expected payoffs for A: (1/4)(1)+(1/4)(-1)+(1/4)(-1)+(1/4)(1)=0 and similarly for B. So, both playing Heads and Tails with equal chance is the mixed-strategy Nash equilibrium. If there is a strategy that produces higher payoff, then this is NOT Nash equilibrium. Assume B plays H with ½ and T with ½ probability. If A plays only H or only T (or anything in between) A’s payoffs will still be 0.

30 Solving for Mixed-Strategy Equilibrium Show that this is the only mixed-strategy equilibrium (no other probabilities would work). Assume B plays H with 1/3 and T with 2/3. Expected payoff for A from playing H (1/3)(1)+(2/3)(-1)=-1/3 And from playing T Examples of mixed strategies:

31 4. Multiple Equilibria

32 Multiple Equilibria TABLE 6-5: Battle of the Sexes in Normal Form Both prefer to be together rather than apart. She prefers ballet, he boxing.

33 TABLE 6-6: Solving for Pure-Strategy Nash Equilibria in Battle of the Sexes

34 Solving for Mixed Strategy Nash Equilibrium Equilibrium probabilities do not end up to be equal for each action: w – probability that wife chooses ballet 1-w- that she does not (chooses boxing) h – probability that husband chooses ballet 1-h – he chooses boxing Goal is to compute equilibrium w and h.

Solving for Mixed Strategy Nash Equilibrium w and h are any of the values between (0,1) and we can not use matrix Need to find best response function The function which gives the payoff-maximizing choice for one player in each of a continuum of actions of the other player is referred to as the best- response function. Compute wife’s BRF: find w that max her payoff for each of husband’s strategies

For a given h she can: prefer to play Ballet and then her best response is w=1 prefer to play Boxing and her best response is w=0,or be indifferent and her best response is tie between all the values (0,1) Husband plays Ballet with probability h and Boxing 1-h. Best Response Function

37 TABLE 6-7: Computing the Wife’s Best Response to the Husband’s Mixed Strategy (h)(2) + (1 – h)(0) = 2h (h)(0) + (1 – h)(1) = 1 - h She prefers Ballet if 2h>1-h or h>1/3, w=1 She prefers Boxing if h<1/3, w=0 She is indifferent when h=1/3 and her best response is w(0,1)

38 Figure 6-4: Best-Response Functions Allowing Mixed Strategies in the Battle of the Sexes w h 12/3 1 1/3.. Pure-strategy Nash equilibrium (both play Ballet) Mixed-strategy Nash equilibrium Pure-strategy Nash equilibrium (both play Boxing). Wife’s best- response function Husband’s best-response function

39 The Problem of Multiple Equilibria Which equilibrium to choose (will happen)? A rule that selects the highest total payoff would not distinguish between two pure-strategy equilibria. To select between these, one might follow T. Schelling’s suggestion and look for a focal point…a logical outcome on which to coordinate, based on information outside the game.

5. Tragedy of Commons 40

41 Tragedy of Commons Benefit A gets from each sheep  Total benefit A gets  Marginal benefit of additional sheep

Tragedy of Commons(Continuous Actions)  Marginal benefit=Marginal cost=0 and solve for s A

43 Nash equilibrium B’s best-response function SASA 120 FIGURE 6-8: Best-Response Functions in the Tragedy of the Commons SBSB A’s best-response function

44 Tragedy of Commons Equations for the Tragedy of Commons After Equilibria are Shifted:

45 Nash equilibrium shifts B’s best-response function SASA FIGURE 6-9: Shift in Equilibrium When A’s Benefit Increases SBSB A’s best-response function shifts out