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.

Pure strategy Nash Equilibrium: Nash equilibrium with 2 players is the strategy profile where both…

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)

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 9MC

See similar textbooks

Similar questions

Consider the below payoff matrix for a game of chicken. Two players drive their cars down the center of the road directly at each other. Each player chooses SWERVE or STAY. Staying wins you more payoff only if the other player swerves. Swerving loses face if the other player stays. However, the worst outcome is when both players stay. Stay Swerve Stay -0,-0 -6,6 Swerve 6,-6 9,9 Player 1 chooses rows and Player 2 chooses columns. Denote the probability of "Stay" for Player 1 as p and for Player 2 as 9. What is the value of p so that Player 2 is indifferent between Stay and Swerve? Write your answer as a decimal number with 2 decimal places (e.g. 0.05)
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.
Consider the following two-player game.First, player 1 selects a number x≥0. Player 2 observes x. Then, simultaneously andindependently, player 1 selects a number y1 and player 2 selects a number y2, at which pointthe game ends.Player 1’s payoff is: u1(x; y1) = −3y21 + 6y1y2 −13x2 + 8xPlayer 2’s payoff is: u2(y2) = 6y1y2 −6y22 + 12xy2Draw the game tree of this game and identify its Subgame Perfect Nash Equilibrium.
Consider two players in the game-theoretic setting below: Player 2 Choice A Choice B Choice 20 |-30 A -20 30 Player 1 Choice |-30 40 B 30 -40 What is the (pure-strategy) Nash equilibrium? There are more than one (pure-strategy) Nash equilibria. O (P1, P2) = (A, B) is the only (pure-strategy) Nash equilibrium. O (P1, P2) = (A, A) is the only (pure-strategy) Nash equilibrium. O There is no (pure-strategy) Nash equilibrium. O (P1, P2) = (B, A) is the only (pure-strategy) Nash equilibrium. (P1, P2) = (B, B) is the only (pure-strategy) Nash equilibrium.
Please find herewith a payoff matrix. In each cell you find the payoffs of the players associated with a particular strategy combination: The first entry is the payoff of player 1, the second entry is the payoff of player2. Player 2 t1 t2 t3 Player 1 S1 3, 4 1, 0 5, 3 S2 0, 12 8, 12 4, 20 S3 2, 0 2, 11 1, 0 Suppose both players select their strategies (S1, S2 or S3 for player 1 and t1, t2 or t3 for player 2) simultaneously and that the game is played once. In your explanation to the questions below, please do refer to the figures in the matrix. Suppose player 2 could move before player 1 (i.e. has a first mover advantage). In your explanation to the questions below, please do refer to the figures in the matrix. What strategy would (s)he select? Is it really an ‘advantage’ for player 2 to move first? Or does player 2 benefit from being the second mover (and hence player 1 moving first)? I.e. for this question, do not make a comparison to the outcome of the…
Consider the following centipede game consisting of two players, Pl and P2. The left/right number each terminal node represents Pl's/P2's payoff, respectively. Then, answer the following questions of [D5] and [M5]-|M8]: P1 G P2 P1 G -(0, 2) D (2, 0) (1, 1) (4, 0) Suppose that P2 chooses G or D randomly. Then, what is the Pl's best response of P1 for the P2's choice? And explain why. We assume that random choice is level-0 in the level-k theory. Then, answer the P2's choice in level-2. (a) D (b) G (c) random choice on (G, D) (d) G with probability 1/3 Answer all the properties of Nash equilibrium and subgame perfect equilibrium which is derives from the backward induction. (a) All subgame perfect equilibria are Nash equilibria in any game. (b) All Nash equilibria are subgame perfect equilibria in any game. (c) There is always a unique Nash equilibrium in any game. (d) There exist pure-strategy Nash equilibria in any game. (e) The Nash equilibrium in prisoners' dilemma game is socially…
Describe the game and find all Nash equilibria in the following situation: Each of two players chooses a non-negative number. In the choice (a1, a2), the payoff of the first player is equal to a1(a2 - a1), and the payoff of the second player is equal to a2(1 – a1 – a2).
Suppose Company A is about to play a game with Company B. The following facts are known about the two players. The first Company (Company A) is a row player and uses three different strategies i.e. (Strategy X, Strategy Y and Strategy Z). Whereas the column player (Company B) has two different strategies i.e. (M and N) that can be used accordingly. The payoff matrix is given in the table below. Player B Player A M N X -5 3 Y 3 -7 Z -6 5 Answer the following questions based on the information given above a. Determine the strategies of each firm using graphical technique b. Compute the value of the game.
a) Find the Nash equilibria in the game (in pure and mixed strategies) and the associated payoffs for the players. b) Now assume that the game is extended in the following way: in the beginning Player 1 can decide whether to opt out (this choice is denoted by O) or whether to play the simultaneous-move game in a) (this choice is denoted by G). If Player 1 opts out (plays O) then both Player 1 and Player 2 get a payoff of 4 each and the game ends. If Player 1 decides to play G, then the simultaneous-move game is played. Find the pure-strategy Nash equilibria in this extended version of the game. (Hint: note that Player 1 now has 4 strategies and write the game up in a 4x2 matrix.) c) Write the game in (b) up in extensive form (a game tree). Identify the subgames of this game.
Consider a normal form game in which player 1 has three strategies, A1, B1, C1 and player 2 has three strategies, A2, B2, C2. Suppose that A1 is a best response to B2, B1 is a best response to A2, A2 is a best response to B1, and B2 is a best response to A1. Do we know with certainty whether A1 is rationalizable or not?
With what probability does player 1 play Down in the mixed strategy Nash equilibrium? (Input your answer as a decimal to the nearest hundredth, for example: 0.14, 0.56, or 0.87). PLAYER 1 Up Down PLAYER 2 Left 97,95 47, 33 Right 8,43 68,91
Question 1 Consider the following game. Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions (Left, Middle, Right). Each player chooses their action simultaneously. The game is played only once. The first element of the payoff vector is player 1’s payoff. Note that one of the payoffs to player 2 has been omitted (denoted by x). 1. Determine the range of values for x such that Player 2 has a strictly dominant strategy.