Ted Turocy
Ted Turocy
## Overview The `TreeGameRep` class for extensive forms has built-in generation of the set of reduced normal form strategies. The implementation of this is some of the oldest code in...
The `Game.write` function documentation advertises that "efg" and "nfg" are valid options for the format; however, these are not implemented. For "efg" this is maybe not that interesting, but for...
The internal implementation of resolving information sets and players in `Game.reveal` is not correct - the fix to the last line of the function is trivial, but it does mean...
## Background Gambit has offered the `enumpoly_solve` method since the late 1990s. This is a somewhat misleadingly named method, as the implementation combines two operations which are in some sense...
# Overview Currently `pygambit` has a simple implementation of `__repr__` for `MixedStrategyProfile` and `MixedBehaviorProfile` (and the related classes that represent player or information set slices), which displays probabilities as a...
The graphical interface has long offered some generic methods for computing one, some, or all Nash equilibria, where available. Similarly, for many types of problem, `scipy` offers generic routines which...
This is an overarching roadmap item covering development of existing Nash equilibrium computation methods. Comments on this issue are the best place to express any views you might have on...
After commit 6c239f1 closing issue #295, we now have a clean way in C++ of passing random-number generation engines into the new functions that handle creating mixed profiles which are...
We are not yet testing these functions directly in `pygambit`: * `MixedStrategyProfile.player_regret` * `MixedStrategyProfile.max_regret` * `MixedBehaviorProfile.infoset_regret` * `MixedBehaviorProfile.max_regret` There are three kinds of tests that can and should be written:...
## Historical background The implementation of the linear complementarity solvers (using Lemke-Howson for strategic games and Lemke for extensive games) is some of the oldest Nash-finding code in Gambit. Developments...