TOPICS
Search

Minimax Theorem


The fundamental theorem of game theory which states that every finite, zero-sum, two-person 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^(T)AY=min_(Y)max_(X)X^(T)AY=v,

where v is called the value of the game and X and Y are called the solutions. 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

Game, Game Theory, Mixed Strategy

Explore with Wolfram|Alpha

References

Willem, M. Minimax Theorem. Boston, MA: Birkhäuser, 1996.

Referenced on Wolfram|Alpha

Minimax Theorem

Cite this as:

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

Subject classifications