pygambit.nash.simpdiv_solve#

pygambit.nash.simpdiv_solve(game: Game, refine: int = 2, leash: int | None = None, external: bool = False) → List[MixedStrategyProfile]#

Compute Nash equilibria of a game using simplicial subdivision.

Parameters:

game (Game) – The game to compute equilibria in.
refine (int, default 2) – This controls the rate at which the triangulation of the space of mixed strategy profiles is made more fine at each iteration.
leash (int, optional) – Simplicial subdivision is guaranteed to converge to an (approximate) Nash equilibrium. The method may take arbitrarily long paths through the space of mixed strategies in doing so. If specified, leash sets a maximum number of grid steps the method may explore. This trades off the possibility of finding an equilibrium more quickly by giving up the guarantee than an equilibrium will necessarily be found.
external (bool, default False) – Call the external command-line solver instead of the internally-linked implementation. Requires the command-line solvers to be installed somewhere accessible in the system path.

Returns:

The list of mixed strategy profiles computed.

Return type:

List of mixed strategy profiles