Skip to content

CMA Intermediate · Management Accounting

Decision Theory for CMA Intermediate Management Accounting

Decision theory is a method for choosing the best action when outcomes depend on events you do not control. You build a payoff table, apply a criterion (maximin, maximax, minimax regret, or EMV when probabilities are known), compare the results, and pick the best action. Decision trees do this in stages.

What this chapter covers

Decision Theory teaches you to choose between alternatives when the result depends on uncertain future events, such as demand, prices or weather. You list the actions, list the possible states of nature, and record the payoff for each combination in a payoff table. Every method in the chapter starts from this table.

The chapter splits by how much you know about the future. Under uncertainty, you have no probabilities, so you use criteria such as maximin, maximax, Hurwicz and minimax regret. Under risk, you have probabilities, so you use Expected Monetary Value (EMV) and Expected Opportunity Loss (EOL). You then price the value of better information with EVPI, handle multi-stage choices with decision trees, and finish with utility theory, which allows for a decision maker's attitude to risk.

The chapter links to the rest of Management Accounting. Payoffs often come from contribution, relevant costing and cost-volume-profit work, and the expected-value idea also appears in budgeting and forecasting under uncertainty. Practising it also builds the habit of laying out workings clearly, which earns step marks across the paper.

Decision Theory is a compact, rule-based chapter, so it rewards practice more than reading. The methods are mechanical once the payoff table is right, which makes it a good source of numerical marks and of quick MCQs on definitions and criteria. Students who learn the layouts and the interpretation lines can score well in a short time. The same students who skip it lose easy marks because the questions are usually solvable in a fixed sequence of steps.

Decision Theory: topics in the order to study them

  1. 1Introduction to Decision Making and Decision TheoryStart here to learn the vocabulary: actions, states of nature, payoffs, and the payoff table that every later method uses.
  2. 2Decision Making under UncertaintyThese criteria need only the payoff table and no probabilities, so they are the simplest numerical step after the basics.
  3. 3Decision Making under Risk: EMV and EOLAdding probabilities gives expected values; you also need the regret (opportunity loss) table from the uncertainty topic.
  4. 4Expected Value of Perfect Information (EVPI)EVPI is built directly from EMV and EOL, so study it once those are solid.
  5. 5Decision Tree AnalysisTrees combine EMV with several decision points, so you need EMV clear before you fold back a tree.
  6. 6Utility Theory and Other Decision ApproachesThis is mostly conceptual and shows why EMV alone can mislead, so it fits best at the end.

How to prepare Decision Theory

Treat this as a practice chapter. Learn each method as a short routine, then repeat it on new numbers until the layout is automatic.

  1. Write the key terms in your own words: action, state of nature, payoff, regret, expected value. Check each against a small example.
  2. Learn the uncertainty criteria with one fixed payoff table. Work out maximax, maximin, Hurwicz and minimax regret on the same table so you see how the answers differ.
  3. For risk problems, always compute EMV first. Then build the regret table and compute EOL. The action with the highest EMV must also have the lowest EOL, so use this as a self-check.
  4. Calculate EVPI as EMV with perfect information minus the best EMV without it. Confirm it equals the lowest EOL.
  5. Draw decision trees by hand: squares for decisions, circles for chance events. Work from right to left, write the EMV at each circle, and cross out the rejected branches.
  6. Solve past questions in full exam format with the table, workings, decision and one-line conclusion. Time yourself to fit a 14-mark question.
  7. Before the exam, practise MCQs on definitions and criteria, since they test whether you know which rule fits which situation.

Common mistakes in Decision Theory

  • Building the regret table by subtracting along the wrong direction.

    Fix: For each state, take the best payoff in that column and subtract every payoff from it. Regret is never negative.

  • Choosing the highest EOL or the highest regret as the answer.

    Fix: Regret measures loss, so pick the lowest EOL. Check that it matches the action with the highest EMV.

  • Calculating EVPI from the wrong figures.

    Fix: Compute Σ (probability × best payoff in each state), then subtract the best EMV without information. Cross-check with the lowest EOL.

  • Folding a decision tree from left to right or ignoring costs on branches.

    Fix: Start at the end branches, compute EMV at each chance node, choose at each decision node, and deduct branch costs before comparing.

  • Using maximin and minimax regret for cost tables without adjusting.

    Fix: For costs, the best payoff is the lowest. Reverse the logic: minimise the maximum cost, and measure regret from the lowest cost in each state.

  • Giving a number with no decision or interpretation.

    Fix: End every answer with a clear line naming the recommended action, the criterion used and the value.

Last-day revision: Decision Theory

  • A payoff table lists actions against states of nature, with the payoff in each cell.
  • Maximax picks the action with the best of the best payoffs; it is the optimist's rule.
  • Maximin picks the action with the best of the worst payoffs; it is the pessimist's rule.
  • Minimax regret: build the regret table, find each action's maximum regret, then choose the smallest.
  • Hurwicz uses a coefficient of optimism α: α × best + (1 − α) × worst for each action.
  • Laplace assumes equal probabilities for all states and picks the highest average payoff.
  • EMV = Σ (probability × payoff) for each action; choose the highest for profits.
  • EOL = Σ (probability × regret); choose the lowest. It selects the same action as the highest EMV.
  • EVPI = EMV with perfect information − best EMV without it = minimum EOL.
  • Decision trees: squares are decisions, circles are chance events; fold back from right to left.
  • Subtract any cost of a stage from the branch value before comparing alternatives.
  • Utility theory allows for risk attitude; EMV treats the decision maker as risk neutral.

Decision Theory practice questions

Decision Theory in other exams

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

Decision Theory: frequently asked questions

Is Decision Theory a difficult chapter in CMA Inter Management Accounting?

It is usually considered manageable because the methods follow fixed steps. The risk is careless errors in the payoff or regret table. Regular practice with full workings removes most of that risk.

What is the difference between decision making under uncertainty and under risk?

Under uncertainty, you know the possible outcomes but not their probabilities, so you use criteria such as maximin or minimax regret. Under risk, you know the probabilities and can use expected values such as EMV and EOL.

How are EMV, EOL and EVPI related?

The action with the highest EMV has the lowest EOL. That lowest EOL equals the EVPI. This gives you a quick check on your answer.

How should I attempt a decision tree question in the exam?

Draw the tree neatly with squares for decisions and circles for chance events. Fold back from right to left, write the EMV at each node, and cross out rejected branches. State the best strategy and its expected value at the end.