Question

4. Consider a two-player game with strategy sets S1 = {α1, . . . , αm}...

4. Consider a two-player game with strategy sets S1 = {α1, . . . , αm} and S2 = {β1, . . . , βn}.

(a) Suppose that (αi , βj ) is a Nash equilibrium. Is it possible that a strategy αj strictly dominates αi?

(b) Assume again that (αi , βj ) is a Nash equilibrium. Is it possible that another strategy αj weakly dominates αi?

Homework Answers

Answer #1

(a) No.
If a strategy αj strictly dominates αi, then the player would not played αi. If he had not played αi, it would not have become the Nash equilibrium.

(b) Yes.
It is possible that αj weakly dominates αi, because for the other player, βj must have been a dominant strategy (strong or weak), which he chose to play. When both the players chose (αi , βj ), singly or along with the respective weakly dominated strategies, (αi , βj ) became the Nash equilibrium.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Player 1 chooses T, M, or B. Player 2 chooses L, C, or R. L C...
Player 1 chooses T, M, or B. Player 2 chooses L, C, or R. L C R T 0, 1 -1, 1 1, 0 M 1, 3 0, 1 2, 2 B 0, 1 0, 1 3, 1 (2 points each)    (a) Find all strictly dominated strategies for Player 1. You should state what strategy strictly dominates them. (b) Find all weakly dominated strategies for Player 2.  You should state what strategy weakly dominates them. (c) Is there any weakly...
If only one player has a dominant strategy in a game with two players, will there...
If only one player has a dominant strategy in a game with two players, will there be a Nash equilibrium?
GAME THEORY: Consider the voluntary contribution to building a fence game. Assume that v1 = v2...
GAME THEORY: Consider the voluntary contribution to building a fence game. Assume that v1 = v2 = 100, and C = 150. Select all that apply. A. It is efficient to build the fence B. Contributing more than her own valuation is a strictly dominated strategy for each player. C. There are Nash equilibria in which the fence is not built. D. Each player contributing 100 is a pure strategy Nash equilibrium in this game. Please explain your answers! Thank...
Let α1, α2 ∈ R. Consider the following version of prisoners’ dilemma (C means “Confess” and...
Let α1, α2 ∈ R. Consider the following version of prisoners’ dilemma (C means “Confess” and N means “Do not confess”): 2 C N 1 C 0, 0 α1, −2 N −2, α2 5, 5 Suppose that the two players play the above stage game infinitely many times. Departing from our in-class discussion, however, we assume that for each i ∈ {1, 2}, player i discounts future payoffs at rate δi ∈ (0, 1), allowing δ1 and δ2 to differ....
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to...
4. Consider the following non-cooperative, 2-player game. Each player is a middle manager who wishes to get a promotion. To get the promotion, each player has two possible strategies: earn it through hard work (Work) or make the other person look bad through unscrupulous means (Nasty). The payoff matrix describing this game is shown below. The payoffs for each player are levels of utility—larger numbers are preferred to smaller numbers. Player 1’s payoffs are listed first in each box. Find...
Consider the voluntary contribution to building a fence game discussed in class. Assume that v1 =...
Consider the voluntary contribution to building a fence game discussed in class. Assume that v1 = v2=100 and C=150, and select all that apply. a. There are Nash equilibria in which the fence is not built. b. Each player donating 100 is a pure strategy Nash equilibrium in the game. c. It is efficient to build the fence. d. Contributing more than her own valuation is a strictly dominated strategy for each player.
Which of the following is true for a Nash equilibrium of a two-player game? a) The...
Which of the following is true for a Nash equilibrium of a two-player game? a) The joint payoffs of the two players are highest compared to other strategy pairs. b) It is a combination of strategies that are best responses to each other.*? c) Every two-player game has a unique Nash equilibrium. d) None of the above is correct.
Consider a two-player game between Child’s Play and Kid’s Korner, each of which produces and sells...
Consider a two-player game between Child’s Play and Kid’s Korner, each of which produces and sells wooden swing sets for children. Each player can set either a high or a low price for a standard two-swing, one-slide set. The game is given as below: Kid’s korner High price Low price Child’s play High price 64, 64 20, 72 Low price 72, 20 57, 57 a. Suppose the players meet and make price decisions only once. What is the Nash equilibrium...
Below is a game between player A and player B. Each player has two possible strategies:...
Below is a game between player A and player B. Each player has two possible strategies: 1 or 2. The payoffs for each combination of strategies between A and B are in the bracket. For example, if A plays 1 and B plays 1, the payoff for A is 1 and the payoff for B is 0. Player B Strategy 1 Strategy 2 Player A Strategy 1 (1,0) (0,1) Strategy 2 (0,1) (1,0) How many pure strategy Nash equilibria does...
A hundred players are participating in this game (N = 100). Each player has to choose...
A hundred players are participating in this game (N = 100). Each player has to choose an integer between 1 and 100 in order to guess “5/6 of the average of the responses given by all players”. Each player who guesses the integer closest to the 5/6 of the average of all the responses, wins. (a) Q4 Find all weakly dominated strategies (if any). (b) Find all strategies that survive the Iterative Elimination of Dominated Strategies (IEDS) (if any). IEDS:...