Discover published sets by community

The Minimax algorithm is used in decision making and game theory to minimize the possible loss for a worst-case scenario. When dealing with gains, it is known as maximin. This algorithm is widely used in two-player turn-based games to find the best move, taking into account the opponent's possible responses.

A game tree is a graphical representation of the possible moves in a game, allowing players to visualize the consequences of each move. This is used in creating game strategies by analyzing possible sequences of moves and outcomes, enabling players to plan ahead.

Pareto Efficiency is a state of allocation of resources from which it is impossible to reallocate so as to make any one individual or preference criterion better off without making at least one individual or preference criterion worse off. In game strategy, it can be used to determine if a strategy has reached an optimum where no player can be better off without making another player worse off.

A zero-sum game is a mathematical representation in game theory where each participant's gain or loss is exactly balanced by the losses or gains of the other participant(s). When strategizing in zero-sum games, the goal for each player is to maximize their own payoff while minimizing the opponent's, often through competitive strategies.