Minimax theorem

Minimax theorem Not to be confused with Min-max theorem.

In the mathematical area of game theory, 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. Da allora, several generalizations and alternative versions of von Neumann's original theorem have appeared in the literature.[1][2] Contenuti 1 Zero-sum games 1.1 Esempi 2 Guarda anche 3 References Zero-sum games The function f(X,y)=y2-x2 is concave-convex.

The minimax theorem was first proven and published in 1928 by John von Neumann,[3] 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".[4] Formalmente, von Neumann's minimax theorem states: Permettere {displaystyle Xsubset mathbb {R} ^{n}} e {displaystyle Ysubset mathbb {R} ^{m}} be compact convex sets. Se {stile di visualizzazione f:Xtimes Yrightarrow mathbb {R} } is a continuous function that is concave-convex, cioè.

{stile di visualizzazione f(cdot ,y):Xrightarrow mathbb {R} } is concave for fixed {stile di visualizzazione y} , e {stile di visualizzazione f(X,cdot ):Yrightarrow mathbb {R} } is convex for fixed {stile di visualizzazione x} .

Then we have that {stile di visualizzazione massimo _{xin X}min _{yin y}f(X,y)=min_{yin y}massimo _{xin X}f(X,y).} Examples If {stile di visualizzazione f(X,y)=x^{T}Ay} for a finite matrix {displaystyle Ain mathbb {R} ^{ntimes m}} , noi abbiamo: {stile di visualizzazione massimo _{xin X}min _{yin y}x^{T}Ay=min _{yin y}massimo _{xin X}x^{T}Ay.} See also Sion's minimax theorem Parthasarathy's theorem — a generalization of Von Neumann's minimax theorem Dual linear program can be used to prove the minimax theorem for zero-sum games. Yao's minimax principle References ^ Du, Ding-Zhu; Pardalos, Panos M., eds. (1995). Minimax and Applications. Boston, MA: Springer USA. ISBN 9781461335573. ^ Brandt, Felice; Brill, Marco; Suksompong, Warut (2016). "An ordinal minimax theorem". Games and Economic Behavior. 95: 107–112. arXiv:1412.4198. doi:10.1016/j.geb.2015.12.010. ^ Von Neumann, J. (1928). "Zur Theorie der Gesellschaftsspiele". Matematica. Anna. 100: 295–320. doi:10.1007/BF01448847. ^ John L Casti (1996). Five golden rules: great theories of 20th-century mathematics – and why they matter. New York: Wiley-Interscience. p. 19. ISBN 978-0-471-00261-1.

Questo articolo relativo all'analisi matematica è solo un abbozzo. Puoi aiutare Wikipedia espandendolo.

Questo articolo sulla teoria dei giochi è solo un abbozzo. Puoi aiutare Wikipedia espandendolo.

Categorie: Teoria dei giochiOttimizzazione matematicaTeoremi matematici Stub di analisi matematica Stub di microeconomia Stub di teorie economiche