|
gptkbp:instanceOf
|
Game theory concept
|
|
gptkbp:analyzes
|
gptkb:John_von_Neumann
|
|
gptkbp:assumes
|
Rational players
Perfect information
|
|
gptkbp:category
|
Competitive games
Constant-sum games
|
|
gptkbp:coauthor
|
gptkb:Oskar_Morgenstern
|
|
gptkbp:defines
|
A situation in which one participant's gain or loss is exactly balanced by the losses or gains of other participants.
|
|
gptkbp:example
|
gptkb:Matching_pennies
Chess
Poker
|
|
gptkbp:field
|
gptkb:Game_theory
|
|
gptkbp:firstFormalizedBy
|
gptkb:John_von_Neumann
|
|
gptkbp:firstFormalizedIn
|
1928
|
|
gptkbp:form
|
Payoff matrix
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Zero-sum games
|
|
gptkbp:numberOfPlayers
|
Two or more
|
|
gptkbp:opposedBy
|
Non-zero-sum games
|
|
gptkbp:property
|
Total gains and losses sum to zero
|
|
gptkbp:publishedIn
|
gptkb:Theory_of_Games_and_Economic_Behavior
|
|
gptkbp:relatedConcept
|
gptkb:Nash_equilibrium
gptkb:Minimax_theorem
|
|
gptkbp:solvedBy
|
Linear programming
Minimax algorithm
|
|
gptkbp:usedIn
|
gptkb:military
gptkb:Political_science
Economics
|
|
gptkbp:bfsParent
|
gptkb:Non-cooperative_games
gptkb:Infinite_stochastic_games
|
|
gptkbp:bfsLayer
|
7
|