pygambit.nash.SimpdivResult#
- class pygambit.nash.SimpdivResult(*, game: Game, rational: bool, use_strategic: bool, start: MixedStrategyProfileRational, maxregret: Rational, refine: int, leash: int | None, equilibrium: MixedStrategyProfileRational | None, success: bool)#
The result of simpdiv_solve.
- start#
The starting profile the algorithm was run from.
- Type:
MixedStrategyProfileRational
- maxregret#
The acceptance criterion for approximate Nash equilibrium which was used.
- Type:
Rational
- refine#
The rate at which the triangulation was refined at each iteration.
- Type:
int
- leash#
The maximum number of grid steps the method was allowed to explore, if specified.
- Type:
int, optional
- equilibrium#
The equilibrium found. Simplicial subdivision is guaranteed to converge, so this is never None unless leash caused the search to be cut short.
- Type:
MixedStrategyProfileRational, optional
- success#
False only if leash was reached before converging; True otherwise.
- Type:
bool
Methods
Attributes