The Tractability of the Shapley Value over Bounded Treewidth Matching Games.
Gianluigi GrecoFrancesco LupiaFrancesco ScarcelloPublished in: IJCAI (2017)
Keyphrases
- bounded treewidth
- np complete
- game theory
- game theoretic
- tractable cases
- monadic datalog
- solution concepts
- coalitional games
- decision problems
- tractable classes
- cooperative games
- cooperative game
- computational complexity
- highly parallelizable
- np hard
- nash equilibria
- coalition formation
- conjunctive queries
- relational learning
- nash equilibrium
- incomplete information
- domain knowledge
- weighted voting games
- reinforcement learning