Let the matrix in the attached picture represent a 2 players game.
In the mixing game, find the value that thecolumns player canassure to himself and a strategy of the rows-player that prevents the columns-player to get more than the value.
If are the strategies of the rows player and are the strategies of the columns player, then:
...I need to find the values of that minimize this expression...But have no idea how to do it...
Hope you'll be able to help me