Nash Stability in Additively Separable Hedonic Games Is NP-Hard.
Martin OlsenPublished in: CiE (2007)
Keyphrases
- hedonic games
- additively separable
- social welfare
- np hard
- envy free
- coalition structures
- utility function
- pareto optimal
- special case
- resource allocation
- coalition formation
- optimal solution
- lower bound
- approximation algorithms
- branch and bound algorithm
- combinatorial auctions
- computational complexity
- knapsack problem
- nash equilibrium
- np complete
- multi agent
- game theory
- multi objective
- cooperative games
- multiagent systems
- cooperative game theory
- cooperative