Groupe d’études et de recherche en analyse des décisions

G-2012-24

Computing Perfect Nash Equilibria for Polymatrix Games

This paper sets two alternate denitions of Perfect Nash Equilibria for Polymatrix Games. We present two linear programming formulations to identify perfect extreme equilibria and enumerate all Selten Max- imal Subsets for polymatrix games. We report computational experiments on randomly generated Poly- matrix games with dierent size and density.

, 14 pages