Gambit: Software Tools for Game Theory | ||
---|---|---|
<<< Previous | Next >>> |
SimpDivSolve[support->NFSUPPORT, {stopAfter->1}, {nRestarts->1}, {leashLength->0}, {precision->Float}, {nEvals<->0}, {time<->0.000000}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(MIXED) SimpDivSolve[support->EFSUPPORT, {asNfg->False}, {stopAfter->1}, {nRestarts->1}, {leashLength->0}, {precision->Float}, {nEvals<->0}, {time<->0.000000}, {traceFile<->(Output)}, {traceLevel->0}] =: LIST(BEHAV) |
SimpDivSolve computes a Nash equilibrium for a game using a simplicial subdivision algorithm. The behavior of the algorithm may be modified by several optional parameters:
asNfg: By default, this is False. If it is specified to be True, the extensive form game is solved by recursively converting its marked subgames into normal form, solving, and reconstructing the solution as a behavior profile. Note that currently simplicial subdivision is only implemented on the normal form, so this parameter must always be specified and True.
stopAfter: Maximum number of equilibria to find. Default is 1.
precision: Determines the precision of the computation. Default is floating point precision.
nRestarts: Number of restarts. At each restart the mesh of the triangulation is halved.
leashLength: Sets the leash length. Default is 0, which results in no constraint, or no leash. Note that if this parameter is set to a value different from 0, the algorithm is no longer guaranteed to converge.
<<< Previous | Home | Next >>> |
Shell | Up | Sort |