Skip to content

CMA Final · Strategic Cost Management

Game Theory for CMA Final Strategic Cost Management

Game theory studies decisions where your result depends on a rival's choice. In a two-person zero-sum game you build a payoff matrix, find maximin and minimax values, check for a saddle point, and if none exists, use dominance, the 2x2 formulas or the graphical method to find the mixed strategy and value of the game.

What this chapter covers

Game Theory deals with competitive decisions. Two players choose strategies. Each pair of choices gives a payoff, and one player's gain is the other's loss. This is a two-person zero-sum game. The chapter teaches you to read the payoff matrix and pick the best strategy for each side.

The chapter has a clear solving path. First test for a saddle point using maximin and minimax. If the two values are equal, the game has a pure strategy solution. If not, simplify the matrix with the dominance rule. Then solve the reduced game with 2x2 formulas, or with the graphical method when one player has only two strategies.

In Strategic Cost Management, this chapter sits with other decision tools: pricing, competitor analysis and strategic choices under uncertainty. Game theory shows how to reason about a rival's likely moves. The numerical method is mechanical, so it is a good chapter for scoring steady marks if you practise the steps.

Game Theory is short, rule-based and numerical. Once you know the order of steps, a problem becomes a routine exercise with little room for judgement errors, so it rewards practice more than most chapters. It can appear as a Section A MCQ on saddle point or value of the game, or as a descriptive and numerical question that asks for strategies and the game value. The applications and limitations part also lets you add a short, decision-oriented comment, which fits the way this paper is examined.

Game Theory: topics in the order to study them

  1. 1Introduction to Game Theory and Basic ConceptsYou need the terms first: players, strategies, payoff matrix, zero-sum, value of the game.
  2. 2Pure Strategy: Maximin, Minimax and Saddle PointThis is the first test for every problem, and it gives the simplest solution.
  3. 3Mixed Strategy and 2x2 GamesWhen there is no saddle point, you need the probability-based solution, and 2x2 is the base case.
  4. 4Dominance Rule and Reduction of GamesIt shrinks larger matrices toward 2x2 form before you apply the formulas.
  5. 5Graphical Method for 2xn and mx2 GamesIt handles matrices that dominance cannot reduce to 2x2, and it builds on mixed strategy.
  6. 6Applications and Limitations of Game TheoryStudy it last, once the method is clear, so you can comment on where it helps and where it fails.

How to prepare Game Theory

Treat this chapter as a fixed procedure. Your aim is to apply the same sequence of steps to every matrix, without skipping any.

  1. Learn the terms and write a one-line meaning of each: strategy, payoff, zero-sum, value of the game, fair game.
  2. Practise finding row minima, column maxima, maximin and minimax until you can do it quickly. Always state whether a saddle point exists.
  3. Learn the 2x2 mixed strategy formulas and derive them once yourself, so you do not mix up the rows and columns.
  4. Practise dominance on 3x3 and 4x4 matrices. Check rows and columns in turn, and repeat until no more can be removed.
  5. Solve graphical problems on paper with a scale. Mark the lower or upper envelope carefully and read the point correctly.
  6. After each solution, verify by substituting the probabilities and checking that the value of the game comes out the same from both players' sides.
  7. Prepare a short answer on applications and limitations, with two or three business examples such as pricing and advertising.

Common mistakes in Game Theory

  • Declaring a saddle point without comparing maximin and minimax

    Fix: Write all row minima and column maxima, then compare the maximin and minimax before concluding.

  • Applying dominance in the wrong direction for the column player

    Fix: Remember that the column player prefers smaller payoffs. Drop the column with larger values in every row.

  • Using the 2x2 formula when a saddle point exists

    Fix: Always test for a saddle point first. If one exists, give the pure strategies and value directly.

  • Swapping the probabilities between rows or columns

    Fix: Check that each player's probabilities add to 1, and verify the value of the game from both sides.

  • Poor graph scale and unclear envelope in the graphical method

    Fix: Use a clear scale, label every line, and mark the correct bound for the player you are solving for before locating the point.

  • Writing a generic answer on applications and limitations

    Fix: Tie each point to a decision such as pricing, advertising or tendering, and state specific limits like the zero-sum assumption.

Last-day revision: Game Theory

  • Game theory models decisions where the outcome depends on a competitor's choice.
  • Two-person zero-sum game: one player's gain equals the other's loss.
  • Row player seeks the maximin: the maximum of the row minima.
  • Column player seeks the minimax: the minimum of the column maxima.
  • Saddle point exists when maximin = minimax; that common value is the value of the game.
  • A game with value zero is a fair game.
  • With no saddle point, players use mixed strategies: probabilities over their choices.
  • Dominance: a row can be dropped if another row is at least as good in every column; a column can be dropped if another column is at least as good for the column player, meaning smaller or equal payoffs.
  • For a 2x2 game with payoffs a, b / c, d, and no saddle point, the row player's probability of the first row = (d − c) ÷ ((a + d) − (b + c)).
  • Value of the game for 2x2 = (ad − bc) ÷ ((a + d) − (b + c)).
  • Graphical method suits games where one player has only two strategies.
  • Limitations: assumes rational players, known payoffs and a zero-sum setting, which real markets rarely meet.

Game Theory practice questions

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.

Game Theory: frequently asked questions

How do I know if a game has a saddle point?

Find the minimum in each row and take the largest of these, the maximin. Find the maximum in each column and take the smallest of these, the minimax. If both are equal, a saddle point exists and that value is the value of the game.

When should I use the dominance rule?

Use it when there is no saddle point and the matrix is larger than 2x2. Remove dominated rows and columns repeatedly. It often reduces the game to 2x2, which you then solve with the formulas.

What is the graphical method used for?

It is used for games where one player has only two strategies, either 2xn or mx2. You plot the payoff lines against the probability, find the relevant bound, and read off the best mixed strategy and the game value.

Is Game Theory more likely to be asked as an MCQ or a long question?

Both are possible. Section A can test saddle point, fair game or dominance in a single step. A longer question can ask you to reduce a matrix and find the strategies and the value. Prepare for both.