#18536: Solvers for constant sum games
-------------------------------------+-------------------------------------
Reporter: ptigwe | Owner:
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-6.8
Component: game theory | Resolution:
Keywords: Game Theory, | Merged in:
Gambit, Zero-sum game Constant | Reviewers: Karl-Dieter Crisman
Sum Game, Normal Form Games | Work issues:
Authors: Tobenna P. Igwe | Commit:
Report Upstream: N/A | a24c7dd1ebd473b679fe070c173e7c824138e3d2
Branch: | Stopgaps:
u/ptigwe/gt_extension |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by kcrisman):
> OK. I was planning on opening a ticket, towards the end of GSOC, which
would address the documentation as a whole.
Sounds fair.
> Not sure if you are asking about using the LP for non-constant-sum games
or the general classification of finding a Nash in a general game. In case
if it was a bit of both:
> * LP's aren't guaranteed to find a Nash equilibrium in a two player
non-constant-sum game.
Very interesting!
--
Ticket URL: <http://trac.sagemath.org/ticket/18536#comment:18>
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.
