


Exercise 2 Consider the following simultaneous move game between two players I II III IV (-2,0)...
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...
Problem 1: Consider the following simultaneous move game with two players, denoted by 1 and 2: 1 2 T B L 1,0 0,2 M R 0,1 5,0 2,1 1,0 1. Is there a strategy for any of the players which a player would never choose? 2. If there is a strategy which a player never chooses (it is called, a dominated strategy), and this fact is known among the players, find the equilibria of the game. Hint: In a mixed...
Consider the following game. Player 2 E F G H Player 1 A 2,0 4,2 3,1 -1,1 B 1,1 1,0 2,0 4,2 C 2,0 3,5 4,4 0,1 D 1,-1 2,2 1,0 -1,1 Solve this one-shot simultaneous move game using the Iterated Deletion of Strictly Dominated Strategies. Group of answer choices (C,G) This game is not solvable using IDSD (D,F) (C,F) None of the other options
2. Iterative Deletion of (weakly) Dominated Strategies Consider the following two-player game 2 I c I T 1,1 0,1 3,1 1 M 1,0 2,2 1,3 D 1,3 3,1 2,2 (a) Are there any strictly dominated strategies? Are there any weakly dominated strategies? If so, explain what dominates what and how. (b) After deleting any strictly or weakly dominated strategies, are there any strictly or weakly dominated strategies in the reduced' game? If so, explain what dominates what and how. What...
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.
2. Consider the following simultaneous move game: Column Left Right Top 1,1 7,3 Row Bottom 3,5 11,0 (a) Find all pure-strategy Nash equilibria (b) Now assume that the game is made sequential with Row moving first. Illustrate this new game using a game tree and find the rollback equilibrium (c) List the strategies of the two players in this sequential-move game and give the normal-form representation of the game (the payoff matrix) (d) Use the payoff matrix to find the...
2. Consider the following simultaneous move game: Column Left Right 1,1 3,5 11,0 Тoр 7,3 Row Bottom (a) Find all pure-strategy Nash equilibria (b) Now assume that the game is made sequential with Row moving first. Illustrate this new game using a game tree and find the rollback equilibrium (c) List the strategies of the two players in this sequential-move game and give the normal-form representation of the game (the payoff matrix) (d) Use the payoff matrix to find the...
7. Consider the following two player game, with the players being 1 and 2. As usual 1 chooses a row and 2 a column. ABC a 1,4 2,1 3,2 4,1 b 2,3 3,4 4,3 1,2 с 3,1 4,2 1,4 2,3 d 4,2 1,3 4,3 3,2 (a) Which strategies satisfy iterated elimination of strictly dominated strategies? How many levels of knowledge of rationality do you have to assume to obtain your result? (b) If you were allowed to follow the same...
4. Consider the following game that is played T times. First, players move simultaneously and independently. Then each player is informed about the actions taken by the other player in the first play and, given this, they play it again, and so on. The payoff for the whole game is the sum of the payoffs a player obtains in the T plays of the game A 3,1 4,0 0,1 В 1,5 2,2 0,1 C 1,1 0,2 1,2 (a) (10%) Suppose...
(2,5). Find the Walrasian equilibrium. 4. 120] Answer the following. (a) 14 Explain the difference between a strategy that is a best response versus a strategy that is strictly dominant. (b) (6) Consider the following game: player 2 D E F C A 3,7 7,3 1,2 4,3 player 1 B 8,9 8,5 2,8 5,2 C 0,10 7,01,9 2,2 Find the strictly dominant strategies solution and the iterated elimination of strictly dominated strategies solution, if any. (c) [10] Consider the following...