Gambit: Software Tools for Game Theory
<<< PreviousReference: Algorithms to Compute Nash EquilibriaNext >>>

EnumMixedSolve

EnumMixedSolve finds all Nash equilibria for a two person game. More precisely, it finds the set of extreme points of the components of the set of Nash equilibria. The procedure is to enumerate the set of complementary basic feasible solutions. See Mangasarian [Man64] for details.

Important

EnumMixedSolve only works for two-person normal form games.

<<< PreviousHomeNext >>>
Reference: Algorithms to Compute Nash EquilibriaUpEnumPureSolve