A parametric representation of totally mixed Nash equilibria

We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representation, we also show an algorithm to compute polynomial inequality conditions under which a game has the maximum possible number of this kind of equilibria. Then, we present symbolic procedures to describe the set of isolated totally mixed Nash equilibria of an arbitrary game and to compute, under certain general assumptions, the exact number of these equilibria. The complexity of all these algorithms is polynomial in the number of players, the number of each playerʹs strategies and the generic number of totally mixed Nash equilibria of a game with the considered structure.