2)
a) In the payoff matrix, There is dominant strategy equilibrium. It is (1, 5), that is when player P1 chooses to play up and player P2 chooses right, This is player 1's dominant strategy because this strategy gives player 1 highest possible pay off. It is unique.
b) In the payoff matrix, There is a dominant strategy equilibrium, It is (1, 1), that is when player P1 chooses to play up and player P2 chooses right, This is player P1's dominant strategy because this strategy gives player P1 highest possible pay off. It is not unique.
2. (5 marks total IEDS practice Use iterated elimination of dominated strategies to reduce the following...
Iterated Iterated elimination of dominated strategies: Eliminate all strictly (weakly) dominated strategies for all players in the original game. Eliminate all strictly (weakly) dominated strategies for all players in the modified game where players cannot choose any strategy that was eliminated at Step 1. 3 Eliminate all strictly (weakly) dominated strategies for all players in the modified game where players cannot choose any strategy that was eliminated at Steps 1 and 2. 4 ... and so on until there are...
Q1 Elimination of strictly-dominated strategies In each of the following two-player games, what strategies survive iterated elimination of strictly- dominated strategies? What are the Nash equilibria of these games? (a) Player 2 Left 0,2 1,3 2,4 Top Middle Bottom Center 4,3 2,4 1,5 Right 3, 4 2, 3 4,6 Player 1 (b) Player 2 Left 2,4 3,3 4,6 Top Middle Bottom Center 6,5 4,3 5,4 Player 1 Right 5,3 4, 2 2,5
) 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
Q1 Elimination of strictly-dominated strategies In each of the following two-player games, what strategies survive iterated elimination of strictly- dominated strategies? Player 2 Lett Center Right Top 0.2 4, 3 3,1 Player1 Middle 1, 2 2,0 2, Bottom 2,4 36 0,3 Player 2 Left Center Right Top 1, 3 ,4 ,2 Player 1 Middle 2,2 2 3,1 Bottom 3, 5 43 1, 4
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...
4. [20] Answer the following. (a) (5) State the relationship between strictly dominant strategies solution and iterated elimination of strictly dominated strategies solution. That is, does one solution concept imply the other? (b) (5) Consider the following game: player 2 E F G H A-10,6 10.0 3,8 4.-5 player 1 B 9,8 14,8 4.10 2,5 C-10,3 5,9 8.10 5,7 D 0,0 3,10 8,12 0,8 Does any player have a strictly dominant strategies? Find the strictly dominant strategies solution and the...
3. [20] Consider an Edgeworth box economy are given by (a) [5) Find all the Pareto optimal allocations. sing the normalization, P2 = 1, find the Walrasian equilibrium. ully state the first welfare theorem and verify that it holds. dowments had instead been ē1 = (18,15) and (d) [5] Suppose the en = (2,5). Find the Walrasian equilibrium. 4. [20] Answer the following. (a) [4] Explain the difference between a strategy that is a best response versus a strategy that...