Bimatrix games are a particular instance of strategic form games, the two player, general sum case. The Prisoner's dilemma, one of the best known problems in game theory, is an example of such a game.

For a strategic form game X,Y,A,B, the Bimatrix representation is a matrix whose entries are ordered pairs (a_{ij},b_{ij}) of elements of the payoff matrices A and B:

(a_{11},b_{11}) . . . (a_{1n},b_{1n})
. . .
. . .
. . .
(a_{m1},b_{m1}) . . . (a_{mn},b_{mn})

For a concrete example, consider the game of Two finger morra, which has the following Bimatrix form:

+--------------+--------------+
| | |
| -2 , 2 | 3 , -3 |
| | |
+--------------+--------------+
| | |
| 3 , -3 | -4 , 4 |
| | |
+--------------+--------------+

Part of *A survey of game theory*- see project homenode for details and links to the print version.