LpSolve

Name

LpSolve -- Computes Nash equilibria using linear programming

Synopsis

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

Description

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:

See also

LcpSolve.