Consider the following ‘war of attrition’. Two animals are in a stand off for a prey. They independently decide when to give up. Waiting is costly, but the animal giving up last wins the prey (they each get nothing if they walk away at the exact same time). Getting the prey gives a benefit of 80 while waiting costs 2 per unit of time. Formally payoffs are given as follows: u1(t1, t2) = ( −2t1 if t1 ≤ t2 80 − 2t2 if t1 > t2 u2(t1, t2) = ( 80 − 2t1 if t1 < t2 −2t2 if t1 ≥ t2, where ti is the amount of time animal i decided to wait. Assuming that animals aim to maximize payoffs (consciously or not), figure out the Nash equilibria of this game by answering the following questions (similar to how we proceeded to solve the Bertrand game). (a) Show that there is no Nash equilibrium where both animals wait a strictly positive amount of time. For this, consider two subcases: (i) both wait the same amount of time, or (ii) one gives in earlier than the other. (b) Assume now that one animal, say the first one, gives up right away (t1 = 0) while the other picks t2 ≥ 0. For which values of t2 do we have a Nash equilibrium? (c) Are the Nash equilibria identified in (b) Pareto efficent

ENGR.ECONOMIC ANALYSIS
14th Edition
ISBN:9780190931919
Author:NEWNAN
Publisher:NEWNAN
Chapter1: Making Economics Decisions
Section: Chapter Questions
Problem 1QTC
icon
Related questions
Question

Consider the following ‘war of attrition’. Two animals are in a stand off for a prey. They
independently decide when to give up. Waiting is costly, but the animal giving up last wins
the prey (they each get nothing if they walk away at the exact same time). Getting the prey
gives a benefit of 80 while waiting costs 2 per unit of time. Formally payoffs are given as
follows:
u1(t1, t2) =
(
−2t1 if t1 ≤ t2
80 − 2t2 if t1 > t2
u2(t1, t2) =
(
80 − 2t1 if t1 < t2
−2t2 if t1 ≥ t2,
where ti is the amount of time animal i decided to wait. Assuming that animals aim to
maximize payoffs (consciously or not), figure out the Nash equilibria of this game by answering
the following questions (similar to how we proceeded to solve the Bertrand game).
(a) Show that there is no Nash equilibrium where both animals wait a strictly positive
amount of time. For this, consider two subcases: (i) both wait the same amount of
time, or (ii) one gives in earlier than the other.
(b) Assume now that one animal, say the first one, gives up right away (t1 = 0) while the
other picks t2 ≥ 0. For which values of t2 do we have a Nash equilibrium?
(c) Are the Nash equilibria identified in (b) Pareto efficent?

Consider the following 'war of attrition'. Two animals are in a stand off for a prey. They
independently decide when to give up. Waiting is costly, but the animal giving up last wins
the prey (they each get nothing if they walk away at the exact same time). Getting the prey
gives a benefit of 80 while waiting costs 2 per unit of time. Formally payoffs are given as
follows:
-2t1
if ti < t2
U1 (t1, t2) =
80 – 2t2
if tį > t2
80 – 2t, if ti < t2
U2(t1, t2)
-2t2
if ti 2 t2,
where t; is the amount of time animal i decided to wait. Assuming that animals aim to
maximize payoffs (consciouly or not), figure out the Nash equilibria of this game by answering
the following questions (similar to how we proceeded to solve the Bertrand game).
(a) Show that there is no Nash equilibrium where both animals wait a strictly positive
amount of time. For this, consider two subcases: (i) both wait the same amount of
time, or (ii) one gives in earlier than the other.
(b) Assume now that one animal, say the first one, gives up right away (t1 = 0) while the
other picks t, > 0. For which values of tą do we have a Nash equilibrium?
(c) Are the Nash equilibria identified in (b) Pareto efficent?
Transcribed Image Text:Consider the following 'war of attrition'. Two animals are in a stand off for a prey. They independently decide when to give up. Waiting is costly, but the animal giving up last wins the prey (they each get nothing if they walk away at the exact same time). Getting the prey gives a benefit of 80 while waiting costs 2 per unit of time. Formally payoffs are given as follows: -2t1 if ti < t2 U1 (t1, t2) = 80 – 2t2 if tį > t2 80 – 2t, if ti < t2 U2(t1, t2) -2t2 if ti 2 t2, where t; is the amount of time animal i decided to wait. Assuming that animals aim to maximize payoffs (consciouly or not), figure out the Nash equilibria of this game by answering the following questions (similar to how we proceeded to solve the Bertrand game). (a) Show that there is no Nash equilibrium where both animals wait a strictly positive amount of time. For this, consider two subcases: (i) both wait the same amount of time, or (ii) one gives in earlier than the other. (b) Assume now that one animal, say the first one, gives up right away (t1 = 0) while the other picks t, > 0. For which values of tą do we have a Nash equilibrium? (c) Are the Nash equilibria identified in (b) Pareto efficent?
Expert Solution
Step 1: Introduction

The ideal conclusion of a game happens wherever there's no incentive to depart from the start strategy, in keeping with equilibrium, a notion in scientific theory. The equilibrium could be a notion in scientific theory that states that the simplest outcome of a game is one within which no player has associate incentive to depart from their elite strategy when evaluating the strategy of associate opponent.

Overall, dynamic  actions can offer no progressive profit to a private providing that alternative players' ways stay unchanged. There may well be many author equilibria in a very game, or none in any respect.

  • The equilibrium could be a scientific theory decision-making theorem that argues that if a player sticks to their beginning strategy, they'll attain the required result.
  • When considering the selections of alternative players, every player's strategy is perfect within the equilibrium. each player wins as a result of all of them bring home the bacon the result they require.
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Bayesian Probability Rule
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, economics and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
ENGR.ECONOMIC ANALYSIS
ENGR.ECONOMIC ANALYSIS
Economics
ISBN:
9780190931919
Author:
NEWNAN
Publisher:
Oxford University Press
Principles of Economics (12th Edition)
Principles of Economics (12th Edition)
Economics
ISBN:
9780134078779
Author:
Karl E. Case, Ray C. Fair, Sharon E. Oster
Publisher:
PEARSON
Engineering Economy (17th Edition)
Engineering Economy (17th Edition)
Economics
ISBN:
9780134870069
Author:
William G. Sullivan, Elin M. Wicks, C. Patrick Koelling
Publisher:
PEARSON
Principles of Economics (MindTap Course List)
Principles of Economics (MindTap Course List)
Economics
ISBN:
9781305585126
Author:
N. Gregory Mankiw
Publisher:
Cengage Learning
Managerial Economics: A Problem Solving Approach
Managerial Economics: A Problem Solving Approach
Economics
ISBN:
9781337106665
Author:
Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:
Cengage Learning
Managerial Economics & Business Strategy (Mcgraw-…
Managerial Economics & Business Strategy (Mcgraw-…
Economics
ISBN:
9781259290619
Author:
Michael Baye, Jeff Prince
Publisher:
McGraw-Hill Education