b) c) d) (Hint: remove dominated strategies!) 11.3 Game Theory and Linear Programming Scenario: No saddle point (not strictly determined) no strategy” – “pure More than 2 choices for a player and matrix cannot be reduced by dominance (cannot use yesterday’s formulas) Convert the following playoff matrix to a linear programming problem. Example 1:
b) c) d) (Hint: remove dominated strategies!) 11.3 Game Theory and Linear Programming Scenario: No saddle point (not strictly determined) – no “pure strategy” More than 2 choices for a player and matrix cannot be reduced by dominance (cannot use yesterday’s formulas) Example 1: Convert the following playoff matrix to a linear programming problem.