33. In respect ofa two-person, zero-sum game, the following paY-offmatrix is given:

(a) Show that the above game has no saddle point.

(b) Show that the game cannot be reduced by applying dominance rule.
(

c) Formulate the game as a linear programming problem for player Y and obtain his optimal strategy.

(d) Obtain the value of the game.

Transcribed Image Text:

Player X Y Player Y Y Y3 X3 522 *** -2 -2 -2 -2 1 222 -2 -2