Part 4: Dominant Strategies

Slides:



Advertisements
Similar presentations
Introduction to Game Theory
Advertisements

Oligopoly.
GAME THEORY.
Module 4 Game Theory To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl.
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
ECON 100 Tutorial: Week 9 office: LUMS C85.
Module C1 Decision Models Uncertainty. What is a Decision Analysis Model? Decision Analysis Models is about making optimal decisions when the future is.
Other Issues in Game Theory BusinessNegotiationsContracts.
15 THEORY OF GAMES CHAPTER.
APPENDIX An Alternative View of the Payoff Matrix n Assume total maximum profits of all oligopolists is constant at 200 units. n Alternative policies.
A very little Game Theory Math 20 Linear Algebra and Multivariable Calculus October 13, 2004.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Simultaneous- Move Games with Mixed Strategies Zero-sum Games.
Two-Player Zero-Sum Games
Managerial Economics Game Theory for Oligopoly
Static Games and Cournot Competition
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Game Theory, Part 1 Game theory applies to more than just games. Corporations use it to influence business decisions, and militaries use it to guide their.
Introduction to Microeconomics Game theory Chapter 9.
Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Part 3: The Minimax Theorem
Game Theory Part 5: Nash’s Theorem.
Econ 2610: Principles of Microeconomics Yogesh Uppal
Game Theory “Life must be understood backward, but … it must be lived forward.” - Soren Kierkegaard James Bednar.
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.
Economics 103 Lecture # 17 Interaction Among the Few.
Static Games and Cournot Competition
Options An Introduction to Derivative Securities.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Lectures in Microeconomics-Charles W. Upton Minimax Strategies.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna S-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Supplement 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Game Theory.
Today: Some classic games in game theory
Minimax Strategies. Everyone who has studied a game like poker knows the importance of mixing strategies. –With a bad hand, you often fold –But you must.
Game Theory Statistics 802. Lecture Agenda Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for.
Game Theory.
Oligopoly Mr. Barnett UHS AP Microeconomics
Game Theory.
Chapter 12 & Module E Decision Theory & Game Theory.
To accompany Quantitative Analysis for Management,9e by Render/Stair/Hanna M4-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Module 4 Game.
Game Theory Warin Chotekorakul MD 1/2004. Introduction A game is a contest involving to or more players, each of whom wants to win. Game theory is the.
Chapter 10: Options Markets Tuesday March 22, 2011 By Josh Pickrell.
Game Theory Part 2: Zero Sum Games. Zero Sum Games The following matrix defines a zero-sum game. Notice the sum of the payoffs to each player, at every.
Chapter 9: Static Games and Cournot Competition 1 Static Games and Cournot Competition.
Oligopoly. Oligopoly is a market in which a small number of firms compete. In oligopoly, the quantity sold by one firm depends on the firm’s own price.
Chapter 10: Games and Strategic Behavior
MBF1413 | Quantitative Methods Prepared by Dr Khairul Anuar
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.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Last Study Topics 75 Years of Capital Market History Measuring Risk
Statistics Overview of games 2 player games representations 2 player zero-sum games Render/Stair/Hanna text CD QM for Windows software Modeling.
Managerial Economics Game Theory Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr. Arto.
Games of pure conflict two-person constant sum games.
GAME THEORY Day 5. Minimax and Maximin Step 1. Write down the minimum entry in each row. Which one is the largest? Maximin Step 2. Write down the maximum.
Oligopoly CHAPTER 13B. Oligopoly IRL In some markets there are only two firms. Computer chips are an example. The chips that drive most PCs are made by.
Oligopoly and Game Theory Topic Students should be able to: Use simple game theory to illustrate the interdependence that exists in oligopolistic.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Game Theory Day 10.
Mixed Strategies Keep ‘em guessing.
Tools for Decision Analysis: Analysis of Risky Decisions
11b Game Theory Must Know / Outcomes:
Games of pure conflict two person constant sum
Chapter 6 Game Theory (Module 4) 1.
IE 342 Decision Tree Examples
Money and Banking Lecture 12.
Presentation transcript:

Part 4: Dominant Strategies Game Theory Part 4: Dominant Strategies

Identifying Dominant Strategies Sometimes in a matrix game, a player will have a strategy that, given all of the resulting outcomes, would not be worth playing. Such a strategy would not be worth playing if it is never better and sometimes worse than some other strategy, regardless of the strategies of other players. For a given player, strategies that are never better and sometimes worse than other strategies are called dominated strategies. (We can think of this as equal or worse than all of the other strategies.) On the other hand, a dominant strategy is one that is sometimes better and never worse than all other strategies, regardless of the strategies of the other players. (We can think of this as equal or better than all of the other strategies.)

Does either player have a dominant strategy in the game below? Example 1 Does either player have a dominant strategy in the game below? player 2 For player 1, Z is a dominant strategy. This is because strategy Z is always better than either of the other two strategies. Because Z is dominant, the other strategies must be dominated. We can also say that, for player 1, strategy X dominates strategy Y. A B X 3 Y -5 1 Z 6 player 1 For player 2, strategy A is dominant because A is never worse and, in this case, always better than strategy B from the standpoint of minimizing payoff values. Because A is dominant, then B is dominated.

Does either player have a dominant strategy in the game below? Example 2 Does either player have a dominant strategy in the game below? player 2 For player 1, there is no dominant strategy. However, Z is a dominated strategy. This is because, while no strategy dominates all the others, for player 1, X and Y are never worse and sometimes better than Z. A B X 13 11 Y 12 14 Z 10 player 1 For player 2, there is also no dominant strategy. There is also no dominated strategy for player 2 because there is no strategy that is never better and sometimes worse than any other strategy. (Note that because there are only two strategies for player 2, knowing that there is no dominant strategy, we know there is also no dominated strategy.)

Identifying Dominant Strategies If a player has two strategies, if one strategy is dominant, then the other is dominated. if neither is dominant, then neither is dominated. If a player has three or more strategies, if one strategy is dominant, then all others are dominated. If one strategy is dominated, there may or may not be dominant strategies.

Dominant – better than or equal to any other strategy. Example 3 Dominant – better than or equal to any other strategy. Dominated – worse than or equal to any other strategy. player 2 Does either player have a dominant strategy for this game ? Player 1 has no dominant and no dominated strategy. Why? A B C X -3 -2 -1 Y 1 -4 3 Z -5 player 1

Dominant – better than or equal to any other strategy. Example 3 Dominant – better than or equal to any other strategy. Dominated – worse than or equal to any other strategy. player 2 Player 1 has no dominant and no dominated strategy…If player 2 chose A, then, for player 1, X is the worst strategy Y is the best strategy Z is neither better or worse than any other A B C X -3 -2 -1 Y 1 -4 3 Z -5 player 1

Dominant – better than or equal to any other strategy. Example 3 Dominant – better than or equal to any other strategy. Dominated – worse than or equal to any other strategy. player 2 Player 1 has no dominant and no dominated strategy…If player 2 chose B, then, for player 1, X is neither better or worse than the others Y is the worst strategy Z is the best strategy A B C X -3 -2 -1 Y 1 -4 3 Z -5 player 1

Dominant – better than or equal to any other strategy. Example 3 Dominant – better than or equal to any other strategy. Dominated – worse than or equal to any other strategy. player 2 Player 1 has no dominant and no dominated strategy…If player 2 chose C, then, for player 1, X is neither better or worse than any other Y is the best strategy Z is the worst strategy A B C X -3 -2 -1 Y 1 -4 3 Z -5 player 1

Dominant – better than or equal to any other strategy. Example 3 Dominant – better than or equal to any other strategy. Dominated – worse than or equal to any other strategy. player 2 A B C X -3 -2 -1 Y 1 -4 3 Z -5 Player 1 has no dominant and no dominated strategy. This is because there is no strategy that is equal or better than the others and no strategy that is equal or worse than the others. player 1

Example 3 player 2 A B C X -3 -2 -1 Y 1 -4 3 Z -5 -5 Now, lets consider player 2… Does player 2 have a dominant or any dominated strategies ? player 1

Example 3 player 2 A B C X -3 -2 -1 Y 1 -4 3 Z -5 -5 Now, lets consider player 2… If player 1 chose strategy X, then for player 2 (who wants to minimize values) A is best and C is worst player 1

Example 3 player 2 A B C X -3 -2 -1 Y 1 -4 3 Z -5 -5 Now, lets consider player 2… If player 1 chose strategy Y, then for player 2 (who wants to minimize values) B is best and C is worst player 1

Example 3 player 2 A B C X -3 -2 -1 Y 1 -4 3 Z -5 -5 Now, lets consider player 2… If player 1 chose strategy Z, then for player 2 (who wants to minimize values) C is best and B is worst player 1

Example 3 player 2 For player 2, there is no dominant and no dominated strategy. This is because looking at potential payoffs for each of the strategies, A, B or C, … there is no strategy that is never worse and sometimes better and no strategy that is never better and sometimes worse A B C X -3 -2 -1 Y 1 -4 3 Z -5 player 1

Example 4 Recall the example zero-sum game that modeled the Battle of the Bismark Sea. In strategic form, the game is as follows: For the Japanese Admiral, there is a dominant strategy. Remember, the Japanese Admiral, being the column player, wants to minimize the payoff value. With these two strategies, for the Japanese Admiral, traveling north is the dominant strategy because it is never worse and sometimes better than traveling south. Japanese Admiral travel north travel south search north 2 search south 1 3 American General For the American General, there is no dominant strategy: For the American’s, the best strategy will depend on the strategy of the Japanese.

Example 4 It is interesting to see how the dominant strategy for the Japanese would be identified visually if we attempted to find a mixed strategy equilibrium point. As before, we could assign probabilities to each strategy and find expected payoff functions for each strategy for each player. For the American’s, we’d have the following payoff functions for the Japanese EN = 2q + 1(1-q) and ES = 2q + 3(1-q) Japanese Admiral p 1-p travel north travel south search north 2 search south 1 3 q American General 1-q For the Japanese we’d get the following EN = 2p + 2(1-p) and ES = 1p + 3(1-p) Recall – each represent payoff values to the opposing player.

Example 4 Graphing payoff functions for each player, we can identify which has a dominant strategy and which does not. To graph, we’ll simplify each function first… For the American’s we have: EN = 2q + 1(1-q) = 2q + 1 – 1q = q + 1 and ES = 2q + 3(1-q) = 2q + 3 – 3q = -q + 3 For the Japanese we have: EN = 2p + 2(1-p) = 2p + 2 – 2p = 2 and ES = 1p + 3(1-p) = 1p + 3 – 3p = -2p + 3

Example 4 Graphing payoff functions for each player, we can identify which has a dominant strategy and which does not. For the American’s we have: EN = q + 1 and ES = -q + 3 For the Japanese we have: EN = 2 and ES = -2p + 3 ES 3 3 EN 2 2 EN 1 1 ES p q 1 1 These lines represent payoffs to the Japanese – clearly EN is dominant because it is lower. no dominant strategy for Americans: highest payoff depends on p, a choice of the Japanese

Consider the following matrix game: Example 5 Consider the following matrix game: financial market bull market no change in market bear market invest in stocks 1 -1 mixed portfolio 2 invest in bonds investor

Example 5 financial market bull market no change in market bear market invest in stocks 1 -1 mixed portfolio 2 invest in bonds investor Suppose payoffs represent thousands of dollars gained or lost on a particular day. In this 3x3 matrix game, the investor has a dominant strategy: The mixed portfolio strategy is dominant because it is never worse and sometimes better than any other strategy, regardless of the choice of the financial market. In this case, the financial market (column player) has no dominant strategy. However, in this example, “mixed portfolio” and “no change in market” form an equilibrium point.

Example 6 Company B raise prices no change lower prices 1,1 1,-1 2,0 0,1 0,0 -1,1 1,0 -1,-1 Company A Suppose two companies face each other in a competitive market. Suppose each has three strategies, as shown above, and the payoffs, representing profits in hundreds of thousands of dollars for a given year, are as given in the table. Notice that, in this example, both companies have dominant strategies of raising prices. Because both players have dominant strategies, these form the equilibrium point of the game. A game in which potential payoffs to each player is the same is a symmetric game. Because potential payoffs are different in this game, it is an example of a nonsymmetrical game.

Example 7 Company B raise prices no change lower prices 0,0 -1,1 -1,2 0,1 2,-1 1,-1 Company A This is an example of a symmetric game. Potential payoffs to each player are the same. Both players have dominant strategies in lowering prices. So the combination of both strategies is an equilibrium point.