Gambit: Software Tools for Game Theory | ||
---|---|---|
<<< Previous | Next >>> |
LpSolve[support->NFSUPPORT, {precision->Float}, {nPivots<->0}, {time<->0.000000}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(MIXED) LpSolve[support->EFSUPPORT, {asNfg->False}, {precision->Float}, {nPivots<->0}, {time<->0.000000}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(BEHAV) L |
LpSolve solves a two-person, constant-sum game for a Nash equilibrium as a linear program. For extensive form games, the Koller-Megiddo-Stengel sequence form is used; games not of perfect recall return the empty list of solutions.
The behavior of the algorithm may be modified by the following optional parameters:
asNfg: By default, extensive forms are solved by the sequence form. By setting this parameter to True, each marked subgame of the extensive form is converted to its corresponding reduced normal form, solved as a linear program, and the mixed strategy solutions converted back into behavior profiles.
precision: Determines the precision of the computation. Default is floating point precision.
<<< Previous | Home | Next >>> |
Log | Up | Manual |