Efficiently computing the Shapley value of connectivity games in low-treewidth graphs.
Tom C. van der ZandenHans L. BodlaenderHerbert J. M. HamersPublished in: Oper. Res. (2023)
Keyphrases
- efficiently computing
- game theory
- bounded treewidth
- coalitional games
- game theoretic
- solution concepts
- cooperative games
- cooperative game
- olap data cubes
- upper bound
- graph structure
- nash equilibrium
- search space
- constraint graph
- coalition formation
- np complete
- space complexity
- constraint propagation
- decision problems
- topological information
- boolean functions
- weighted graph
- graph theory
- directed graph
- graph connectivity
- educational games
- nash equilibria
- graph theoretic
- data structure
- conjunctive queries
- video games
- computer games
- high dimensional
- cooperative