Strategic Cost Management · Game Theory

Applications and Limitations of Game Theory in Business

Q: What is the difference between pure and mixed strategy?

A pure strategy is one fixed action the player always picks. It applies when a saddle point exists. A mixed strategy is a set of probabilities over actions, used when there is no saddle point, so that the rival cannot predict the choice.

Q: How is game theory used in pricing decisions?

A firm lists its price options and the likely rival responses, and puts the profit or share for each pair in a payoff matrix. Solving the matrix shows whether to hold or cut price. It makes the firm consider the rival's reaction before changing price.

Q: What are the main limitations of game theory?

It assumes rational players, known payoffs and, in the basic model, two players with a zero-sum result. Real markets have many players, uncertain payoffs and repeated play. Large games are also hard to solve, so results guide decisions but do not replace judgement.

Q: Is game theory in the CMA Final exam only numerical?

No. It can be asked as an MCQ, a numerical on saddle point or mixed strategy, or a short theory question on uses and limits. Prepare all three forms.

Updated 11 October 2026 · Fact-checked

Game theory studies decisions where your payoff depends on what rivals choose. Businesses use it for pricing, advertising, capacity and bidding. To solve a question, build the payoff matrix, check for a saddle point (pure strategy), else find mixed strategy probabilities. Its limits are unrealistic assumptions about rationality, known payoffs and two players.

Understand Applications and Limitations of Game Theory

Game theory is a method to choose the best strategy when rivals also choose strategies and the result for you depends on both. In business, the players are firms, the strategies are actions like price cuts or ad campaigns, and the payoffs are profit, market share or cost.

In the exam, the standard model is a two-person zero-sum game. One firm's gain is exactly the other's loss. The payoff matrix shows the gain of the row player (the maximiser) for every pair of choices. The row player uses the maximin rule (best of the row minimums). The column player uses the minimax rule (least of the column maximums).

A pure strategy means a player picks one course of action every time. It exists when maximin equals minimax, which is a saddle point. A mixed strategy means a player randomises between actions in fixed proportions. It is needed when there is no saddle point. The proportions are chosen so that the expected payoff is the same whatever the rival does.

Business applications: price wars between competitors (cut price or hold), advertising and promotion budgets, launching a new product or entering a market, capacity expansion, tender bidding and negotiating with unions or suppliers. The model shows which choice protects you against the worst rival response, and it forces you to think about rival reactions.

Limitations: real business games are rarely zero-sum, as both firms may gain from a growing market. Payoffs are hard to estimate and rivals' strategies are not fully known. The theory assumes rational players who aim only at the stated payoff. Many firms compete at once, not two. Games repeat over time and the matrix may change. Large matrices are hard to solve. Mixed strategies are hard to apply to a one-time decision. So treat the result as decision support, not a final answer.

Key rules to remember

Maximin (row player): Maximin = maximum of the row minimums; Row player is the maximiser. Write the minimum of each row, then take the largest.
Minimax (column player): Minimax = minimum of the column maximums; Column player is the minimiser. Write the maximum of each column, then take the smallest.
Saddle point condition: Maximin = Minimax = value of the game; If equal, the game has a pure strategy solution. If maximin < minimax, use mixed strategy.
2x2 mixed strategy, row probabilities: p1 = (d − c) ÷ (a − b − c + d); p2 = 1 − p1; Matrix is [a b; c d], with a, b in row 1 and c, d in row 2. Use only when there is no saddle point.
2x2 mixed strategy, column probabilities: q1 = (d − b) ÷ (a − b − c + d); q2 = 1 − q1; q1 is the probability of column 1 for the column player.
Value of 2x2 game: V = (ad − bc) ÷ (a + d − b − c); Use when there is no saddle point. Check that V lies between maximin and minimax.

How to solve Applications and Limitations of Game Theory questions

Use this sequence for any question on applications, limitations or a numerical game in a business setting.

1Identify the players, their strategies and the payoff (profit, share or cost). State whether the matrix gives gains to the row player.
2Write the payoff matrix. If it is a word problem, fill each cell carefully with the payoff for that pair of strategies.
3Apply the dominance rule if any row or column is clearly worse, and reduce the matrix.
4Find the row minimums and column maximums. Compute maximin and minimax.
5If maximin equals minimax, state the saddle point, the pure strategies of both players and the value of the game.
6If not, state that no saddle point exists and solve by mixed strategy using the 2x2 formulas (or graphical method for 2xn).
7Give the value of the game and who gains. Convert it into a business recommendation in one or two lines.
8If asked, add the limitations that apply to this case, such as non-zero-sum payoffs or uncertain estimates.

Quickest way: Saddle point check in 30 seconds

When to use it: Use for MCQs and for the first step of any numerical game.

Circle the minimum in each row. Pick the largest circled value.
Box the maximum in each column. Pick the smallest boxed value.
If the two values are equal, that is the value of the game and the cell is the saddle point.
If not, and the matrix is 2x2, plug into the formulas directly. Check that V lies between maximin and minimax.
For theory questions, write 3 applications and 3 limitations as short points.

Common mistakes in Applications and Limitations of Game Theory

Taking the minimum of columns and maximum of rows (reversing the rules).
Students forget which player is the maximiser.
Fix: Row player: maximin of row minimums. Column player: minimax of column maximums. Write the labels beside the matrix.
Applying mixed strategy formulas when a saddle point exists.
Students jump to the formula without checking maximin and minimax.
Fix: Always do the saddle point check first. Mixed strategy is only for games without one.
Writing the 2x2 formula with the wrong cell positions, giving probabilities outside 0 to 1.
Memorising the formula without the labelled matrix.
Fix: Label a, b, c, d on the matrix first. Check that probabilities are between 0 and 1 and that each pair adds to 1.
Listing limitations as a list of generic words with no link to business.
Students recall headings without explaining them.
Fix: Add one line for each, for example: payoffs are estimates, so a small error can change the chosen strategy.
Treating the game value as the profit of the firm.
The value is read without noting the unit and the player.
Fix: State the value as the gain of the row player and the loss of the column player, with the unit, such as ₹ lakh or % market share.
Saying a pure strategy means the player never changes the action, and a mixed strategy means mixing products.
Loose use of the words.
Fix: Pure: one action always. Mixed: actions chosen at random in set proportions, which keeps the rival from predicting you.

Worked examples

Example 1

Two firms, Asha Foods (row player) and Bharat Snacks (column player), choose a pricing strategy. The table shows Asha's gain in market share (%) for each pair. Asha's strategies: A1 Hold price, A2 Cut price. Bharat's strategies: B1 Hold price, B2 Cut price. Payoffs: A1B1 = 4, A1B2 = 2, A2B1 = 6, A2B2 = 3. Find the best strategies and the value of the game.

Show the solution

Row minimums: A1 = min(4, 2) = 2; A2 = min(6, 3) = 3. Maximin = 3 (row A2).
Column maximums: B1 = max(4, 6) = 6; B2 = max(2, 3) = 3. Minimax = 3 (column B2).
Maximin = Minimax = 3, so a saddle point exists at A2B2.
Asha's best strategy is to cut price. Bharat's best strategy is also to cut price.
Value of the game = 3.

Answer: Both firms cut price. The saddle point is A2B2 and the value of the game is a 3% market share gain for Asha (and a 3% loss for Bharat). This is a pure strategy solution.

Example 2

Two firms, Kavya Motors (row player) and Rohan Auto (column player), plan advertising. The payoffs are Kavya's gain in profit (₹ lakh): K1B1 = 6, K1B2 = 2, K2B1 = 3, K2B2 = 5. Find the optimal mixed strategies and the value of the game. Also state one limitation of using the answer.

Show the solution

Row minimums: K1 = 2, K2 = 3. Maximin = 3.
Column maximums: B1 = 6, B2 = 5. Minimax = 5.
3 ≠ 5, so no saddle point. Use mixed strategy. Here a = 6, b = 2, c = 3, d = 5.
Denominator = a − b − c + d = 6 − 2 − 3 + 5 = 6.
Kavya: p1 = (d − c) ÷ 6 = (5 − 3) ÷ 6 = 2/6 = 1/3; p2 = 2/3.
Rohan: q1 = (d − b) ÷ 6 = (5 − 2) ÷ 6 = 3/6 = 1/2; q2 = 1/2.
Value V = (ad − bc) ÷ 6 = (30 − 6) ÷ 6 = 4.
Check: V = 4 lies between maximin 3 and minimax 5. Verify with Kavya's mix against column 1: (1/3)(6) + (2/3)(3) = 2 + 2 = 4. Against column 2: (1/3)(2) + (2/3)(5) = 2/3 + 10/3 = 4. Both equal.

Answer: Kavya uses K1 with probability 1/3 and K2 with probability 2/3. Rohan uses B1 and B2 each with probability 1/2. The value of the game is ₹4 lakh gain for Kavya. Limitation: the payoffs are estimates and the game is rarely truly zero-sum, so a small error in estimates can change the proportions.

Exam tips

Always run the saddle point check first and write maximin and minimax values explicitly. Marks are given for this step.
In MCQs, test the options by calculating maximin and minimax. For 2x2 games with no saddle point, compute V using (ad − bc) ÷ (a + d − b − c).
For theory questions, give a balanced answer: three applications with a business example each, then three to four limitations with a reason.
End numerical answers with a one-line business recommendation, such as which price action each firm should take.
Define pure and mixed strategy in one line each and state when each applies. This is a frequently asked short question.

Practice questions from Game Theory

Applications and Limitations of Game Theory in other exams

The same ground in other exams, if you are preparing for more than one or want another angle on it.

Applications and Limitations of Game Theory: frequently asked questions

What is the difference between pure and mixed strategy?

A pure strategy is one fixed action the player always picks. It applies when a saddle point exists. A mixed strategy is a set of probabilities over actions, used when there is no saddle point, so that the rival cannot predict the choice.

How is game theory used in pricing decisions?

A firm lists its price options and the likely rival responses, and puts the profit or share for each pair in a payoff matrix. Solving the matrix shows whether to hold or cut price. It makes the firm consider the rival's reaction before changing price.

What are the main limitations of game theory?

It assumes rational players, known payoffs and, in the basic model, two players with a zero-sum result. Real markets have many players, uncertain payoffs and repeated play. Large games are also hard to solve, so results guide decisions but do not replace judgement.

Is game theory in the CMA Final exam only numerical?

No. It can be asked as an MCQ, a numerical on saddle point or mixed strategy, or a short theory question on uses and limits. Prepare all three forms.