Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games

• DOI: 10.1007/s10957-006-9070-3
• Publication Date: 2006-11-28T20:09:44Z
• Authors: C. Audet; S. Belhaiza; P. Hansen
• Keywords: Enumeration; Theory of computation

Bimatrix and polymatrix games are expressed as parametric linear 0–1 programs. This leads to an algorithm for the complete enumeration of their extreme equilibria, which is the first one proposed for polymatrix games. The algorithm computational experience is reported for two and three players on randomly generated games for sizes up to 14 × 14 and 13 × 13 × 13.