Question

Question 2 Consider the following two-player coordination game in extensive form. Both players want to coordinate on choosing the same action. However, player 1 has a preference for both players choosing a, while player 2 has a preference for both players choosing b. Before taking their simultaneous actions, player 1 can \"posture\" by either acting happy (h) or by complaining (c), which player 2 can observe. If player 1 complains, it reduces his own payoff by 2. The payoffs are depicted in the following game tree. Player 1 h c Player 2 a b Player 1 a b 4,1 0,0 0,0 1,4 Player 1 a b Player 2 a b 2,1 -2,0 -2,0 -1,4 1. Determine all subgame perfect equilibria in pure strategies. 2. Determine all strictly dominated strategies in the game. 3. Consider the reduced extensive game obtained by removing all strategies that are strictly dominated. Find all subgame perfect equilibria in pure strategies of this reduced game. 4. Explain why in the reduced game, there is no SPE in which both players choose b, even though there exists such an equilibrium in the original game. What effect has the removal of strictly dominated strategies from the game?

          Question 2 Consider the following two-player coordination game in extensive form. Both
players want to coordinate on choosing the same action. However, player 1 has a preference
for both players choosing a, while player 2 has a preference for both players choosing b. Before
taking their simultaneous actions, player 1 can \"posture\" by either acting happy (h) or by
complaining (c), which player 2 can observe. If player 1 complains, it reduces his own payoff
by 2. The payoffs are depicted in the following game tree.
Player 1
h
c
Player 2
a
b
Player 1
a
b
4,1	0,0
0,0	1,4
Player 1
a
b
Player 2
a	b
2,1	-2,0
-2,0	-1,4
1. Determine all subgame perfect equilibria in pure strategies.
2. Determine all strictly dominated strategies in the game.
3. Consider the reduced extensive game obtained by removing all strategies that are
strictly dominated. Find all subgame perfect equilibria in pure strategies of this reduced
game.
4. Explain why in the reduced game, there is no SPE in which both players choose b,
even though there exists such an equilibrium in the original game. What effect has the
removal of strictly dominated strategies from the game?
        
Show more…
Question 2 Consider the following two-player coordination game in extensive form. Both
players want to coordinate on choosing the same action. However, player 1 has a preference
for both players choosing a, while player 2 has a preference for both players choosing b. Before
taking their simultaneous actions, player 1 can p̈ostureb̈y either acting happy (h) or by
complaining (c), which player 2 can observe. If player 1 complains, it reduces his own payoff
by 2. The payoffs are depicted in the following game tree.
Player 1
h
c
Player 2
a
b
Player 1
a
b
4,1	0,0
0,0	1,4
Player 1
a
b
Player 2
a	b
2,1	-2,0
-2,0	-1,4
1. Determine all subgame perfect equilibria in pure strategies.
2. Determine all strictly dominated strategies in the game.
3. Consider the reduced extensive game obtained by removing all strategies that are
strictly dominated. Find all subgame perfect equilibria in pure strategies of this reduced
game.
4. Explain why in the reduced game, there is no SPE in which both players choose b,
even though there exists such an equilibrium in the original game. What effect has the
removal of strictly dominated strategies from the game?

Added by Susan C.

Close

Principles of Economics
Principles of Economics
Gregory Mankiw 8th Edition
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
Question 2: Consider the following two-player coordination game in extensive form. Both players want to coordinate on choosing the same action. However, player 1 has a preference for both players choosing a, while player 2 has a preference for both players choosing b. Before taking their simultaneous actions, player 1 can "posture" by either acting happy (h) or by complaining (c), which player 2 can observe. If player 1 complains, it reduces his own payoff by 2. The payoffs are depicted in the following game tree. Player 1 / a b / a b | | 6 2,1 | | 0,0 2,0 | | 1,4 0,0 Player 2 1. Determine all subgame perfect equilibria in pure strategies. 2. Determine all strictly dominated strategies in the game. 3. Consider the reduced extensive game obtained by removing all strategies that are strictly dominated. Find all subgame perfect equilibria in pure strategies of this reduced game. 4. Explain why in the reduced game, there is no SPE in which both players choose b, even though there exists such an equilibrium in the original game. What effect has the removal of strictly dominated strategies from the game?
Close icon
Play audio
Feedback
Powered by NumerAI
Kathleen Carty David Collins
Danielle Fairburn verified

Madhur L and 58 other subject Microeconomics educators are ready to help you.

Ask a new question

*

Labs

-

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

*

Key Concepts

-
Key Concept
Premium Feature
Explore the core concept behind this problem.
Play button
Key Concept
Premium Feature
Explore the core concept behind this problem.
Your browser does not support the video tag.

*

Recommended Videos

-
recall-the-battle-of-the-sexes-game-where-two-players-want-to-meet-and-choose-movie-m-or-concert-c-to-meet-at-but-have-different-preferences-on-mc-here-we-consider-a-situation-where-player-1-39002

Recall the Battle of the Sexes game where two players want to meet and choose Movie (M) or Concert (C) to meet at but have different preferences on M, C. Here we consider a situation where Player 1 is uncertain whether Player 2 wants to meet or avoid her. We model this situation as a game by considering Player 2 as being one of two possible types: Type 1, who wants to meet, and Type 2, who wants to avoid Player 1. Suppose, for a numerical example, that both types are equally likely and the payoffs are as below. (Player 2 is the column player.) Type 1 M C M (3,1) (0,0) C (0,0) (1,3) Type 2 M C M (3,0) (0,3) C (0,1) (1,0) Player 2 knows his type, namely, which of the two games above is the actual game that is played. Player 1 only knows that with probability p=1/2, Type 1 game is played and with probability 1-p=1/2, Type 2 game is played. This is an example of a game with incomplete information. A strategy profile specifies a strategy for Player 1, a strategy for Player 2 Type 1, and a strategy for Player 2 Type 2. A strategy profile is a (pure strategy) Nash Equilibrium if Player 1's strategy is a best response to the pair of strategies of the Player 2 Types, and if the strategy of each Player 2 Type is the best response to Player 1's strategy. What is the best response of Player 2 Type 1 to "Player 1 choosing M"? What is the best response of Player 1 to "Player 2 Type 1 choosing M and Player 2 Type 2 choosing C"? Find all the (pure strategy) Nash equilibria of this game. What is the smallest probability p that is greater than 1/2 for which the answer to (ii) is different? Q2. (Continuation of Q1') Consider the symmetric Battle of The Sexes Game with Incomplete Information: Here each player (Player 1 AND Player 2) is uncertain whether the other player wants to meet or avoid her. Assume p=1/2 and the payoffs are as in Q1. How would you find the (pure strategy) Nash equilibria of this game? Find the (pure strategy) Nash equilibria.

Madhur L.

consider-the-following-game-player-2-left-middle-right-up-764-456-4410-player-1-middle-556-3-68-534-down-636-56-7-625-player-2-left-middle-right-up-343-655-848-player-1-middle-645-536-952-do-39664

Consider the following game. Table 1: Player 3 chooses "Yellow" Player 1 Player 2 | Left | Middle | Right Up | 7, 6, 4 | 4, 5, 6 | 4, 4, 10 Middle | 5, 5, 6 | 3, 6, 8 | 5, 3, 4 Down | 6, 3, 6 | 5, 6, 7 | 6, 2, 5 Table 2: Player 3 chooses "Purple" Player 1 Player 2 | Left | Middle | Right Up | 3, 4, 3 | 6, 5, 5 | 8, 4, 8 Middle | 6, 4, 5 | 5, 3, 6 | 9, 5, 2 Down | 6, 2, 4 | 5, 1, 5 | 9, 1, 3 There are three players in this game. Player 1 is the row player (she is choosing rows) and she chooses between three strategies: Up, Middle, Down. Player 2 is the column player (she is choosing columns) and she chooses between three strategies: Left, Middle, Right. Finally, player 3 is the page player (she is choosing tables/matrices) and she chooses between two strategies: Yellow, Purple. Payoffs are written so that the first number is player 1's payoff, the second number is player 2's payoff and the third number is player 3's payoff. For example, if player 1 chooses Up, player 2 chooses Left and player 3 chooses Yellow, then player 1 gets 7, player 2 gets 6, player 3 gets 4. a) (6 points) Does this game have a (strict) dominant strategy equilibrium? If so, find it and argue why it is a dominant strategy equilibrium. If not, argue why there isn't a dominant strategy equilibrium. b) (6 points) Apply iterated deletion of strictly dominated strategies (IDSDS). Clearly show every step of your iterations. Is this game dominance solvable? Why or why not? c) (13 points) Find all of the Nash equilibria of this game. You have to check for both pure and mixed strategy Nash equilibria.

Krishna G.

two-gas-stations-a-and-b-are-locked-in-a-price-war-each-player-has-the-option-of-raising-its-price-r-or-continuing-to-charge-the-low-price-c-they-will-choose-strategies-simultaneously-if-bot-50916

Two gas stations, A and B, are locked in a price war. Each player has the option of raising its price (R) or continuing to charge the low price (C). They will choose strategies simultaneously. If both choose C, they will both suffer a loss of $100. If one chooses R and the other chooses C, (i) the one that chooses R loses many of its customers and earns $0, and (ii) the one that chooses C wins many new customers and earns $1000. If they both choose R, the price war ends and they each earn $500. 1. Draw the payoff matrix for this game. B B R C A R (500,500) (0,1000) A C (1,000,0) (-100,-100) 2. What is the optimal strategy? R for A and R for B 3. Does player A have a dominant strategy? Explain. No player A doesn't have a dominant strategy. If player B chooses R, A's best response is to settle on C. If B chooses C, A's best response is to choose C. Since there is no single best response, A does not have a dominant strategy. 4. Does player B have a dominant strategy? Explain. 5. How many Nash equilibria does this game have? 6. What course of action will players A & B choose?

Azat N.


*

Recommended Textbooks

-
Principles of Economics

Principles of Economics

Gregory Mankiw 8th Edition
achievement 1,127 solutions
Principles of Microeconomics for AP® Courses

Principles of Microeconomics for AP® Courses

Steven A. Greenlaw, David Shapiro, Timothy Taylor 2nd Edition
achievement 1,020 solutions
Economics

Economics

Michael Parkin 12th Edition
achievement 1,223 solutions

*

Transcript

-
00:01 Hello student, in the given question, q1, in part a, the best response of player 2, type 1 to player 1 choosing m is to also choose m.
00:41 This is because in type 1 game, player 2 gets a higher payoff by choosing m, regardless of what player 1 chooses.
01:34 In part b, the best response of player 1 to player 2, type 1 choosing m and player 2 type 2 choosing c.
02:24 So, is to choose m with probability p and c with probability 1 -p.
02:39 Is to choose m with probability p and c with probability 1 -p.
03:07 So, this is because if player 1 chooses m, this is because player 1 chooses m with probability p and player 2 probability p and c with probability of 1 -p.
03:41 Then the player 2 gets type 1, gets a higher payoff by choosing m and player 2 type 2 gets a higher payoff by choosing c.
04:33 Now, in part c, there are two nash equilibrium in pure strategy in the game as m -m -c and c -c -m.
05:03 In the strategy profile, m -m -c is the player 1 chooses m, player 1 who chooses m and the player 2, m -m -c is the player 1 chooses m with probability 1, player 2 type 1 chooses m with probability of c...
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
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