CMA Final · Strategic Cost Management · Game Theory
Two rival firms, P and Q, each choose a High price or a Low price. Profits in Rs lakh (P, Q) are: both High (50, 50); P High and Q Low (20, 70); P Low and Q High (70, 20); both Low (30, 30). The firms move simultaneously and without any binding agreement. What is the Nash equilibrium outcome?
The Nash equilibrium is both firms choosing Low and each earning Rs 30 lakh. Low is a dominant strategy for each firm whatever the rival does, so the jointly better High-High outcome of Rs 50 lakh each is not stable. This is a prisoner's dilemma.
- AEach firm earns Rs 30 lakh, both choosing LowCorrect
- BEach firm earns Rs 50 lakh, both choosing High
- CP earns Rs 70 lakh and Q earns Rs 20 lakh
- DP earns Rs 20 lakh and Q earns Rs 70 lakh
Explanation
If Q chooses High, P gets 50 from High and 70 from Low, so P prefers Low. If Q chooses Low, P gets 20 from High and 30 from Low, so P again prefers Low. Low is therefore a dominant strategy for P, and by symmetry for Q. The equilibrium is (Low, Low) with 30 each. (High, High) gives 50 each but is not stable because each firm gains by cutting its price.
Did you get it right without looking?
One question tells you little. A timed set on Game Theory shows your real accuracy, how long you take and where you lose marks.
More Game Theory questions
- Two rival firms, A and B, choose strategies simultaneously. The table shows A's gain (₹ lakh); B's loss is the same amount. Rows are A's str…
- In a two-person zero-sum game, the pay-off matrix for Firm A (rows A1, A2) against Firm B (columns B1, B2, B3) in Rs lakh is: A1: 4, 7, 5; A…
- A two-person zero-sum game has the following payoffs (in Rs lakh) to Player A, who chooses rows A1 to A3; Player B chooses columns B1 to B3.…
- A's payoffs (₹ lakh) in a zero-sum game are, with rows A1, A2, A3 and columns B1, B2, B3: A1: 3, 6, 8. A2: 5, 4, 9. A3: 2, 3, 6. B wants to …
- Two rival firms, A and B, play a zero-sum game. The matrix shows A's gain in ₹ lakh (B's loss) for each pair of strategies. A chooses rows A…
- In a zero-sum game, A (maximiser) chooses between A1 and A2, and B chooses between B1 and B2. A's payoffs are: A1 gets 5 against B1 and 1 ag…