In a zero-sum game, the gains of one player are exactly balanced by the losses of the other player.

Nash Equilibrium is a solution concept that predicts the outcome of a game when each player's strategy is a best response to the strategies of the other players.

In a cooperative game, players can form binding agreements, communicate and negotiate, and share information to achieve a mutually beneficial outcome.

The Prisoner's Dilemma is an example of a non-cooperative game, where players have conflicting interests and cannot communicate or form binding agreements.

In a mixed-strategy game, players randomize their choices according to a probability distribution, making it difficult for opponents to predict their actions.

The Minimax Theorem provides a solution to zero-sum games, where players aim to minimize their maximum possible loss or maximize their minimum possible gain.

In a cooperative game, players' strategies are interdependent and their payoffs depend on the joint actions of all players.

In a game with complete information, players have perfect knowledge of the game's rules, strategies, and payoffs.

In a non-cooperative game, players' strategies are independent and their payoffs depend only on their own actions.

In a game with incomplete information, players have incomplete information about the game's rules, strategies, and payoffs.

In a cooperative game, players can form binding agreements and share information.

In a game with perfect information, players have perfect knowledge of the game's rules, strategies, and payoffs.

In a cooperative game, players' strategies are interdependent and their payoffs depend on the joint actions of all players.

In a game with incomplete information, players have incomplete information about the game's rules, strategies, and payoffs.

In a cooperative game, players can form binding agreements and share information.