Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs.
Tom C. van der ZandenHans L. BodlaenderHerbert J. M. HamersPublished in: CoRR (2022)
Keyphrases
- efficiently computing
- game theory
- coalitional games
- bounded treewidth
- game theoretic
- solution concepts
- cooperative games
- cooperative game
- olap data cubes
- upper bound
- decision problems
- boolean functions
- nash equilibria
- graph structure
- search space
- graph theoretic
- cooperative
- nash equilibrium
- topological information
- graph matching
- game playing
- tree decompositions
- weighted voting games
- np complete
- graph theory
- game play
- space complexity
- von neumann
- directed graph
- social welfare
- resource allocation
- constraint graph
- data model
- coalition formation