Here is a payoff matrix that is interesting. I am not in an imaginative mood, so I won't try to tell a story about why the payoffs come out this way. Find all the pure-strategy Nash equilibria. Is this a game where you expect that players would end up in a Nash equilibrium? What would you expect to happen and why?

Here is a payoff matrix that is interesting. I am not in an imaginative mood, so I won't try to tell a story about why the payoffs come out this way. Find all the pure-strategy Nash equilibria. Is this a game where you expect that players would end up in a Nash equilibrium? What would you expect to happen and why?

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

• (1,0) (1,1) Player 2 G D H (2,0) Action Player 1 Player 1 Action B Player 1 (3,-1) E Player 2 (0,1) (-1,-1) (a) Find all the Subgame Perfect Nash equilibria in this game. (b) Find all the Nash equilibria in this game. (Hint: write the game in strategic form.)
Consider the following simultaneous game: Player 1 U D Player 2 L 30,10 -10, 20 R 10, 20 5,-10 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has a Nash equilibrium. This game has a Nash equilibrium in pure strategies. Player 1's best response is D if player 2 plays R.
A large group of players each guesses a number between 0 and 300. The winner is the person whose number is closest to three-fifth of the average guess. What is the Nash equilibrium? Will it be observed? What do you expect for the outcome of this game with next year's 203 class? (Considering that they have similar sophistication to your class but they have not covered game theory yet.)
For the friend-foe game, recall that there were 3 Nash equilibria possible, but the equilibria set didn't include the cooperative outcome, for which both players would win. Friend Foe Friend 500,500 0,1000 Foe 1000,0 0.0 a) If the game is played répeatedly. propose a play strategy that will enforce cooperation. For what valucs of o (discount factor) the equilibrium will be (Friend. Friend)?
The following table contains the possible actions and payoffs of players 1 and 2. Player 1 U M D L 2,10 2,5 8,7 Player 2 C 5,2 11,8 8,4 R 5,4 2,9 8,3 This is a simultaneous move game. In a pure strategy Nash equilibrium of this game, Player 1 receives a payoff of ✓and player 2 receives a payoff of If, instead of playing simultaneously, player 2 moves first, then in the Nash equilibrium player 1 receives a payoff of ✓and player 2 receives a payoff of
In the game presented in Table, what are the Nash equilibrium strategies for players A and B?
5. Consider the following Extended Form game where P1 stands for Player one and P2 stands for player two with A, B and A', B' being their respective strategies. A' (1,1) P2 B' (2,3) P1 A' B (4,5) P2 What is the set of Nash Equilibria? Clearly explain your answer. Full-screen Snip B' (6,7)
Consider the following game : Stag Rabbit Stag 9, 9 0, 8 Rabbit 8, 0 7, 7 The first payoff is that of player 1 and the second that of player 2. a. ) Draw the extensive form of the simultaneous game. Find all the Nash equilibrium. p. Suppose player 1 moves first or we are in a sequential game now. Draw the extensive form in the sequential version. c. What is the subgame perfect Nash Equilibrium (SPNE) in the sequential version? d. ) Explain why it is an SPNE.
Consider Bernard \ Mary Left Center Right Top 0,5 1,0 2,2 Bottom 1,0 0,3 2,2 The first number in a cell denotes the payoff to Bernard and the second number denotes the payoff to MaryForexample: πB(B,L)=1and πM(T,L)=5. a Give all pure strategy Nash equilibria of this one-shot game, if any. Briefly explain.Let Bernard play Top with probability p and Bottom with probability 1 − p; let Mary play Left with probability qL , Center with probability qC and Right with probability qR = 1 − qL − qC . b Give all mixed strategy Nash equilibria of this game.
し(5,3) b I(2,2) も(0,0) (4,12) a (12.4) (0,0) i). List all subgame pertect Nash equilibria and name one Nash eqvilibrivm that is not subgame pertect i). How many strategies does playot and player 2 have?
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.
The payoff matrix below shows the payoffs for Firm A and Firm B, each of whom can either "cooperate" or "cheat." The numbers in parentheses are (payoff for A, payoff for B). Firm B Cooperate Cooperate (30, 30) (x, 10) Cheat (10, X) (20, 20) Firm A Chent If x = 40, the Nash equilibrium is. O a. (Firm A: cheat, Firm B: cheat) O b. (Firm A: cooperate, Firm B: cheat) O c. (Firm A: cheat, Firm B: cooperate) O d. (Firm A: cooperate, Firm B: cooperate) O e. There is no Nash equilibrium for this value of x.