If X∗ = (x ∗ 1 ,…, x ∗ n ) is an optimal strategy for player I and x∗1 = 0, then we may drop row 1 when we look for the optimal strategy for player II.

If X∗ = (x ∗ 1 ,…, x ∗ n ) is an optimal strategy for player I and x∗1 = 0, then we may drop row 1 when we look for the optimal strategy for player II.

If X∗ = (x ∗ 1 ,…, x ∗ n ) is an optimal strategy for player I and x∗1 = 0, then we may drop row 1 when we look for the optimal strategy for player II.

If X∗ = (x ∗ 1 ,…, x ∗ n ) is an optimal strategy for player I and x∗1 = 0, then we may drop row 1 when we look for the optimal strategy for player II.

READ ALSO :   Creating the proto type Skrill online payment service for an online casino