#16332: Game Theory: Build capacity to calculate Shapley value of cooperative
games.
-------------------------------------+-------------------------------------
Reporter: vinceknight | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.3
Component: PLEASE CHANGE | Resolution:
Keywords: Game Theory, | Merged in:
Cooperative Games | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | 9fccb6f7ebda4ef6344d125bcdd9a6b67dfb2deb
u/jcampbell/game_theory__build_capacity_to_calculate_shapley_value_of_cooperative_games_|
Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by vinceknight):
> > On an unrelated note, I'm wondering whether there happens to be any
faster algorithms for calculating things - there is probably a literature
of computational complexity and game theory, like there is in voting.
Some of these combinatorial things (e.g. for coalitions) get really nasty
really quickly.
>
> To the best of my knowledge there isn't. There are various approximation
algorithms that exist that could be coded in to here in the future
perhaps?
I have updated my knowledge and we've just implemented a much better
calculation that is more or less (to the best of my knowledge) as fast as
one can go without taking advantage of particular structures of a
particular case.: http://www.math.ucla.edu/~tom/Game_Theory/coal.pdf
James is reviewing my changes and will push to trac.
--
Ticket URL: <http://trac.sagemath.org/ticket/16332#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.
