Concept Architecture
Concept
Theoretically, Rollback is a mathematical evaluation procedure used in decision analysis to determine the optimal sequence of decisions in a decision tree by solving the tree from its terminal nodes back to the initial decision node. It is founded on the principles of expected utility and expected value theory, whereby chance events are evaluated before decisions are made. The concept exists to identify the decision pathway that maximises expected benefit or minimises expected cost under uncertainty.
Mathematically, rollback is performed using backward induction. Expected values are calculated at each chance node as the probability-weighted average of subsequent outcomes, while decision nodes retain the branch associated with the optimal expected value. The recursive evaluation continues until the root node is reached, producing the optimal decision strategy.
In practice, rollback is implemented after a complete decision tree has been constructed with all probabilities, costs and outcomes assigned. In health economics it is applied to evaluate diagnostic strategies, treatment pathways, screening programmes and health technology assessments by identifying the intervention with the highest expected net benefit or lowest expected expected cost.
Purpose
Used to evaluate decision trees by calculating expected values through backward induction, thereby identifying the optimal healthcare decision under uncertainty.
Mathematical Formulae
Primary Formula
Expected value at a chance node:
EV = ????� p?V?
where:
- EV = expected value
- p? = probability of outcome i
- V? = value (cost, utility, net benefit or payoff) associated with outcome i
Decision rule at a decision node:
V = max{V?, V?, ?, V?}*
or
V = min{V?, V?, ?, V?}*
depending on whether the objective is to maximise benefit or minimise cost.
Supporting Formulae
Expected Net Monetary Benefit:
NMB = ?E ? C
where:
- ? = willingness-to-pay threshold
- E = expected health effect
- C = expected cost
Related Mathematical Methods
- Backward induction
- Expected value analysis
- Decision tree analysis
- Expected utility theory
- Net monetary benefit analysis
- Expected value of perfect information
Example
A decision tree compares two treatment options.
Treatment A
- 80% probability of recovery with a payoff of �100,000
- 20% probability of treatment failure with a payoff of �20,000
Expected value:
EV? = 0.80(100,000) + 0.20(20,000) = 84,000
Treatment B
Expected value:
EV? = 76,000
During rollback, the chance nodes are evaluated first and the decision node retains Treatment A because
84,000 > 76,000.
Thus, Treatment A is selected as the optimal strategy.
Excel Implementation
| Function | Example Formula | Health Economics Application |
|---|---|---|
| SUMPRODUCT | =SUMPRODUCT(B2:B4,C2:C4) | Calculates expected values at chance nodes. |
| MAX | =MAX(D2:D5) | Selects the optimal strategy at decision nodes when maximising benefit. |
| MIN | =MIN(D2:D5) | Selects the least-cost strategy where appropriate. |
| IF | =IF(D2=MAX($D$2:$D$5),""Optimal"","""") | Identifies the preferred branch during rollback analysis. |
VBA (Optional)
A VBA procedure can automate rollback by evaluating decision trees recursively from the terminal nodes to the root node and identifying the optimal decision pathway.
Sources
- Raiffa H. Decision Analysis: Introductory Lectures on Choices Under Uncertainty. Addison-Wesley.
- TreeAge Software. TreeAge Pro User Guide.
- Briggs A, Claxton K, Sculpher M. Decision Modelling for Health Economic Evaluation. Oxford University Press.
- Drummond MF, Sculpher MJ, Claxton K, Stoddart GL, Torrance GW. Methods for the Economic Evaluation of Health Care Programmes. Oxford University Press.
- NICE. Health Technology Evaluation Manual.
- ISPOR Good Practice Reports on decision-analytic modelling.
Related Concepts (2)
Frequently Asked Questions (6)
What is rollback in a decision tree?
An alternative term for folding back, the process of solving a decision tree by working backward from final outcomes to the initial node.
Source: Weinstein & Fineberg 1980
What does rollback produce for each strategy?
Solving a tree by rollback yields, for each strategy the decision-maker could choose at the start, a single summary value of what that strategy is worth, usually its expected cost and expected outcome. Working from the final outcomes back to the opening decision, the method reduces every branching possibility beyond a strategy to one expected figure. Comparing these figures across strategies is what allows the best option to be identified. The output is therefore a ranking of the initial choices. Hunink and colleagues (2014) describe this result.
Source: Hunink et al. 2014
How does rollback solve a decision tree?
Rollback solves a decision tree by beginning at the terminal nodes, where outcomes are known, and moving backward. At each chance node it averages the values of the branches, weighting them by their probabilities, and at each decision node it selects the branch with the best expected value. Carrying these values back toward the root yields the expected value of each initial strategy. This backward evaluation combines all the probabilities and payoffs in the tree into the expected results used to compare options.
Source: Weinstein & Fineberg 1980
Why is rollback done backward?
Rollback is done backward because the value of an earlier decision depends on what follows it, so the consequences of later events and choices must be evaluated before an earlier choice can be assessed. Starting from the known terminal outcomes and working back, each node's value is computed from the values of the nodes after it, which are already determined. This backward order ensures that when a decision node is reached, the expected values of all its options are available, so the best can be chosen.
Source: Weinstein & Fineberg 1980
How does rollback treat chance and decision nodes?
Rollback treats the two node types differently. At a chance node, where outcomes are uncertain and not chosen, it averages, computing the probability-weighted mean of the branches' values. At a decision node, where the option is chosen, it maximises, selecting the branch with the best expected value. This reflects that uncertainty is averaged over while choices are optimised. By combining averaging at chance nodes and selection at decision nodes, rollback correctly evaluates the tree to find the best strategy.
Source: Weinstein & Fineberg 1980
Is rollback the same as folding back?
Yes, rollback and folding back are the same process under different names: both refer to solving a decision tree by working backward from the terminal outcomes to the initial node, averaging at chance nodes and selecting at decision nodes to find the expected value of each strategy. The terms are used interchangeably in decision analysis. Backward induction is another name for the same procedure. Whichever term is used, it denotes the standard method of evaluating a decision tree.
Source: Weinstein & Fineberg 1980
Trust Record
Verified by Dr Darrin Baines
British health economist
Professional identity: darrinbaines.org
Verification date: 3 Oct 2025
Content version: 1.0.0
Canonical Identity
- Persistent URI
- https://healtheconomics.wiki/concept/rollback
- Term code
- HE-EM-DM-087
Stable URI · Machine-readable · Resolvable · CC BY 4.0