G-2003-63
Enumeration of All Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games
Charles Audet, Slim Belhaiza et Pierre Hansen
Bimatrix and polymatrix games are expressed as parametric linear 0-1 programs. This leads to an algorithm for complete enumeration of their extreme equilibria (which is the first one proposed for the polymatrix game case). 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).
Paru en octobre 2003 , 25 pages