liveBook · Manning

Maximax method

As explained in Timeless Algorithms, The Foundational Ideas

Maximax is a decision heuristic that selects the option with the highest possible outcome.

Maximax is an optimistic decision heuristic: it selects the option with the greatest possible payoff, without accounting for how likely that payoff is. Unlike expected value, which weights outcomes by probability, maximax focuses only on the best-case result. section 2.3.3

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines maximax and contrasts its best-case focus with expected value, maximin, and minimax regret.
What you can do after
Evaluate uncertain options by identifying which has the greatest possible payoff, while recognizing that maximax ignores outcome probabilities.
How it connects
Connects maximax with expected value, maximin, and minimax regret as alternative decision rules under uncertainty.

Also explained in

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