#18536: Solvers for constant sum games
-------------------------------------+-------------------------------------
Reporter: ptigwe | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.8
Component: game theory | Keywords: Game Theory,
Merged in: | Gambit, Zero-sum game Constant Sum
Reviewers: | Game, Normal Form Games
Work issues: | Authors: Tobenna P. Igwe
Commit: | Report Upstream: N/A
19500540d3a3ccc3556e42299bdc2de1a54618ca| Branch:
Stopgaps: | u/ptigwe/gt_extension
| Dependencies:
-------------------------------------+-------------------------------------
Constant-sum games are known to be solvable in polynomial time by using a
linear program. This patch includes a solver which constructs and solves
the LPs using the LP solvers within Sage (see
http://doc.sagemath.org/html/en/reference/numerical/sage/numerical/mip.html).
It also makes use of the solver within gambit for such games.
Finally, an additional function was included which helps to convert games
from the representation in sage to gambits representation ('_as_gambit')
--
Ticket URL: <http://trac.sagemath.org/ticket/18536>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
