1. Players 1 and 2 are bargaining over how to split 5 dollars. Player 1 proposes to take si dollars (81 should be an integer), leaving (5-81) dollars for player 2. Then player 2 either accepts or rejects the offer. If player 2 accepts the offer, then the payoffs are s₁ dollars to player 1, and (5-s₁) dollars to player 2. If player 2 rejects the offer, then the payoffs are zero to both. How many subgame-perfect Nash equilibria are there in the game?

1. Players 1 and 2 are bargaining over how to split 5 dollars. Player 1 proposes to take si dollars (81 should be an integer), leaving (5-81) dollars for player 2. Then player 2 either accepts or rejects the offer. If player 2 accepts the offer, then the payoffs are s₁ dollars to player 1, and (5-s₁) dollars to player 2. If player 2 rejects the offer, then the payoffs are zero to both. How many subgame-perfect Nash equilibria are there in the game?

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

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.
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.
6. There are 2 players who have to decide how to split one dollar. The bargaining process works as follows. Players simultaneously announce the share they would like to receive $₁ and $2, with 0 ≤ $1, S2 ≤ 1. If $1 + $2 ≤ 1, then the players receive the shares they named and if 8₁ + 82 > 1, then both players fail to achieve an agreement and receive zero. Which of the following strategy profiles is a pure strategy Nash equilibrium? O a) (0.3, 0.7); Ob) (0.5, 0.5); O c) (1.0, 1.0); Od) All of the above
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?
14. You have baked a cake, but your two dear daughters won't stop fighting on who gets the biggest slice. To settle the dispute, to ask your dear daughter one (DD1) to cut the cake and your dear daughter two (DD2) to choose which piece she wants. (a) Draw the extensive form of the game. Let dear daughter one's strategies be "Cut Evenly" or "Cut Unevenly"; depending on what is on the platter, dear daughter two's strategies might in- clude "Take Big Slice", "Take Small Slice", or "Take Equal Slice". Assign payoffs to dear daughter one and dear daughter two that grow with the size of the slice that they receive. (b) Use backward induction to find the equilibrium outcome of this game. (c) Is the promise to take a small slice by DD2, if DD1 cuts unevenly, credible? Explain carefully. (d) After the rules are announced, dear daughter two says "It is not fair! I want to be the one who gets to cut the cake, not the one who chooses the slice!". Is dear daughter two's complaint valid? You are…
Paramter y = 0 If ⟨a, d⟩ is played in the first period and ⟨b, e⟩ is played in the second period, whatis the resulting (repeated game) payoff for the row player?
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.
A game is played as follows: First Player 1 decides (Y or N) whether or not to play.If she chooses N, the game ends. If she chooses Y, then Player 2 decides (Y or N) whetheror not to play. If he chooses N the game ends. If he chooses Y, then they go ahead and playanother game with the payoffs shown below. A player who opts out by choosing N gets 2 andthe other player gets 0. Draw the tree of this game and then find the two subgame-perfect Nashequilibria.
1. A row of minus signs is written on a whiteboard (can be any number). Two players take turns in replacing either a single minus sign by a plus sign or two adjacent minus signs by two plus signs. The player who makes the last move wins. Discuss the possible strategy for the first mover to force a win.
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)
Consider the following extensive form game between player 1 and player 2. T B (2, 2) L R R (3, 1) (0, 0) (5, 0) (0, 1) (a). Find the normal form representation of this game. (show the bimatrix) (b). Find all pure strategy NE. (c). Which of these equilibria are subgame perfect?
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. с.