Problem: Calculus method of Game Theory {{2,-1},{-1,1}} [ Calculator, Method and examples ]
Solution: Your problem `->` Calculus method of Game Theory {{2,-1},{-1,1}}
1. Saddle point testing Players
| | | Player `B` | | | | | | `B_1` | `B_2` | | | Player `A` | `A_1` | | 2 | -1 | | | `A_2` | | -1 | 1 | | |
We apply the maximin (minimax) principle to analyze the game.
| | | Player `B` | | | | | | `B_1` | `B_2` | | Row Minimum | Player `A` | `A_1` | | 2 | [-1] | | `[-1]` | `A_2` | | -1 | (1) | | `-1` | | Column Maximum | | `2` | `(1)` | | |
Select minimum from the maximum of columns Column MiniMax = (1)
Select maximum from the minimum of rows Row MaxiMin = [-1]
Here, Column MiniMax `!=` Row MaxiMin
`:.` This game has no saddle point.
|
|
For next solution steps, click on the below link
Solution provided by AtoZmath.com
|