support_enumeration¶
Author: Daisuke Oyama
Compute all mixed Nash equilibria of a 2player (nondegenerate) normal form game by support enumeration.
References¶
B. von Stengel, “Equilibrium Computation for TwoPlayer Games in Strategic and Extensive Form,” Chapter 3, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani eds., Algorithmic Game Theory, 2007.

quantecon.game_theory.support_enumeration.
support_enumeration
(g)[source]¶ Compute mixedaction Nash equilibria with equal support size for a 2player normal form game by support enumeration. For a nondegenerate game input, these are all the Nash equilibria.
The algorithm checks all the equalsize support pairs; if the players have the same number n of actions, there are 2n choose n minus 1 such pairs. This should thus be used only for small games.
Parameters: g : NormalFormGame
NormalFormGame instance with 2 players.
Returns: list(tuple(ndarray(float, ndim=1)))
List containing tuples of Nash equilibrium mixed actions.