Login / Signup

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.

Felix BrandtMarkus BrillEdith HemaspaandraLane A. Hemaspaandra
Published in: J. Artif. Intell. Res. (2015)
Keyphrases
  • single peaked
  • computationally hard
  • fixed parameter tractability
  • np hard
  • computational complexity
  • search space
  • worst case