Prove the minimax theorem by extending the previous exercise to an arbitrary two-person zero-sum game with v2

Question:

Prove the minimax theorem by extending the previous exercise to an arbitrary two-person zero-sum game with v2 = c ≠ 0.
Previous exercise
Let A be a m × n matrix which represents (exercise 3.253) the payoff function of a two-person zero-sum game in which player 1 has m pure strategies and player 2 has n strategies. Let Z be the convex hull of the columns of A, that is, Z = {z = Aq : q ∈ Δn-1}. Assume that v2 = 0.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: