Question 1

Consider the zero-sum game where player 1 has matrix A=(2352341653211322). It is claimed that the strategies x_=(19,0,89,0) and y_=(0,79,29,0) are optimal.

  1. Is this correct? Give reasons for your answer.

  2. If x_=(1333,533,0,1533) is optimal and v(A)=2633 then find y_.

Question 2

In a game of baseball, a batter (player 1) expects the pitcher (player 2) to throw a fastball, slider, or curveball. We model this as a zero sum game with payoff matrix for player 1 given by A=(0.300.250.200.260.330.280.280.300.33).

  1. Determine the gain floor and loss ceiling of this game.

  2. It turns out that an optimal strategy for player 1 is given by x_=(27,0,57), and the value of the game is 27. What is the optimal strategy for player 2?

Question 3

Consider the zero-sum game where player 1 has matrix A=(431222143033).

  1. Determine the gain floor and loss ceiling of this game.

  2. Use strict dominance with a suitable linear combination of strategies to eliminate one row from this matrix to form a new game.

  3. Use the Equality of Payoffs Theorem to determine whether it is possible to have a mixed Nash equilibrium for this new game where player one’s strategy is of the form (a,b,c) with a,b,c>0.