How hard is it to control an election by breaking ties?

  title={How hard is it to control an election by breaking ties?},
  author={Nicholas Mattei and Nina Narodytska and Toby Walsh},
We study the computational complexity of controlling the result of an election by breaking ties strategically. This problem is equivalent to the problem of deciding the winner of an election under parallel universes tie-breaking. When the chair of the election is only asked to break ties to choose between one of the co-winners, the problem is trivially easy. However, in multi-round elections, we prove that it can be NP-hard for the chair to compute how to break ties to ensure a given result… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


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

Preference functions that score rankings and maximum likelihood estimation

  • V. Conitzer, M. Rognlie, L. Xia
  • Proc. IJCAI 2009, pp. 109–115,
  • 2009
Highly Influential
8 Excerpts

Preflib: A library of preference data

  • N. Mattei, T. Walsh
  • Proc. ADT 2013, pp. 259–270,
  • 2013
1 Excerpt

Similar Papers

Loading similar papers…