Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
zero-sum games
|
| gptkbp:field |
gptkb:mathematics
game theory |
| gptkbp:formedBy |
gptkb:John_von_Neumann
|
| gptkbp:generalizes |
von Neumann's minimax theorem for infinite games
|
| https://www.w3.org/2000/01/rdf-schema#label |
minimax theorem
|
| gptkbp:publishedIn |
gptkb:Mathematische_Annalen
gptkb:Zur_Theorie_der_Gesellschaftsspiele |
| gptkbp:relatedConcept |
gptkb:Nash_equilibrium
saddle point maximin strategy minimax strategy |
| gptkbp:state |
In zero-sum games with finite strategies, there exists a value such that both players can guarantee at least this value by choosing appropriate strategies.
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
computer science decision theory economics |
| gptkbp:yearProposed |
1928
|
| gptkbp:bfsParent |
gptkb:Game_theory
gptkb:Game_Theory |
| gptkbp:bfsLayer |
5
|