This solver uses the excellent lrs - David Avis's implementation of Avis and Fukuda's reverse search algorithm for polyhedral vertex enumeration.

Solve a Bimatrix Game

back to homepage website history

Enter dimension of game e.g. 2 3 for 2x3 matrices
- currently requires (number of rows + number of columns)<31.

Enter payoff matrix A for player 1, e.g.
1 0 0
0 1 0
0 0 1

Enter type of game:

General m x n game (A,B)

Zerosum m x n game (A,-A)

Symmetric m x m game (A,AT)

For zerosum and symmetric games,
only enter payoff matrix A for player 1.


For symmetric games, m = n !

Enter payoff matrix B for player 2 (not required for zerosum or symmetric games).