

The following example of a zero-sum game, where A and B make simultaneous moves, illustrates maximin solutions. See also example of a game without a value.Įxample Payoff matrix for player A

The name minimax arises because each player minimizes the maximum payoff possible for the other-since the game is zero-sum, they also minimize their own maximum loss (i.e. (a) Given player 2's strategy, the best payoff possible for player 1 is V, and (b) Given player 1's strategy, the best payoff possible for player 2 is −V.Įquivalently, Player 1's strategy guarantees them a payoff of V regardless of Player 2's strategy, and similarly Player 2 can guarantee themselves a payoff of −V. In the context of zero-sum games, the minimax theorem is equivalent to: įor every two-person, zero-sum game with finitely many strategies, there exists a value V and a mixed strategy for each player, such that In two-player zero-sum games, the minimax solution is the same as the Nash equilibrium. Its formal definition is: v i _ = max a i min a − i v i ( a i, a − i ) resulting from both players playing their maximin strategy. The maximin value is the highest value that the player can be sure to get without knowing the actions of the other players equivalently, it is the lowest value the other players can force the player to receive when they know the player's action. 3.2 Minimax criterion in statistical decision theory.2.1 Minimax algorithm with alternate moves.This solution uses all the resources available. This solution gives the maximum profit of 25600. Check 'Make Unconstrained Variables Non-Negative' and select 'Simplex LP'.Ĭonclusion: it is optimal to order 94 bicycles and 54 mopeds. Click Add to enter the following constraint.Ħ. Enter OrderSize for the Changing Variable Cells.ĥ. You have the choice of typing the range names or clicking on the cells in the spreadsheet.Ĥ. The result should be consistent with the picture below. On the Data tab, in the Analyze group, click Solver.Įnter the solver parameters (read on). To find the optimal solution, execute the following steps.ġ. We shall describe next how the Excel Solver can be used to quickly find the optimal solution.
SOLVER EXCEL FOR MAC TRIAL
It is not necessary to use trial and error. This solution has a total profit of 19000. With this formulation, it becomes easy to analyze any trial solution.įor example, if we order 20 bicycles, 40 mopeds and 100 child seats, the total amount of resources used does not exceed the amount of resources available. Total Profit equals the sumproduct of UnitProfit and OrderSize. The amount of storage used equals the sumproduct of the range C8:E8 and OrderSize. Insert the following three SUMPRODUCT functions.Įxplanation: The amount of capital used equals the sumproduct of the range C7:E7 and OrderSize. To make the model easier to understand, create the following named ranges. What is the overall measure of performance for these decisions? The overall measure of performance is the total profit of the three products, so the objective is to maximize this quantity.Ģ. For example, each bicycle uses 300 units of capital and 0.5 unit of storage.Ĭ. What are the constraints on these decisions? The constrains here are that the amount of capital and storage used by the products cannot exceed the limited amount of capital and storage (resources) available. What are the decisions to be made? For this problem, we need Excel to find out how much to order of each product (bicycles, mopeds and child seats).ī. To formulate this linear programming model, answer the following three questions.Ī. The model we are going to solve looks as follows in Excel.ġ. You can find the Solver on the Data tab, in the Analyze group. Under Add-ins, select Solver Add-in and click on the Go button.Ĥ.
