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

Piotr Faliszewski Edith Hemaspaandra Lane A. Hemaspaandra

Published in: TARK (2011)

Keyphrases

single peaked
computationally hard
fixed parameter tractability
np hard
computational complexity
decision problems
space complexity
social choice