Login / Signup

The complexity of manipulative attacks in nearly single-peaked electorates.

Piotr FaliszewskiEdith HemaspaandraLane A. Hemaspaandra
Published in: Artif. Intell. (2014)
Keyphrases
  • single peaked
  • computationally hard
  • np hard
  • fixed parameter tractability
  • computational complexity
  • cooperative
  • special case
  • np complete
  • social network analysis
  • decision problems
  • voting rules
  • social choice