Question

16. Two gas stations, A and B, are locked in a price war. Each player has...

16. 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.

a. Draw the payoff matrix for this game.

b. What is the optimal strategy?

c. Does player A have a dominant strategy? Explain.

d. Does player B have a dominant strategy? Explain.

e. How many Nash equilibria does this game have?

f. What course of action will players A & B choose?

Homework Answers

Answer #1

Q16)

(a) The payoff matric is given below:

(c) No player A does not have a dominant strategy. If player B chooses R, A's best response is to choose C. If B chooses C, A's best response is to choose C. Since there is no single best response, A does not ave a dominant strategy.

(d) No player A does not have a dominant strategy. If player A chooses R, B's best response is to choose C. If A chooses C, B's best response is to choose C. Since there is no single best response, B does not ave a dominant strategy..

(e) Thegame has 2 nash equilibrium as follows:

(1) A chooses R and B chooses C

(2) A chooses C and B chooses R

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
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...
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...
QUESTION 3 Below is a game between player A and player B. Each player has two...
QUESTION 3 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 -3 and the payoff for B is -2. Player B Strategy 1 Strategy 2 Player A Strategy 1 (-3,-2) (10,0) Strategy 2 (0,8) (0,0) How many pure strategy Nash...
Suppose Agnieszka and Stephanie are playing rock, paper, scissors game. They choose their actions simultaneously. The...
Suppose Agnieszka and Stephanie are playing rock, paper, scissors game. They choose their actions simultaneously. The consequences are as follows: the one who loses has to grade all BUS1040 essays, the one who wins does not have to grade any exams. In case of a tie, they split the pile of BUS1040 essays equally for grading. Assuming that Agnieszka and Stephanie do not like grading exams, which answer is correct? a. There is no Nash Equilibrium in this game. b....
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...
Player 1                               Player 2 Left Right Up $1,200, $700 $1,800, $600
Player 1                               Player 2 Left Right Up $1,200, $700 $1,800, $600 Down $1,000, $3,000 $1,750, $4,000 1. Which of the following is true? A. Player 1 has a dominant strategy, and Player 2 does not.   B. Player 2 has a dominant strategy, and Player 1 does not. C. The Nash Equilibrium equals Player 1 Down, Player 2 Right D. The Nash Equilibrium equals Player 1 Down, Player 2 Left 2. Which of the following is true? A. Player 2...
A and B interact once only. A has two strategies, 1 and 2. B has the...
A and B interact once only. A has two strategies, 1 and 2. B has the same strategies. If A and B both choose the same strategy, A wins 5, and B loses 5. If A and B choose different strategies, A loses 5, and B wins 5. Do either have a dominant strategy?
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...
MTN and Airtel are two telecommunication giants engaged in a battle to win customers from a...
MTN and Airtel are two telecommunication giants engaged in a battle to win customers from a saturated market of mobile users. Historically, they both know that intensive advertising can help them win customers from other operators even though advertising is expensive. So each firm has to decide whether to choose a high level of advertising (H) or a low level of advertising (L). If both firms choose high level of advertising, the advertisement campaigns will simply offset each other and...
In the “divide two apples” game, player 1 suggests a division scheme (x,y) from the set...
In the “divide two apples” game, player 1 suggests a division scheme (x,y) from the set {(2, 0), (1, 1), (0, 2)} where x is the number of apples allocated to player 1, and y is the number of apples allocated to player 2. Player 2 counters with a division scheme of her own that comes from the same set. The final allocation is obtained by averaging the two proposed division schemes. The apples can be cut if the resulting...