Problem 3.Consider the following two-player game. Player 1 (the row player) has three strategies {U, F, D},and Player 2 (the column player) has four strategies {L, M, N, R}. In each cell, the first number isthe pay-off of Player 1, and the second is that of Player 2. There is an unknown x in the table.Consider pure strategies only.UFDL(0, 3)(6,0)(3, 1)M(1,0)(5, 1)(4,2)N(2,5)(x, 2)(1, 1)R(4,2)(5, 1)(1, 3)(1) Find a number x such that {F, N} is the unique Nash equilibrium.(2) Find a number x such that the game has more than one Nash equilibria. Whatare these Nash equilibria in this case?(3) Is it possible to find a number x such that the game has no Nash equilibrium?For each of your answers above, an explanation needs to be provided.

Problem 3. Consider the following two-player game. Player 1 (the row player) has three strategies {U,F,D}, and Player 2 (the column player) has four strategies {L, M, N, R}. In each cell, the first number is the pay-off of Player 1, and the second is that of Player 2. There is an unknown x in the table. Consider pure strategies only. UFD D L (0, 3) (6,0) (3, 1) M (1,0) (5, 1) (4,2) N (2,5) (x, 2) (1, 1) R (4,2) (5, 1) (1,3)

Problem 3. Consider the following two-player game. Player 1 (the row player) has three strategies {U,F,D}, and Player 2 (the column player) has four strategies {L, M, N, R}. In each cell, the first number is the pay-off of Player 1, and the second is that of Player 2. There is an unknown x in the table. Consider pure strategies only. UFD D L (0, 3) (6,0) (3, 1) M (1,0) (5, 1) (4,2) N (2,5) (x, 2) (1, 1) R (4,2) (5, 1) (1,3)

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

Player 1 is on the horizontal and Player 2 is on the vertical. Based on the following payoff matrix, what is a Nash Equilibrium strategy profile? C R (6,5) (4,1) (1,2) M (2,9) (7,5) (6,10) (3,1) (7,2) (4,3) O (B,L) O There is no Nash Equilibrium. O (B,C) O (M,R) O (M,L) Step 2
Consider the following Guessing Game. There are n = 10 players simultaneously choosing a number in {1, 2, 3}. The winners are those closest to 1/2 the average guess (they evenly split the prize between the winners if there is more than one). Find the set of rationalizable strategy profiles. Justify your answer. please no handwriting and this course about game theory (topic Rationalizability) answer with all steps, please
2. Consider the two-player strategic form game represented in the following payoff table: t 1 m b 7,2 1,2 3,7 2 M 2,4 3,4 1,6 R 1,3 7,1 4,2 Player 1 chooses between rows, S₁ = {t, m, b), and receives the first listed payoff in each cell. Player 2 chooses between columns, S₂ = {L, M, R), and receives the second listed payoff in each cell. a. Does either player have a strictly dominant strategy? Explain. b. Explaining your steps carefully, identify the set of rationalizable strategies in this game. c. Making sure to explain your solution method, solve for all pure strategy Nash equilibria in this game.
2- Consider the following game. Player 2 Player 1 U 12, 2 | 3, 9 5, 8 4, 2 D (a) Find all the Nash equilibria, pure and mixed. (b) Suppose that the payoff of the column player u:(D, L) is reduced from 8 to 6, but all other payoffs remain the same. Again, find all the pure- and mixed-strategy Nash equilibria. (c) Compare the mixed-strategy equilibria in parts (a) and (b). Did this worsening in one of player 2's payoffs change player 2's equilibrium mixed strategy? Did it change player l's? Give some intuition.
Refer to Table Left-Right-ZigZag. How many pure strategy Nash equilibria does this game have? Table: Left-Right-ZigZag Player 1 Drive left Driver right Zigzag 1) 1 2) 2 3) 3 4) 4 5) None of the above. Drive left (1,1) (-1,-1) (0,0) Player 2 Driver right (-1,-1) (1,1) (0,0) Zigzag (0,0) (0,0) (0,0)
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.
Finding Nash Equilibria Consider the following two player, normal form game: Player 1 Player 2 C L (2,1) U M (-2,-2) D R (2, -1) (1,2) (-1, 1) (0,0) (3,1) (0,0) (-1,-1) Find all pure and mixed strategy Nash equilibria. Calculate each player's expected payoffs at each equilibrium.
Consider the following two player game. In each cell the first number refers to the payoff to Player 1 while the second number refers to the payoff to Player 2. Suppose the two players move simultaneously (at the same time). Which one of the following statements is CORRECT? Player #1 Player #2 Top Bottom Left 7.7 4.0 Right 0,4 4,4 O There are three equilibria in this game: two pure strategy equilibria at [Top, Left] and [Bottom, Right) and al third equilibrium in mixed strategies. In the mixed strategy equilibrium of this game. Player 1 should play Top with probability 2/5 and Bottom with probability 3/5; Player 2 should play Left with probability 2/5 and Right with probability 3/5. O There are three equilibria in this game; two pure strategy equilibria at (Top. Left) and (Bottom, Right) and a third equilibrium in mixed strategies. In the mixed strategy equilibrium of this game, both players should randomize over the strategies with probability and %. O There is a unique dominant…
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any dominated strategies in this game. If there are none, state this clearly.
Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
Use the following payoff matrix for a one-shot game to answer the accompanying questions. Player 2 Strategy X Y Player 1 A 30, 30 16, -50 B -50, 16 50, 50 A. Determine the Nash equilibrium outcomes that arise if the players make decisions independently, simultaneously, and without any communication. check all that apply (16, −50) (−50, 16) (30, 30) (50, 50) Which of these outcomes would you consider most likely? multiple choice (16, −50) (50, 50) (−50, 16) (30, 30) B. Suppose player 1 is permitted to “communicate” by uttering one syllable before the players simultaneously and independently make their decisions. What should player 1 utter? multiple choice A or B What outcome do you think would occur as a result? multiple choice (−50, 16) (16, −50) (30, 30) (50, 50) c. Suppose player 2 can choose its strategy before player 1, that player 1 observes player 2’s choice before making her decision, and that this move structure is…
Define a new game as a modified version of the game in Problem 1, which we will call the Matching Two Pennies game: each player choose heads (H) or tails (T) for two pennies. In this game, Player 1 wins if both coins show the same combination of heads and tails, while Player 2 wins if they do not. (a) Write the strategy sets S1 and S2 for this game. (b) Give the payoffs for each player in this Matching Two Pennies game, by defining T;(81, 82) for each player and for each strategy pair, either as a list or in matrix form.