Find Solution of game theory problem using dominance method
| Player A\Player B | B1 | B2 | B3 |
| A1 | 1 | 7 | 2 |
| A2 | 6 | 2 | 7 |
| A3 | 5 | 1 | 6 |
Solution:
2. Dominance rule to reduce the size of the payoff matrix
Using dominance property
| | | Player `B` | | |
| | | `B_1` | `B_2` | `B_3` | | |
| Player `A` | `A_1` | | 1 | 7 | 2 | |
| `A_2` | | 6 | 2 | 7 | |
| `A_3` | | 5 | 1 | 6 | |
row-3 `<=` row-2, so remove row-3
| | | Player `B` | | |
| | | `B_1` | `B_2` | `B_3` | | |
| Player `A` | `A_1` | | 1 | 7 | 2 | |
| `A_2` | | 6 | 2 | 7 | |
column-3 `>=` column-1, so remove column-3
| | | Player `B` | | |
| | | `B_1` | `B_2` | | |
| Player `A` | `A_1` | | 1 | 7 | |
| `A_2` | | 6 | 2 | |
This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then
