Gambit: Software Tools for Game Theory | ||
---|---|---|
<<< Previous | Next >>> |
LcpSolve[support->NFSUPPORT, {stopAfter->1}, {precision->Float}, {nPivots<->0}, {time<->0}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(MIXED) LcpSolve[support->EFSUPPORT, {asNfg->False}, {stopAfter->1}, {precision->Float}, {nPivots<->0}, {time<->0.000000}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(BEHAV) |
LcpSolve solves a game as a linear complementarity problem, using the Lemke-Howson algorithm for normal form games, and the Koller-Megiddo-Stengel sequence form for extensive form games.
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 via Lemke-Howson, and the mixed strategy solutions converted back into behavior profiles.
stopAfter: Specifies the maximum number of equilibria to find. The default is one. If set to zero then all equilibria reachable by the algorithm will be found.
precision Determines the precision of the computation. Default is floating point precision.
<<< Previous | Home | Next >>> |
IsWatchRunning | Up | Length |