Consider a payoff matrix of a game shown below. In each cell, the number on the left is a payoff for Player A and the number on the right is a payoff for Player B. In order for (Down, Right) to be a unique pure strategy Nash equilibrium, a must be (greater, or smaller) than 3 and b must be (greater, or smaller) than 3.

Consider a payoff matrix of a game shown below. In each cell, the number on the left is a payoff for Player A and the number on the right is a payoff for Player B. In order for (Down, Right) to be a unique pure strategy Nash equilibrium, a must be (greater, or smaller) than 3 and b must be (greater, or smaller) than 3.

Microeconomics: Principles & Policy

14th Edition

ISBN:9781337794992

Author:William J. Baumol, Alan S. Blinder, John L. Solow

Publisher:William J. Baumol, Alan S. Blinder, John L. Solow

Chapter13: Between Competition And Monopoly

Section: Chapter Questions

Problem 3TY

See similar textbooks

Similar questions

Consider a two-player game in which the players take turns, with player 1 moving first. When it is a player's turn, she must announce a number between 1 and 3. The announced number is added to the previously announced numbers. The player who announces the number such that the sum of all announced numbers is 6 wins (receives 1) and the other loses (receives 0). Please indicate whether or not each of the following sequences of announcements is a Nash equilibrium of the game. Hint: Think about how one verifies whether or not a pair of strategies is a Nash equilibrium. P1 says 3, then P2 says 2, then P1 says 1 P1 says 1, then P2 says 3, then P1 says 2 P1 says 2, then P2 says 3, then P1 says 1 P1 says 3, then P2 says 1, then P1 says 2
The strategies and payoffs are given in the table. The first number of each payoff pair in the matrix is the payoff of player P1, and the second is the payoff of player P2. P2 Strategies Left Right P1 Up (2, 4) (1, 3) Strategies Down (1, 6) (6, 5) Select each pair of actions that would be a Nash Equilibrium of the above game. Up, Left Down, Left Up, Right Down, Right
Consider the following sequential game. Player 1 plays first, and then Player 2 plays after observing the choice of Player 1. At the bottom of the decision tree, the first number represents the payoff of Player 1, while the second number represents the payoff of Player 2. For player 2, A stands for Accommodate and F stands for Fight. Player 1 Enter Player 2 A F A Stay out Player 2 F (16,30) (-6,18) In the Nash equilibrium of this game, player 2 earns Player 2 player 1 would play (0,40) (0,20) ✓an incentive to threaten F because, if player 1 believed him then so that player 2 would earn ✓. However, this threat is
Find all of the Nash equilibrium of the following three player game. Player 1 chooses rows (a,b). Player 2 chooses columns (c,d). Player 3 chooses matrices (x.y). Player 3 receives the third listed payoff for cach outcome. 5,5,5 4,4,0 8,8,3 7,7,3 1,3,1 4,2,0 3,2,4 3,1,0 a by A) (b,d.x) and (a,d.y) B) (b.cy) OC) (b,d,x) D) (a,d,x) and (b,c.y) E) (b,c,x) OF) (a,d.x)
A and B are competitors in the mobile phone industry. Both A and B have to decide whether to participate or not to participate in a Phone for the Future Trade Fair next month. The matrix payoff below shows the profits (USD million) corresponding to their actions. a) What is the Nash equilibrium of the above game? b) Is the Nash equilibrium Pareto Optima? Explain. c) Suppose B is pessimistic of A's rationality, what is B's strategy? Compare and comment on B's strategy in (a) and (c). A Participate Do not participate B Participate Do not participate 400,1000 200,200 500,500 1000,400
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)
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).
Use the following payoff matrix for a one-shot game to answer the accompanying questions. Player 2 Strategy X Y Player 1 A 50, 50 -110, 6 B 6, -110 26, 26 a. Determine the Nash equilibrium outcomes that arise if the players make decisions independently, simultaneously, and without any communication.check all that apply (26,26) (50,50) (-110,6) (6,-110) Which of these outcomes would you consider most likely?multiple choice 1 (-110,6) (50,50) (6,-110) (26,26) 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 2 B A What outcome do you think would occur as a result?multiple choice 3 (26,26) (50,50) (-110,6) (6,-110) 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…
Question 15 1 pts Consider a small town that has two grocery stores from which residents can choose to buy a gallon of milk. The store owners each must make a decision to set a high milk price or a low milk price. The payoff table, showing profit per week, is provided below. The profit in each cell is shown as (Store 1. Store 2). From the table below, what is the Nash Equilibrium of this price-setting game? Store 2 Low Price Store 1 Low Price High Price (500, 500) (100, 8000 O Grocery store 1: Low price; Grocery store 2: Low price Grocery store 1: Low price: Grocery store 2: High price Grocery store 1: High price: Grocery store 2: How price Grocery store 1: High price: Grocery store 2: High price
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 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.
Consider the following simultaneous game: Player 1 U D Player 2 L 30,20 -10, -10 R -10, -10 20,30 Suppose player 1 plays a mixed strategy in which she plays U 25% of the time and D 75% of the time, and player 2 plays a mixed strategy in which she plays L 25% of the time and R 75% of the time. This pair of strategies ✓a Nash equilibrium. Player 1's expected payoff from playing U (when player 2 plays the mixed strategy above) is