Splitting Pizza: You and a friend are in an Italian restaurant, and the owner offers both of you a free eight-slice pizza under the following condition. Each of you must simultaneously announce how many slices you would like; that is, each player i ∈ 1, 2 names his desired amount of pizza, 0 ≤ si ≤ 8. If s1 + s2 ≤ 8 then the players get their demands (and the owner eats any leftover slices). If s1 + s2 > 8, then the players get nothing. Assume that you each care only about how much pizza you individually consume, and the more the better.What outcomes can be supported as pure-strategy Nash equilibria?

Splitting Pizza: You and a friend are in an Italian restaurant, and the owner offers both of you a free eight-slice pizza under the following condition. Each of you must simultaneously announce how many slices you would like; that is, each player i ∈ 1, 2 names his desired amount of pizza, 0 ≤ si ≤ 8. If s1 + s2 ≤ 8 then the players get their demands (and the owner eats any leftover slices). If s1 + s2 > 8, then the players get nothing. Assume that you each care only about how much pizza you individually consume, and the more the better.What outcomes can be supported as pure-strategy Nash equilibria?

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

Chapter15: Strategic Games

Section: Chapter Questions

Problem 15.1IP

See similar textbooks

Similar questions

two players, a and b are playing an asymmetrical game. there are n points on the game board. each turn player a targets a pair of points and player b says whether those two points are connected or unconnected. a can target each pair only once and the game ends when all pairs have been targeted. player b wins if a point is connected with all other points on the very last turn, while player a wins if any point is connected with all other points on any turn but the very last one or if no point is connected to all other points after the last turn. for what values of n does either player have a winning strategy?
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does this game have a Nash Equilibrium? (If not, why not? If yes, what is the Nash Equilibrium?)
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does Jerry have any strictly dominant strategy? Does Elaine?
Consider the following game played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
Two street racers are playing a simultaneous game of chicken. They have to race towards each other and whoever swerves first is chicken and faces shame, a loss of 8. while the winner enjoys a gain of 3. If neither stop, they would crash into each other, a loss of 10. If both of them swerve at the same time, they are both chicken and face a loss of 5 each If player B destroys his own brakes before the race, and player A sees that, what would the new Nash equilibrium be in this case? a. Player A stops, Player B does not b. Player B stops, Player A does not c. Both players stop d. Neither players stop
Two partners start a business. Each has two possible strategies, spend full time or secretly take a second job and spend only part time on the business. Any profits that the business makes will be split equally between the two partners, regardless of whether they work full time or part time for the business. If a partner takes a second job, he will earn $20,000 from this job plus his share of profits from the business. If he spends full time on the business, his only source of income is his share of profits from this business. If both partners spend full time on the business, total profits will be $200,000. If one partner spends full time on the business and the other takes a second job, the business profits will be $80,000. If both partners take second job, the total business profits are $20,000. a) This game has no pure strategy Nash equilibria, but has a mixed strategy equilibrium. b) This game has two Nash equilibria, one in which each partner has an income of $100,000 and one in…
Consider the game Ms. Bennet and Mr. Darcy play in ‘First Impressions’, Selected Set V. Suppose that Ms. Bennet prefers to meet Mr. Darcy (a = 0) with probability p. Further suppose that: - The ‘meeting Ms. Bennet’ plays Ball with probability q (and Dinner with probability 1 − q); - ‘avoiding Ms. Bennet’ plays Ball with probability r (and Dinner with probability 1 − r); M - r. Darcy plays Ball with probability s (and Dinner with probability 1 − s). Write down the strategic form game and find for all values of p ∈ (0, 1) the Bayesian-Nash equilibria in mixed strategies.
A backpacker gets stranded on an island, and rescue is about a week away. Two cannibals live on the island. The cannibals are not friendly to each other, and both regularly attempt to eat the other. Both cannibals would like to eat the backpacker, but as we all know, a big meal makes one tired and defenceless. In the event that one of them eats the backpacker, the other might strike and eat the eater. Hence, if choosing to eat the backpacker, there is a risk of being eaten oneself. If both of them show up to eat the backpacker, they are friendly enough to share and split the backpacker in half. Both cannibals have a less desirable, vegetarian, diet available on the island.Let eating the (entire) backpacker or cannibal give a payoff of 2. A vegetarian diet is worth 1. Being eaten gives a payoff of 0.a) Write down the normal form representation of the game between the two cannibals.b) The backpacker realizes that the cannibals (otherwise) are highly intelligent and rational beings.…
Which of the following is FALSE for the grim trigger strategy and the infinite horizon repeated Prisoner's Dilemma game illustrated above? A. In the grim trigger strategy profile, if a player chooses D in a period, then both players chooses D forever after that period B. The threshold discount factor for sustaining cooperation under grim trigger strategy depends on the utility numbers in the stage game C. If all utility numbers remain the same but 3 is replaced by 5 in the stage game, then cooperation CANNOT be sustained in this game for all possible values of the discount factor.
Two athletes of equal ability are competing for a prize of $10,000. Each is deciding whether to take a dangerous performance enhancing drug. If one athlete takes the drug, and the other does not, the one who takes the drug wins the prize. If both or neither take the drug, they tie and split the prize. Taking the drug imposes health risks that are equivalent to a loss of X dollars. a) Draw a 2×2 payoff matrix describing the decisions the athletes face. b) For what X is taking the drug the Nash equilibrium? c) Does making the drug safer (that is, lowering X) make the athletes better or worse off? Explain.
Assume the following game situation: If Player A plays UP and Player B plays LEFT then Player A gets $2 and Player B gets $4. If Player A plays UP and Player B plays RIGHT then Player A gets $3 and Player B gets $6. If Player A plays DOWN and Player B plays LEFT then Player A gets $5 and Player B gets $2. If Player A plays DOWN and Player B plays RIGHT then Player A gets $1 and Player B gets $1. What is the mixed strategy expected payout for Player B? 1 40/15 39/15 11/2
Player 1 and Player 2 are trying to agree on how to split a pie of size 1 in a two-stage bargaining game. If no agreement is reached after the two stages are complete, the pie is split for them according to a pre-arranged agreement that gives Player 1 and Player 2 one-quarter and three quarters of the pie, respectively. In the first stage, Player 1 makes an offer (x1, x2), where x1 + x2 = 1. Player 2 can either accept this offer (at which point the game ends and the pie is split according to Player 1’s offer), or can make a counter-offer. When Player 2 makes a counter offer, Player 1 can either accept (in which case the pie is split according to Player 2’s offer) or can reject, in which case the pie is split according to the pre-arranged agreement. Both players have a discount factor d – getting dx in the first stage (after Player 1’s proposal) is as good as getting x in the second stage (after Player 2’s proposal). a) In the last stage of the game, Player 1 will accept any offer…