Computational Aspects of Nearly Single-Peaked Electorates.

Gábor Erdélyi Martin Lackner Andreas Pfandler

Published in: J. Artif. Intell. Res. (2017)

Keyphrases

single peaked
computationally hard
np hard
fixed parameter tractability
objective function
approximation algorithms