Player 1:
Strategy M has been dominated by the strategy U. Hence M must be eliminated.
Player 2:
Strategy C has been dominated by the strategy R. Hence strategy C must be eliminated.
Remaining table:
For each of the following normal-form game below, find the rationalizable strategy profiles, using IENBRS, Iterated...
Game Theory Iterated Elimination: In the following normal-form game, which strategy profiles survive iterated elimination of strictly dominated strategies? 4.5 Player 2 L C R 6,8 2,6 8,2 Player 1 M 8,2 4,4 9,5 D 8,10 4,6 6,7
Problem 2: Consider the following normal form game: | A | B | C D L 2 ,3 -1,3 0,0 4,3 M -1,0 3,0 / 0,10 2,0 R 1,1 | 2,1 3,1 3,1 Part a: What are the pure strategies that are strictly dominated in the above game? Part 6: What are the rationalizable strategies for each player? What are all the rationalizable strategy profiles? Part c: Find all of the Nash equilibria of the game above.
survive 1.2. In the following normal-form game, what strategies survive iterated elimination of strictly dominated strategies? What are the pure-strategy Nash equilibria? of strictly dominated L CR T 2,0 1,14,2 M 3,4 1,2 2,3 B 1,30,2 3,0
1. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, 2. The game is presented in the following matrix: a b c d w 3,3 1,1 0,0 0,0 x 2,1 1,2 1,0 0,5 y 0,2 1,0 3, 2 0,2 z 2,1 1,4 1,1 3,1 (a) Find the set of rationalizable strategies. (b) Find the set of Nash...
Problem #3: Strictly dominated and non-rationalizable strategies (6 pts) Below, there are three game tables. For each one, identify which strategies are non-rationalizable (if any), and which strategies are strictly dominated (if any). Do this for both players in each game. Note: You don't need to use IESDS or IENBR in this problem: I only want to know which strategies are strictly dominated or non-rationalizable in the games as presented. Rogers Go Rogue Go Legit 2,3 3,4 3,2 5,1 3,1...
3. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, z. The game is presented in the following matrix: W Z X y a 3,3 2,1 0,2 2,1 b 1,1 1,2 1,0 1,4 0,0 1,0 3,2 1,1 d 0,0 0,5 0,2 3,1 с Find all the Nash equilibria in the game in pure strategies.
Find the Nash equilibria of and the set of rationalizable strategies for the games 2 2 L R L С R 3,3 2,0 A 5,9 0, 1 U 4,3 В 4,1 8,- 3,2 М 0,9 1,1 D 0,1 2, 8 8,4 (а) (b) 2 2 1 W X Y Z R 3,6 4, 10 5,0 U 0,8 U 0,0 1, 1 2,6 3, 3 4, 10 1,1 0,0 5,5 D 1,5 2,9 3,0 4,6 (d) (c) L M
DLM R A 2,3 -1,0 1,1 B -1,3 3,0 2,1 C 0,0 0,10 3,1 D 4,3 2,0 3,1 Part a: What are the pure strategies that are strictly dominated in the above game? Part 6: What are the rationalizable strategies for each player? What are all the rationalizable strategy profiles? Part c: Find all of the Nash equilibria of the game above.
S5. Consider the following game table: COLIN North South East West Earth 1,3 3,1 0,2 1,1 Water 1,2 1,2 2,3 1,1 ROWENA Wind 3,2 2,1 1,3 0,3 Fire 2,0 3,0 1,1 2,2 124 [CH. 4] SIMULTANEOUS-MOVE GAMES: DISCRETE STRATEGIES (a) Does either Rowena or Colin have a dominant strategy? Explain why or why not. (b) Use iterated elimination of dominated strategies to reduce the game as much as possible. Give the order in which the eliminations occur and give the...
) Solve the game below by iterated elimination of strongly dominated strategies (Hint: One of the pure strategies for player 1 is strongly dominated by a mixed strategy). At each step of the elimination, state which pure strategy you are eliminating and which strategy (there can be more than one; just state one) it is strongly dominated by. X Y Z A 5,-2 0,1 6,0 B 2,8 2,3 1,4 C 0,0 7,1 -2,0