Computational Aspects of Nearly Single-Peaked Electorates.

Gábor Erdélyi Martin Lackner Andreas Pfandler

Published in: AAAI (2013)

Keyphrases

single peaked
computationally hard
np hard
social choice
closed form
optimal solution
reinforcement learning
probability density function
approximation algorithms