#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 vinceknight):
Hi both,
Apologies for my silence (on organisation committee of a conference that
has been running this week so have been pretty busy). Apologies also if as
a result my comments below don't make full sense (in case I missed
something).
Replying to [comment:13 kcrisman]:
> I cannot figure out how to get the changes in the doc built, it's
maddening. I'll have to assume it's okay and I didn't miss anything.
>
> The following could be improved, it really looks pretty meager. Not
necessarily for this ticket, as definitely pre-existing - Vince, I'll
blame you for this :)
> {{{
> class NormalFormGame(SageObject, MutableMapping):
> r"""
> An object representing a Normal Form Game. Primarily used to compute
the
> Nash Equilibria.
>
> INPUT:
>
> - ``generator`` - Can be a list of 2 matrices, a single matrix or
left
> blank.
>
> """
> }}}
> It should at least tell how to get to more documentation from there.
>
This is certainly due to me, it happened as a result of moving the
documentation that was there to the front matter, I think I perhaps did
not fully understand :) Perhaps a ticket could be opened about the
documentation (as Tobenna suggested towards the end of gsoc) that fully
describes what we want the docs to look like :)
Replying to [comment:17 ptigwe]:
> > I think it's worth pointing out somewhere in the documentation that
the LP approach will give ''one'' NE but not ''all'' of them, should there
be more than one. (Constant-sum games can have more than one NE, right?
I guess the trivial game is an example.)
> OK.
I think it could be worth doctesting also? (So showing that all equilibria
are find by some algorithms and not by LP etc...)
Great work on this Tobenna, really looking solid and thanks to Karl for
reviewing (as always this is greatly appreciated).
--
Ticket URL: <http://trac.sagemath.org/ticket/18536#comment:19>
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.
