Complexity of finding equilibria of plurality voting under structured preferences

We study the complexity of finding pure Nash equilibria in voting games over well-known restricted preference domains, such as the domains of single-peaked and single-crossing preferences. We focus on the Plurality rule, and, following the recent work of Elkind et al. [15], consider three popular ti...

Full description

Bibliographic Details
Main Authors: Elkind, E, Markakis, E, Obraztsova, S, Skowron, P
Format: Conference item
Language:English
Published: ACM 2016