Minimax regret method
A decision method that selects the alternative with the smallest maximum regret relative to the best alternative under each possible scenario.
Statistics Every Programmer Needs
The minimax regret method selects the alternative that minimizes the largest possible difference between its payoff and the best payoff in each scenario.
- How it is used
- Selects decisions under uncertain states of nature when reliable probabilities are unavailable.
- How deep it goes
- Calculates regret tables, row-wise worst cases, and the final minimum, without developing probability-based evaluation.
- Examples
- Uses investment payoffs under Strong Economy and Weak Economy scenarios, producing a minimum maximum regret of 55000.
- What you can do after
- Apply it via Python to construct regret tables and select the alternative with the lowest worst-case regret.
Read how Statistics Every Programmer Needs explains minimax regret method →
Timeless Algorithms, The Foundational Ideas
Minimax regret is a decision heuristic that selects the option minimizing the worst possible regret relative to the best alternative in hindsight.
- How it is used
- Frames minimax regret as a heuristic for comparing alternatives under uncertainty.
- How deep it goes
- Defines regret as a hindsight shortfall and describes minimizing its maximum, without a worked calculation.
- What you can do after
- Evaluate uncertain alternatives by limiting the greatest possible hindsight regret.
Read how Timeless Algorithms, The Foundational Ideas explains minimax regret method →
Related concepts
- regretuses · Regret is the difference between the reward or utility obtained from a choice and that obtainable from the best alternative under the same circumstances, often accumulated across decisions.
- decision makingkind of · Decision making is the process of selecting an action, outcome, or judgment from available alternatives based on information, objectives, or constraints.
- maximax methodcontrasts with · The maximax method selects the alternative with the highest possible payoff among all alternatives and possible states.
- maximin methodcontrasts with · The maximin method selects the alternative whose worst possible payoff is greatest among all alternatives.
- meanalternative to · The mean is a measure of central location equal to the arithmetic average of numerical observations, or the probability-weighted average of a random variable’s possible values.
Questions about minimax regret method
What is minimax regret method?
A decision method that selects the alternative with the smallest maximum regret relative to the best alternative under each possible scenario.
Which Manning books explain minimax regret method?
Statistics Every Programmer Needs and Timeless Algorithms, The Foundational Ideas.
What is the difference between minimax regret method and maximax method?
A decision method that selects the alternative with the smallest maximum regret relative to the best alternative under each possible scenario. The maximax method selects the alternative with the highest possible payoff among all alternatives and possible states.
What is minimax regret method a kind of?
Minimax regret method is a kind of decision making. Decision making is the process of selecting an action, outcome, or judgment from available alternatives based on information, objectives, or constraints.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

