gambit-lp

Name

gambit-lp -- Computes Nash equilibria in a two-player constant-sum game by solving a linear program

Synopsis

gambit-efg-lp [-d DECIMALS] [-S] [-h] [-q]

DESCRIPTION

gambit-lp reads a two-player constant-sum game on standard input and computes a Nash equilibrium by solving a linear program. The program uses the sequence form formulation of Koller, Megiddo, and von Stengel for extensive games.

OPTIONS

-d DECIMALS

By default, this program computes using exact rational arithmetic. Since the extreme points computed by this method are guaranteed to be rational when the payoffs in the game are rational, this permits exact computation of an equilibrium. Computation using rational arithmetic is in general slow, however. For most games, acceptable results can be obtained by computing using the computer's native floating-point arithmetic. Using this flag enables computation in floating-point, and expresses all output using decimal representations with DECIMALS digits.

-S

By default, the program uses behavior strategies for extensive games; this switch instructs the program to use reduced strategic game strategies for extensive games. (This has no effect for strategic games, since a strategic game is its own reduced strategic game.)

-h

Prints a help message listing the available options.

-q

Suppresses printing of the banner at program launch.

USAGE

gambit-lp [OPTIONS] < file.[en]fg

BUGS

While the set of equilibria in a two-player constant-sum strategic game is convex, this method will only identify one of the extreme points of that set.

AUTHOR

Theodore Turocy