Minimax theorem

From Wikipedia, the free encyclopedia
Jump to: navigation, search

A minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality. The first theorem in this sense is von Neumann's minimax theorem from 1928, which was considered the starting point of game theory. Since then, several alternative generalizations of von Neumann's original theorem have appeared in the literature.[1]

Zero-sum Games[edit]

In game theory, and more precisely the theory of zero-sum games, the minimax theorem shows that the minimax solution of a zero-sum game is the same as the Nash equilibrium. The theorem was first proven and published in 1928 by John von Neumann,[2] who is quoted as saying "As far as I can see, there could be no theory of games … without that theorem … I thought there was nothing worth publishing until the Minimax Theorem was proved".[3]

Formally, von Neumann's minimax theorem states:

Let and be compact convex sets. If is a continuous function that is convex-concave, i.e.

is convex for fixed , and
is concave for fixed .

Then we have that

References[edit]

  1. ^ Du, Ding-Zhu; Pardalos, Panos M., eds. (1995). Minimax and Applications. Boston, MA: Springer US. ISBN 9781461335573. 
  2. ^ Von Neumann, J: Zur Theorie der Gesellschaftsspiele Math. Annalen. 100 (1928) 295–320
  3. ^ John L Casti (1996). Five golden rules: great theories of 20th-century mathematics – and why they matter. New York: Wiley-Interscience. p. 19. ISBN 0-471-00261-5. 

See also[edit]