Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates

  title={Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates},
  author={Felix Brandt and Markus Brill and Edith Hemaspaandra and Lane A. Hemaspaandra},
  journal={J. Artif. Intell. Res.},
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. This paper shows that for voters who follow the most central political-science model of electorates— single-peaked preferences—those hardness protections vanish. By using single-peaked preferences to simplify combinatorial covering challenges, we for the first time show that NPhard bribery problems—including those for Kemeny and… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 71 extracted citations


Publications referenced by this paper.
Showing 1-10 of 68 references

Essai sur l’Application de L’Analyse à la Probabilité des Décisions Rendues à la Pluralité des Voix

  • J. Condorcet
  • Facsimile reprint of original published in Paris…
  • 1785
Highly Influential
7 Excerpts

Pivotal Politics: A Theory of U.S. Lawmaking

  • K. Krehbiel
  • 1998
Highly Influential
5 Excerpts

Voting cycles and the structure of individual preferences

  • R. Niemi, J. Wright
  • Social Choice and Welfare,
  • 1987
Highly Influential
4 Excerpts

Condorcet social choice functions

  • P. Fishburn
  • SIAM Journal on Applied Mathematics, 33 (3), 469…
  • 1977
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…