def. Zero Sum Game. When each box in the payoff (cost) matrix sums to zero.

thm. Min-Max Theorem. The stackleberg solution in a zero-sum game for player one going first, is same for player two going first. Thus this is a mixed nash equilibirum. You can compute this using Linear Programming. Example. In the following game: Row player will aim to:

This is also known as the Stackleberg solution. Letting we have the following linear program:

Equivalently, column player will aim to . Letting We have the following linear program:

In a Zero Sum Game like this game, the above two linear programs are dual problems to each other. The solution to both of these programs are: