#18679: Deprecation of `maximization` within NormalFormGame
---------------------------+-----------------------------------
Reporter: ptigwe | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.8
Component: game theory | Keywords:
Merged in: | Authors: Tobenna P. Igwe
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
---------------------------+-----------------------------------
This ticket would be for the deprecation of the `maximization` parameter
within the `NormalFormGame` class which is used be various functions when
computing the Nash equilibrium. Some of the reasons include:
1. Finding a Nash with `maximization=False` is equivalent to solving an
instance with negative payoffs. So in the two player instance, one might
as well create an instance of (-A, -B) that way, creating the same
instances over and over when you want to compute equilibria using
different algorithms.
2. Technically, the game being represented isn't the game being solved. As
a result, any further manipulations or computations which would need to be
done on that instance, we would have to create the bimatrix (-A, -B)
again.
3. For n-players, this gets a little bit messier, as we would have to
enumerate the exponentially large number of payoffs in the game so as to
negate all of them.
--
Ticket URL: <http://trac.sagemath.org/ticket/18679>
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.
