Login / Signup

The Complexity of Fully Proportional Representation for Single-Crossing Electorates.

Piotr SkowronLan YuPiotr FaliszewskiEdith Elkind
Published in: SAGT (2013)
Keyphrases
  • single peaked
  • computational complexity
  • worst case
  • markov random field
  • boolean functions