liveBook · Manning

Maximin method

As explained in Timeless Algorithms, The Foundational Ideas

Maximin is a decision heuristic that selects the option with the best worst-case outcome.

Maximin selects the alternative with the best worst-case outcome. It prioritizes caution over potential gains, focusing on the worst case rather than weighting all outcomes by their probabilities. section 2.3.3

Unlike expected value, which weighs possible outcomes by their probabilities, maximin emphasizes the downside. Maximax focuses on the greatest possible payoff; minimax regret limits the largest possible regret. section 2.3.3

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines the selection rule and contrasts it with expected value, maximax, and minimax regret.
What you can do after
Evaluate uncertain alternatives by comparing their worst-case outcomes.
How it connects
Connects maximin with expected value, maximax, and minimax regret as alternative decision rules.

Also explained in

Compare how 2 books explain maximin 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.