liveBook · Manning

Minimax regret method

As explained in 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.

Minimax regret chooses the alternative whose largest possible regret is smallest. Regret is the difference between the chosen outcome and the best outcome available in hindsight. section 2.3.3

How Timeless Algorithms, The Foundational Ideas covers it

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.
How it connects
Contrasts minimax regret with expected value, maximax, and maximin.

Also explained in

Compare how 2 books explain minimax regret method →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.