-
Notifications
You must be signed in to change notification settings - Fork 0
Open
Description
I've been studying around for different concepts of stable sets since it seems like bargaining sets by themselves seem computationally infeasible, even just to check if a point is contained within the set.
Here is the site that I found that covers a lot of cooperative game theory: https://www.lamsade.dauphine.fr/~airiau/Teaching/CoopGames/2012/.
We could look at:
- eps-core which would be easy to implement and could be part of a mechanism.
- kernel, which seems to be easy to check if a point is contained within it
- nucleolus, which is a single point that can be computed but the algorithm to do so is not trivial at all
If we also consider a convex game, then we already know that the Shapley is in the core and there seems to be a unique stable set that is also just the core.
Metadata
Metadata
Assignees
Labels
No labels