6.Nash BargainingPlayers 1 and 2 bargain over how to split a pie of size 1. Suppose the playerssimultaneously announce how much of the pie they claim for themselves. Letx; denote the claim of player i e {1,2}. Claims have to satisfy 0 < r; < 1. Ifx1 + x2 <1 then each player gets her claim, i.e. player 1 gets 1 and player 2gets x2. If r1 + x2 > 1, then neither player gets anything. Suppose that eachplayer's utility is strictly increasing in the amount of pie she gets. Find all Nashequilibria.

Given information 2 players= player 1 and player 2 size of pie=1 X1 and X2 = claim for pie Both…

6 Nash Bargaining Players 1 and 2 bargain over how to split a pie of size 1. Suppose the players simultaneously announce how much of the pie they claim for themselves. Let T; denote the claim of player i e {1,2}. Claims have to satisfy 0 < x; < 1. If xi + x2 <1 then each player gets her claim, i.e. player 1 gets r1 and player 2 gets r2. If r1 + x2 > 1, then neither player gets anything. Suppose that each player's utility is strictly increasing in the amount of pie she gets. Find all Nash equilibria.

6 Nash Bargaining Players 1 and 2 bargain over how to split a pie of size 1. Suppose the players simultaneously announce how much of the pie they claim for themselves. Let T; denote the claim of player i e {1,2}. Claims have to satisfy 0 < x; < 1. If xi + x2 <1 then each player gets her claim, i.e. player 1 gets r1 and player 2 gets r2. If r1 + x2 > 1, then neither player gets anything. Suppose that each player's utility is strictly increasing in the amount of pie she gets. Find all Nash equilibria.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

1. Consider the game where initially She chooses between "Stay Home" and "Go Out". If She chooses "Stay Home" then She gets 2 and He gets 0. If She chooses "Go Out" then they each simultaneously choose "Movie" or "Concert" where the payoffs are 0,1 or 3 as in the Battle of the Sexes Game. What are the subgame perfect Nash Equilibria of this game ?
3. Player 1 and Player 2 are going to play the following stage game twice: Player 1 Top Bottom Left 4,3 0,0 Player 2 Middle 0,0 2,1 Right 1,4 0,0 There is no discounting in this problem and so a player's payoff in this repeated game is the sum of her payoffs in the two plays of the stage game. (a) Find the Nash equilibria of the stage game. Is (Top, Left) a Nash of the stage game? (b) Find a subgame perfect Nash equilibrium of the repeated game where the first time they play the stage game Player 1 chooses Top and Player 2 chooses Left.
2. Consider the following simultaneous move stage game. In each cell, player l's payoff is shown first. Player 2 L C R T 3, 1 0 ,0 5 , 0 Player 1 M 2, 1 I, 2 3 , 1 В 1, 0 , 1 4, 4 This game is played twice, without discounting of the second stage payoffs. Both players observe the outcome of the first stage prior to making their second stage choices. Determine whether or not (4,4) can be the first stage payoffs from a pure strategy subgame perfect Nash equilibrium. Explain your answer carefully.
Question 4. Zeynep and Mehmet will eventually play the following game. Mehmet L R U 3,1 0,0 Zeynep D 0,3 1,3 In a preliminary stage, Zeynep has already asked Mehmet to allow her to move first and proposed to pay him 1 unit of her own payoff in exchange. So Mehmet has to options: • If he accepts Zeynep's offer: they will play the sequential move version of the above game in which Zeynep moves first. Mehmet will receive 1 unit of utility more, and Zeynep will receive 1 unit of utility less (in any outcome of the game) compared to the payoffs given in the bimatrix. 2 • If he rejects Zeynep's offer: they will play the simultaneous move game. a. Represent this strategic interaction in a game tree. b. How many information sets does each player have? c. Characterize the set of pure strategies for both players. d. Present this game as a normal-form game, and characterize the set of pure strategy Nash equi- libria.
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.
5 Suppose two players play one of the two normal-form games shown in Figure 1. L U 0,-1 D 2,4 R 2,0 6,0 L U | 4,-1 D 2,-2 R 2,0Now suppose that Player 2 knows which game is being played, but Player 1 does not. Find the pure strategy Bayesian Nash equilibrium of this game.
Consider the following simultaneous game: Player 1 U D Player 2 L 30,20 -10, -10 R -10, -10 20,30 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has two Nash equilibria in pure strategies. Player 1's payoff in each of the Nash equilibria is 30.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. a. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. b. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? d. Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy. с.
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.
4. Suppose that Anne and Bob must simultaneously name a number in the set {1,2, ..., 10}. If they name the same number, the each get a payoff of 1; if they name different num- bers, they each get a payoff of 0. (a) Find all (pure and mixed strategy) Nash equilibria of this game. (b) How many are there? Explain why. (Hint: there are a lot of them!)
Consider the following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
9. For the payoff matrix below, consider a sequential version of the game in which Player 2 moves first and then Player 1 moves second. Which of the following is not a correct statement? Player 1 Top Center Bottom Left 1,2 5,1 6,0 Player 2 Middle 7,1 11,2 -4,3 Right 10,4 1,0 8,5 The subgame perfect payoffs coincide with those of a Nash equilibrium b. Depending on Player 2's move, Player 1 will sometimes optimally choose Bottom c. Player 2 will choose Right in the subgame perfect equilibrium d. Player 2 would be willing to pay a positive $ amount to move first rather than second e. Player 1 would be willing to pay a larger $ amount than Player 2 to move first