LcpSolve

Name

LcpSolve -- Computes Nash equilibria via linear complementarity program

Synopsis

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) 

Description

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:

See also

LpSolve.