First 4 parts
a. If player 1 plays Top, player 2 is strictly better off by playing Middle because she gets the highest payoff which 21.
Similarly, if player 1 plays Middle, player 2 is strictly better off by playing Middle than left or right.
Similarly, if player 1 plays Bottom, player 2's best strategy is to play Right.
It means player 2 plays each strategy in each of the cases. No single strategy is a dominant strategy. Each strategy is player at least once by player 2. So, there is no dominated strategy.
Hence , there is neither a dominant strategy nor a dominanted strategy for player 2.
If player 2 plays Left, player 1 gets highest payoff by playing Middle. So, Player 1's best strategy is playing Middle.
Similarly, if player 2 plays Middle, player 1's best strategy is to play Top.
Similarly, if player 2 plays Right, player 1's best strategy is to play Top.
Here, player 1 doesn't play any single strategy in all cases. So, there is no dominant strategy.
But player 1 never plays Bottom. Because in each case, player is better off by playing Top or Middle rather than Bottom. So, in no case is the Bottom the best strategy for player 1. So, the strategy Bottom is dominated by top and middle for player 1. Both players would strictly prefer (Top,Middle) to (Middle,Left).
Hence, there is no dominant strategy for player 1 and the strategy Bottom is a dominanted strategy for player 1.
b. A strategy is called the Nash equilibrium strategy if each it is the best the strategy of each player given the strategy of the other player.
Here, from part a, we can see that
Player 1's best strategy given that player 2 plays Middle is Top. And player 2's best strategy given that player 1 plays Top Middle. So, it is the best strategy for each player given the other player's strategy. So, (Top,Middle) is a Nash equilibrium.
Similarly, player 1's best strategy given that player 2 plays Left is Middle. And player 2's best strategy given that player 1 plays Middle is Left. So, (Middle,Left) is a Nash equilibrium.
There is no such case apart from the above mentioned cases.
Therefore, (Top,Middle) and (Middle,Left) are the Nash equilibria of the game.
c. (Top,Middle) pays a payoff of 21 to each player and (Middle,Left) pays 10 to player 1 and 5 to player 2. So, each player gets higher payoff at (Top,Middle). So, (Top,Middle) is Pareto superior to (Middle,Left).
Therefore, (Top,Middle) is more likely to happen than (Middle,Left). (
d. No, the Nash equilibria will remain unchanged.
(Top, Middle) and (Middle, Left) will still be the Nash equilibria and no other Nash equilibrium is there is the modified game.
1. (20 points) Consider the following game: Left 7,17 10,5 4,4 Top Middle Bottom Player B...
Question 2(10 marks): The table below represents the pay-offs in a one-shot, simultaneous move game with com- plete information. (Player As pay-offs are given first) Top Player A Middle Bottom Left 7,17 10,5 4,4 Player B Middle 21,21 14,4 7,3 Right 14,11 4,3 10,25 • Find the Nash equilibria in pure strategies for the game whose py-offs are represented in the table above. • What is the likely focal equilibrium and why?
3. Player 1 and Player 2 are going to play the following stage game twice: Player 2 Left Middle Right Player 1 Top 4, 3 0, 0 1, 4 Bottom 0, 0 2, 1 0, 0 There is no discounting in this problem and so a player’s payoff in this repeated game is the sum of her payoffs in the two plays of the stage game. (a) Find the Nash equilibria of the stage game. Is (Top, Left) a...
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...
. Player 1 and Player 2 are going to play the following stage game twice: Player 2 Left Middle Right Player 1 Top 4, 3 0, 0 1, 4 Bottom 0, 0 2, 1 0, 0 There is no discounting in this problem and so a player’s payoff in this repeated game is the sum of her payoffs in the two plays of the stage game. (a) Find the Nash equilibria of the stage game. Is (Top, Left) a...
NEED WITHIN THE HOUR! Suppose that two players are playing the following game. Player A can choose either Top or Bottom, and Player B can choose either Left or Right. The payoffs are given in the following table where the number on the left is the payoff to Player A, and the number on the right is the payoff to Player B. Does Player A have a dominant strategy? If so, what is it? Group of answer choices Top is...
2. Consider the following simultaneous move game Column Left Right 1.1 7,3 3.5 Тор Row Bottom 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...
8. Consider the two-player game described by the payoff matrix below. Player B L R Player A D 0,0 4,4 (a) Find all pure-strategy Nash equilibria for this game. (b) This game also has a mixed-strategy Nash equilibrium; find the probabilities the players use in this equilibrium, together with an explanation for your answer (c) Keeping in mind Schelling's focal point idea from Chapter 6, what equilibrium do you think is the best prediction of how the game will be...
1. Basic Game Theory (21 points) Consider the following game Player Top Bottom Left 21, 23 22. 16 Player 2 Right 20, 24 19. 18 A. (6 points) Does player 2 have a dominant strategy. If yes, describe it B. (9 points) Can this game be solved by the elimination of dominated strategy? If yes, describe your method and result in detail C. (6 points) Now suppose there is some change to the payoff matrix, find the Nash equilibrium for...
Find all of the pure and mixed strategy Nash equilibrium of the following game: Left 5,10 3.7 2,5 Top 1 Middle Bottom 2 Center Right 4,4 8.8 6.5 2,7 2,2 2,1 Figure 1: A Random Game
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