• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Kernelization complexity of possible winner and coalitional manipulation problems in voting.

Palash DeyNeeldhara MisraY. Narahari
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • solving problems
  • social choice
  • real time
  • decision problems
  • benchmark problems
  • computationally feasible
  • machine learning
  • worst case
  • space complexity
  • voting rules
  • np hardness
  • voting schemes
  • tractable cases