Gambit: Software Tools for Game Theory | ||
---|---|---|
<<< Previous | Reference: Algorithms to Compute Nash Equilibria | Next >>> |
This algorithm formulates and solves the game as a linear program, and finds the minimax solution of the game. This algorithm only works for two person, zero sum games. This algorithm only finds one Nash equilibrium. However, For a constant sum game, any other equilibria will have the same value. There are no algorithm specific parameters.
<<< Previous | Home | Next >>> |
LiapSolve | Up | PolEnumSolve |