Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control

  • Authors:

  • Gábor Erdélyi;Markus Nowak;Jörg Rothe

  • Affiliations:

  • Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany 40225;Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany 40225;Institut für Informatik, Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany 40225

  • Venue:
  • MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study sincere-strategy preference-based approval voting (SP-AV), a system proposed by Brams and Sanver [8], with respect to procedural control. In such control scenarios, an external agent seeks to change the outcome of an election via actions such as adding/deleting/partitioning either candidates or voters. SP-AV combines the voters' preference rankings with their approvals of candidates, and we adapt it here so as to keep its useful features with respect to approval strategies even in the presence of control actions. We prove that this system is computationally resistant (i.e., the corresponding control problems are np-hard) to at least 16 out of 20 types of constructive and destructive control. Thus, for the 20 control types studied here, SP-AV has more resistances to control, by at least two, than is currently known for any other natural voting system with a polynomial-time winner problem.