Login / Signup

Manipulation of k-Approval in Nearly Single-Peaked Electorates.

Gábor ErdélyiMartin LacknerAndreas Pfandler
Published in: ADT (2015)
Keyphrases
  • single peaked
  • computationally hard
  • voting rules
  • np hard
  • fixed parameter tractability
  • social choice
  • lower bound