How Hard Is It to Control an Election by Breaking Ties?

04/23/2013
by   Nicholas Mattei, et al.
0

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. Additionally, we show that the form of the tie-breaking function can increase the opportunities for control. Indeed, we prove that it can be NP-hard to control an election by breaking ties even with a two-stage voting rule.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

We prove that deciding whether the Runner can win this turn (mate-in-1) ...
research
05/27/2011

Complexity of and Algorithms for Borda Manipulation

We prove that it is NP-hard for a coalition of two manipulators to compu...
research
04/17/2012

Eliminating the Weakest Link: Making Manipulation Intractable?

Successive elimination of candidates is often a route to making manipula...
research
05/30/2022

Fair and Fast Tie-Breaking for Voting

We introduce a notion of fairest tie-breaking for voting w.r.t. two wide...
research
03/29/2023

Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules

We study the complexity of finding an approximate (pure) Bayesian Nash e...
research
09/28/2009

Breaking Generator Symmetry

Dealing with large numbers of symmetries is often problematic. One solut...
research
02/10/2021

All instantiations of the greedy algorithm for the shortest superstring problem are equivalent

In the Shortest Common Superstring problem (SCS), one needs to find the ...

Please sign up or login with your details

Forgot password? Click here to reset