Question

Two firms sell the same good. Their strategy is to establish a price $x_i \geq 0$. If $x_i<x_j$, firm i must satisfy all the demand $D\left(x_i\right)=300-5 x_i$ and firm $j$ sells nothing. If $x_1=x_2$, the firms share equally the demand $D\left(x_1\right)$. a) Assume first that the cost function is $C(q)=10 q$ for both players. Write the normal form of the game, with strategy sets $$ x_1=x_2=[0,60] $$ Show that there is a unique Nash equilibrium: compare the corresponding profits to the minimal guaranteed profits. b) Assume next that the cost functions differ $$ C_1\left(q_1\right)=10 q_1 \quad C_2\left(q_2\right)=20 q_2 $$ Prove that, strictly speaking, there is no Nash equilibrium in this game. However, define the $\varepsilon$ Nash equilibrium as an outcome where no player, by a unilateral deviation, can improve his utility by more than $\varepsilon$. Then prove that there are infinitely many $\varepsilon$ Nash equilibria in this game and describe them. c) In the game in b) perform two rounds of elimination of dominated strategies; show that the reduced game is inessential and its equilibrium corresponds to the $\varepsilon \mathrm{Nash}$ equilibrium most favorable to Player 1 .

   Two firms sell the same good. Their strategy is to establish a price $x_i \geq 0$. If $x_i<x_j$, firm i must satisfy all the demand $D\left(x_i\right)=300-5 x_i$ and firm $j$ sells nothing. If $x_1=x_2$, the firms share equally the demand $D\left(x_1\right)$.
a) Assume first that the cost function is $C(q)=10 q$ for both players. Write the normal form of the game, with strategy sets
$$
x_1=x_2=[0,60]
$$
Show that there is a unique Nash equilibrium: compare the corresponding profits to the minimal guaranteed profits.
b) Assume next that the cost functions differ
$$
C_1\left(q_1\right)=10 q_1 \quad C_2\left(q_2\right)=20 q_2
$$
Prove that, strictly speaking, there is no Nash equilibrium in this game. However, define the $\varepsilon$ Nash equilibrium as an outcome where no player, by a unilateral deviation, can improve his utility by more than $\varepsilon$. Then prove that there are infinitely many $\varepsilon$ Nash equilibria in this game and describe them.
c) In the game in b) perform two rounds of elimination of dominated strategies; show that the reduced game is inessential and its equilibrium corresponds to the $\varepsilon \mathrm{Nash}$ equilibrium most favorable to Player 1 .
Show more…
Game Theory for the Social Sciences
Game Theory for the Social Sciences
Herve Moulin 1st Edition
Chapter 5, Problem 9 ↓

Instant Answer

verified

Step 1

The demand function is given by $D(x) = 300 - 5x$. The strategy sets for both firms are $x_1 = x_2 = [0,60]$.  Show more…

Show all steps

lock
AceChat toggle button
Close icon
Ace pointing down

Please give Ace some feedback

Your feedback will help us improve your experience

Thumb up icon Thumb down icon
Thanks for your feedback!
Profile picture
Two firms sell the same good. Their strategy is to establish a price $x_i \geq 0$. If $x_i<x_j$, firm i must satisfy all the demand $D\left(x_i\right)=300-5 x_i$ and firm $j$ sells nothing. If $x_1=x_2$, the firms share equally the demand $D\left(x_1\right)$. a) Assume first that the cost function is $C(q)=10 q$ for both players. Write the normal form of the game, with strategy sets $$ x_1=x_2=[0,60] $$ Show that there is a unique Nash equilibrium: compare the corresponding profits to the minimal guaranteed profits. b) Assume next that the cost functions differ $$ C_1\left(q_1\right)=10 q_1 \quad C_2\left(q_2\right)=20 q_2 $$ Prove that, strictly speaking, there is no Nash equilibrium in this game. However, define the $\varepsilon$ Nash equilibrium as an outcome where no player, by a unilateral deviation, can improve his utility by more than $\varepsilon$. Then prove that there are infinitely many $\varepsilon$ Nash equilibria in this game and describe them. c) In the game in b) perform two rounds of elimination of dominated strategies; show that the reduced game is inessential and its equilibrium corresponds to the $\varepsilon \mathrm{Nash}$ equilibrium most favorable to Player 1 .
Close icon
Play audio
Feedback
Powered by NumerAI
Need help? Use Ace
Ace is your personal tutor. It breaks down any question with clear steps so you can learn.
Start Using Ace
Ace is your personal tutor for learning
Step-by-step explanations
Instant summaries
Summarize YouTube videos
Understand textbook images or PDFs
Study tools like quizzes and flashcards
Listen to your notes as a podcast
Continue solving this problem
Create a free account to:
  • View full step-by-step solution
  • Ask follow-up questions with Ace AI
  • Save progress and study later
Continue Free
Join the community

18,000,000+

Students on Numerade


Trusted by students at 8,000+ universities

Numerade

Get step-by-step video solution
from top educators

Continue with Clever
or



By creating an account, you agree to the Terms of Service and Privacy Policy
Already have an account? Log In

A free answer
just for you

Watch the video solution with this free unlock.

Numerade

Log in to watch this video
...and 100,000,000 more!


EMAIL

PASSWORD

OR
Continue with Clever