Roger and Rafael play a game with the following rules. Roger is given $250 to divide between himself and Rafael. Rafael does not get to choose but he can reject Roger’s offer if he does not like it. If Rafael rejects, both get nothing. If Rafael accepts, both get the split that Roger decided.

Roger and Rafael play a game with the following rules. Roger is given $250 to divide between himself and Rafael. Rafael does not get to choose but he can reject Roger’s offer if he does not like it. If Rafael rejects, both get nothing. If Rafael accepts, both get the split that Roger decided.

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter16: Bargaining

Section: Chapter Questions

Problem 3MC

See similar textbooks

Similar questions

Consider a sequential game where there are two players, Jake and Sydney. Jake really likes Sydney and is hoping to run in to her at a party this weekend. Sydney can't stand Jake. There are two parties going on this weekend and each player's payoffs are a function of whether they see one another at the party. The payoff matrix is as follows: Sydney Party 1 Party 2 Party 1 6, 18 18, 6 Jake Party 2 24,8 0,24 a) Does this game have a pure strategy Nash Equilibrium? b) What is the mixed strategy Nash Equilibrium? c) Now suppose Sydney decides what party she is going to first. Her roommate is friends with Jake and will call him to tell him which party they go to. Write the extensive form of this game (game tree). d) What is the subgame perfect Nash equilibrium from part c?
Sam and Sarah are thinking about getting married. However if either of them cheats on the other, they would get a payoff of 10, while the other person gets zero. If neither cheat, they stay with each other and get a payoff of 7 each and if both cheat, the relationship falls apart and each get a payoff of 1. What is the Nash equilibrium of this game? a. Cheat, Cheat b. Not cheat, Not cheat Sam cheats, Sarah doesn't Sarah cheats, Sam doesn't
Part 1 Sam and Ray do not like each other and will be miserable if they attend the same event. Both are going out Friday night to either the bar or a concert; and Sam will publicly tweet where he is going before Ray makes his plans. Each will get 6 payoff from going to a concert and 2 benefit from going to the bar if the other is not there. If both go to the same venue, they will get a payoff of zero. Write a game tree for this game and find the equilibrium strategy and equilibrium payoffs clearly labeling both. Part 2 Take the game from the question above and switch the order of the decisions. Write a game tree for this game and find the equilibrium strategy and equilibrium payoffs clearly labeling both. Has the equilibrium strategies and payoffs changed from the question above? Explain why.
Emma and Mia are invited to two events A and B. They want to go to both events but are not on speaking terms. Going to event A results in a payoff of 5 while going to B results in a payoff of 4. When they go to the same event, they each get a payoff of -8. 6. Write the payoff table for this game. 7. Find the maximin solution. (Show the steps leading to the solution.) 8. Find the Nash Equilibrium. (Show the steps leading to the NE.)
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. с.
Amir and Beatrice play the following game. Amir offers an amount of money z € [0, 1] to Beatrice. Beatrice can either accept or reject. If Beatrice accepts, then Amir receives 1 - z dollars and Beatrice receives a dollars. If Beatrice rejects, then both receive no money. As in the Ultimatum Game, Amir cares only about maximizing the amount of money he receives. Beatrice, on the other hand, detests Amir, and therefore cares about the amount of money that both receive: if Amir receives y dollars and Beatrice receives a dollars, then Beatrice's payoff is a-ay where a > 0. (a) Find all pure strategy Nash equilibria of the game in which the two players choose simultaneously (thus Beatrice accepts or rejects without seeing Amir's offer). Solution: The NE are the strategy profiles in which Beatrice rejects and Amir's offer a satisfies 2-a(1-x) ≤0, i.e. r ≤a/(1+a). (b) Find all subgame perfect equilibria of the sequential game in which Amir first makes the offer and Beatrice observes the offer…
You and I play the following game. Hidden from you, I put a coin in my hand: with probability p it is a 10 pence coin and otherwise it is a 20 pence coin. You now guess which coin is in my hand: you guess it is 20 pence with probability s and otherwise you guess it is a 10 pence coin. You get to win the coin if you guess correctly and otherwise win nothing. What (in terms of p and s) is your expected gain in pence from playing this game once with me? Challenge: suppose we are going to play repeatedly and you want to maximise your gain and I wish to minimise my loss. What value of p should I choose and what value of s should you choose? (This question is somewhat ill-defined, but it does have an interesting possible answer.) (Note: anything labelled "challenge" will not be part of the hand-in.)
In a small town there are two pizza restaurants . If neither restaurant advertises, its revenue will not change. If only one firm advertises, the firm that advertises will double its revenue and the firm that doesn't advertise will see a decrease in its revenue, but if both firms advertise, their revenue will not change. What outcome would be predicted by game theory in this market? Both restaurants will advertise. Game theory would predict chat sometimes one restaurant would advertise, and the rest of the time both will advertise. Neither restaurant will advertise Game theory is only a theory and cannot predict real-world events. One restaurant will advertise.
Consider the following sequential game. Wally first chooses L or H. Having observed Wally's choice, Elizabeth chooses between A and F. The payoffs are as follows. If Wally chose L and Elizabeth chose A, the payoffs are 30 to Wally and 20 to Elizabeth. If Wally chose L and Elizabeth F, the payoffs are 40 to Wally and 10 and to Elizabeth. If Wally decides to opt for H and Elizabeth A, the payoffs are 10 and 2 to Wally and Elizabeth, respectively. Finally, if Wally opts for H and Elizabeth F, the payoffs are 35 toWally and 5 to Elizabeth. What is the outcome in the subgame perfect equilibrium of this game? (L,F) (H,A) (H,F) and (L,F) (L,A) and (H,F) (H,F)
Consider a game where player A moves first, choosing between Left and Right. Then, after observing player A’s choice, player B moves next choosing between Up and Down. Which of the following is true? This is a game where players A and B have the same number of strategies. Player A will get a higher payoff than player B as A moves first. This is game will only have one Nash equilibrium. This is a game of perfect information.
Tucker and Eddie are playing the following game. Tucker can choose A or B and Eddie can choose C or D. The first payoff is for Tucker, the second for Eddie. Eddie Tucker C D A 3, 2 4, 3 B 4, 5 3, 4 Identify the Nash equilibrium(s) in this game. What rational game theoretic advice would you offer Tucker and Eddie on how to play this game? If Tucker and Eddie follow your advice, what payoff should each expect? Show your work.
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.