(a) Find all (pure or mixed) Nash equilibria in the following two-player game: L C R U 2,4 -2, 2 -2,0 D-2,0 -1,6 0,8 (b) Find all (pure or mixed) Nash equilibria in the following three-player game: player 1 chooses the row, player 2 chooses the column, player 3 chooses the matrix. X Y Y X 3,-2, 4 0,-3,2 Y 0,-3,2 0,-3,2 х 0, -3,2 | 0,-3, 2 Y 0,-3,2 12, 1, 10 Y

(a) Find all (pure or mixed) Nash equilibria in the following two-player game: L C R U 2,4 -2, 2 -2,0 D-2,0 -1,6 0,8 (b) Find all (pure or mixed) Nash equilibria in the following three-player game: player 1 chooses the row, player 2 chooses the column, player 3 chooses the matrix. X Y Y X 3,-2, 4 0,-3,2 Y 0,-3,2 0,-3,2 х 0, -3,2 | 0,-3, 2 Y 0,-3,2 12, 1, 10 Y

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

(d) Consider a simultaneous-move game between two firms choosing to sell their product at either £6, £7 or £8. The actions and payoffs are given in the matrix below. Firm 2's Prices £6 £7 £8 Firm 1's prices £6 4, 5 3, 5 2, 1 £7 0,4 2, 1 3,0 £8 -1, 1 4, 3 0, 2 What are the Nash equilibria of this game? Game theory is often used by firms competing under an oligopoly as a means of determining their best strategy. Why is game theory a useful tool and which characteristics of an oligopoly make it particularly useful for firms competing in this market structure? One outcome of an oligopoly is that firms may have an incentive to collude. Explain some of the conditions that make collusion more likely to occur and how game theory can explain why collusive agreements often break down.
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)
In the following symmetric general sum game (2, 2) (0,0) (0,0) (0,0) (0,0) (2, 2) (0,0) (2,2) (0,0) (i) Find all pure Nash equilibria. (ii) Find all mixed Nash equilibria in which all probabilities are positive. (vi) Which of these are evolutionary stable strategies?
Which is false for the following game? C R. T. 3, 2 0,3 3, 3 M 5,0 4, 1 3, 1 B 2, 2 4, 5 1, 1 A. (M,C) and (B,C) are the only pure strategy Nash Equilibria OB. There is a Nash cquilibrium in which R is played with positive probability C. There is no Nash equilibrium in which L is played with positive probability OD. There is no Nash equilibrium in which both players choose two of their actions with positive probability
A small community has 10 people, each of whom has a wealth of $3,000. Each individual must choose whether to contribute $300 or $0 to the support of public entertainment for their community. The money value of the benefit that a person gets from this public entertainment is one half of the total amount of money contributed by all individuals in the community. This game has a Nash equilibrium in which 5 people contribute $300 and for public entertainment and 5 people contribute nothing. This game has a dominant strategy equilibrium in which nobody contributes anything for public entertainment. This game has no Nash equilibrium in pure strategies, but has a Nash equilibrium in mixed strategies. This game has a dominant strategy equilibrium in which all 10 citizens contribute $300 to support public entertainment. This game has two Nash equilibria, one in which everybody contributes $300 and one in which no- body contributes $300.
GAME UUU B1 Player B B2 A1 7,13 5, 10 A2 3,8 9,16 Player A A3 5,8 4,7 In Game UUU (see table above), assuming players move simultaneously, Player A choosing A1 and Player B choosing B3 is a Nash equilibrium. Player A choosing A3 and Player B choosing B2 is a Nash equilibrium. Both Player A choosing A1 and Player B choosing B1 and Player A choosing A2 and player B choosing B2 are Nash equilibria in pure strategies Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.
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
Team 2 plays A Team 2 plays B Team 2 plays C Team 1 plays A 9, 9 8, 12 6, 6 Team 1 plays B 6, 6 0, 7 5, 5 Team 1 plays C 12, 8 10, 10 7,0 Consider the simultaneous move game above in which two teams are competing against each other. Which of the following statements are true? In all Nash Equilibria of the game Team 2 plays B This game has two Nash Equilibria Team 1's best response to team 2 playing B is to play A. O None of the other answers are correct This game has a mixed strategy Nash Equilibria where a player randomizes over multiple options.
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
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.
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.
A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?