in game theory or decision making, a tactic in which an individual chooses the best of a set of worst possible outcomes or payoffs.

What is a maximum strategy in game theory?

A maximin strategy is a strategy in game theory where a player makes a decision that yields the ‘best of the worst’ outcome. All decisions will have costs and benefits, and a maximin strategy is one that seeks out the decision that yields the smallest loss.

How is maximin strategy determined?

Maximin Strategy = A strategy that maximizes the minimum payoff for one player. The maximin, or safety first, strategy can be found by identifying the worst possible outcome for each strategy. Then, choose the strategy where the lowest payoff is the highest.

What is maximin & Minimax in game theory?

zero-sum game: A zero-sum game is one in which the sum of the individual payoffs for each outcome is zero. Minimax strategy: minimizing one’s own maximum loss. Maximin strategy: maximize one’s own minimum gain.

What is maximin equilibrium?

Maximin equilibrium, just like maximin strategies, is a method for evaluating the uncertainty that players are facing by play- ing the game. We show that maximin equilibrium is invariant under strictly increasing transformations of the payoff functions.

What is maximin criteria?

The Maximin criterion is a pessimistic approach. It suggests that the decision maker examines only the minimum payoffs of alternatives and chooses the alternative whose outcome is the least bad.

What do you mean by maximin?

Definition of maximin : the maximum of a set of minima especially : the largest of a set of minimum possible gains each of which occurs in the least advantageous outcome of a strategy followed by a participant in a situation governed by game theory — compare minimax.

Is maximin the same as minimax?

“Maximin” is a term commonly used for non-zero-sum games to describe the strategy which maximizes one’s own minimum payoff. The minimax algorithm is a recursive algorithm for choosing the next move in an n-player game, usually a two-player game. A value is associated with each position or state of the game.

For what value of a the game is determinable?

A game is said to be strictly determinable if the maxmin and minmax values of the game are equal and both equal the value of the game.

How is minimax strategy used in games explain the strategy on the basis of game playing?

In game theory, minimax is a decision rule used to minimize the worst-case potential loss; in other words, a player considers all of the best opponent responses to his strategies, and selects the strategy such that the opponent’s best strategy gives a payoff as large as possible.

Article first time published on

How many types of strategies we have in game theory?

Therefore on the basis of outcome, the strategies of the game theory are classified as pure and mixed strategies, dominant and dominated strategies, minimax strategy, and maximin strategy.

Is Nash Equilibrium the best outcome?

Unlike dominant strategy, the Nash equilibrium doesn’t always lead to the most optimal outcome, it just means that an individual chooses the best strategy based on the information they have.

What do you understand by game theory and competitive strategy?

What Is Game Theory? Game theory is a theoretical framework for conceiving social situations among competing players. In some respects, game theory is the science of strategy, or at least the optimal decision-making of independent and competing actors in a strategic setting.

How do you do maximin?

The maximin criterion is as easy to do as the maximax. Except instead of taking the largest number under each action, you take the smallest payoff under each action (smallest number in each column). You then take the best (largest of these).

How do I use maximin?

The maximin rule involves selecting the alternative that maximises the minimum pay-off achievable. The investor would look at the worst possible outcome at each supply level, then selects the highest one of these. The decision maker therefore chooses the outcome which is guaranteed to minimise his losses.

What is Hurwicz criterion?

The Hurwicz criterion is arguably one of the most widely used rules in decision-making under uncertainty. It allows the decision maker to simultaneously take into account the best and the worst possible outcomes, by articulating a “coefficient of optimism” that determines the emphasis on the best end.

What is saddle point in game theory?

Definition (Saddle point). In a zero-sum matrix game, an outcome is a saddle point if the outcome is a minimum in its row and maximum in its column. … If a matrix game has a saddle point, both players should play it.

What happens when maximin and minimax values of the game are same?

Saddle Point • If the maximin value equals the minimax value, the the game is said to have a saddle (equilibrium) point and the corresponding strategies are called “Optimal Strategies” Value of game This is the expected payoff at the end of the game, when each player uses his optimal strategy • A game is said to be a …

What is the optimal decision based on maximin?

In decision theory and game theory, Wald’s maximin model is a non-probabilistic decision-making model according to which decisions are ranked on the basis of their worst-case outcomes – the optimal decision is one with the least bad worst outcome.

What happens when maximum and minimum values of the game are same?

If the maximin value is equal to minimax value, the game has a saddle point (i.e., equilibrium point). Thus the strategy selected by player A and player B are optimal.

Which method is used for solving a pure strategy game?

Pure strategy games can be solved by saddle point method. Decision of a Game. In Game theory, best strategy for each player is determined on the basis of some rule. Since both the players are expected to be rational in their approach this is known as the criteria of optimality.

What is meant by a two person zero-sum game?

A two player game is called a zero-sum game if the sum of the payoffs to each player is constant for all possible outcomes of the game. More specifically, the terms (or coordinates) in each payoff vector must add up to the same value for each payoff vector. Such games are sometimes called constant-sum games instead.

What is the difference between game with saddle point and game without saddle point?

If a game has no saddle point then the game is said to have mixed strategy. Step 1: Find out the row minimum and column maximum. Step 2: Find out the minimax and maximin values. Since minimax and maximin value of this game are not equal, this game has no saddle point.

What is payoff matrix in game theory?

In game theory, a payoff matrix is a table in which strategies of one player are listed in rows and those of the other player in columns and the cells show payoffs to each player such that the payoff of the row player is listed first.

What is Game Tree explain MIN MAX algorithm with example?

Mini-Max algorithm uses recursion to search through the game-tree. Min-Max algorithm is mostly used for game playing in AI. Such as Chess, Checkers, tic-tac-toe, go, and various tow-players game. This Algorithm computes the minimax decision for the current state.

What does the minimax theorem say?

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928.

How does minimax traverse the game tree?

The minimax algorithm moves through the tree using depth-first search. Meaning it traverses through the tree going from left to right, and always going the deepest it can go. It then discovers values that must be assigned to nodes directly above it, without ever looking at other branches of the tree.

What is Nash equilibrium in mixed strategies?

A mixed strategy Nash equilibrium involves at least one player playing a randomized strategy and no player being able to increase his or her expected payoff by playing an alternate strategy. … If a player is supposed to randomize over two strategies, then both must produce the same expected payoff.

Is there always a Nash equilibrium?

There does not always exist a pure Nash equilibrium. Theorem 1 (Nash, 1951) There exists a mixed Nash equilibrium. … for every i, hence must have pi(s, α) ≤ 0 for every i and every s ∈ Si, hence must be a Nash equilibrium. This concludes the proof of the existence of a Nash equilibrium.

What is the Nash equilibrium in pure strategies?

A pure-strategy Nash equilibrium is an action profile with the property that no single player i can obtain a higher payoff by choosing an action different from ai, given every other player j adheres to aj. For example, a game involves two players, each of whom could choose two available actions, which are X and Y.

What is Nash equilibrium for dummies?

A Nash Equilibrium in game theory is a collection of strategies, one for each player in a social game, where there is no benefit for any player to switch strategies. In this situation, all players the game are satisfied with their game choices at the same time, so the game remains at equilibrium.