Login / Signup

Computational Complexity of Hedonic Games on Sparse Graphs.

Tesshu HanakaHironori KiyaYasuhide MaeiHirotaka Ono
Published in: PRIMA (2019)
Keyphrases
  • computational complexity
  • np complete
  • coalition formation
  • hedonic games
  • special case
  • np hard
  • decision problems
  • conp complete
  • optimal solution
  • cooperative
  • utility function
  • additively separable