TOPICS
Search

Minimax Theorem


The minimax theorem states that every two-person finite game that is a zero-sum game has optimal mixed strategies. It was proved by John von Neumann in 1928.

Formally, let X and Y be mixed strategies for players A and B. Let A be the payoff matrix. Then

 max_(X)min_(Y)X^TAY=min_(Y)max_(X)X^TAY=v,

where v is called the game value and X and Y are optimal mixed strategies. It also turns out that if there is more than one optimal mixed strategy, there are infinitely many.

In the Season 4 opening episode "Trust Metric" (2007) of the television crime drama NUMB3RS, math genius Charlie Eppes mentions that he used the minimax theorem in an attempt to derive an equation describing friendship.


See also

Finite Game, Game, Game Theory, Game Value, Minimax Search, Mixed Strategy, Zero-Sum Game

Explore with Wolfram|Alpha

References

von Neumann, J. "Zur Theorie der Gesellschaftsspiele." Math. Ann. 100, 295-320, 1928. https://doi.org/10.1007/BF01448847.

Referenced on Wolfram|Alpha

Minimax Theorem

Cite this as:

Weisstein, Eric W. "Minimax Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MinimaxTheorem.html

Subject classifications