Hi everyone, I have trouble proving this problem:
the question is:
Show that if a zero-sum game has a (pure) Nash equilibrium (i∗ , j∗ ), then the van
Neumann value of the game is
Hint. Show that and that
, and then use Minimax Theorem.
Now i understand that a Pure Nash Equilibrium means:
If the the first player plays strategy i and the 2nd player plays the strategy j then (i, j) is a Nash Equilibrium if every other entry in the same column as i is less than the strategy i and every entry on the same row as the strategy j for the second player is bigger than j. meaning none of the player can improve their strategy to gain better outcome.
the minmax theorem determines the von neumann value, which is basically the value of the game. and the theorem says: for the payoff matrix A of a zero sum game, there exists optimal mixed strategies P and Q for the row and column player respectedly, such that
for 0<=j<=n and 0<=i<=m and P and Q are mixed Nash Equilibrium.
= Sum (sum = sigma for 0 <= i <= m )
= Sum (sum = sigma for 0 <= j <= n )
I don't know how to show that . i know that i can pick any u that is u <= but I can't see how that would help. Should i take another approach?