1,208 research outputs found
Approximation and Hardness of Shift-Bribery
In the Shift-Bribery problem we are given an election, a preferred candidate,
and the costs of shifting this preferred candidate up the voters' preference
orders. The goal is to find such a set of shifts that ensures that the
preferred candidate wins the election. We give the first polynomial-time
approximation scheme for the Shift-Bribery problem for the case of positional
scoring rules, and for the Copeland rule we show strong inapproximability
results.Comment: An extended abstract of this work appears in AAAI'1
Broadening the Complexity-theoretic Analysis of Manipulative Attacks in Group Identification
In the Group Identification problem, we are given a set of individuals and
are asked to identify a socially qualified subset among them. Each individual
in the set has an opinion about who should be considered socially qualified.
There are several different rules that can be used to determine the socially
qualified subset based on these mutual opinions. In a manipulative attack, an
outsider attempts to exploit the way the used rule works, with the goal of
changing the outcome of the selection process to their liking.
In recent years, the complexity of group control and bribery based
manipulative attacks in Group Identification has been the subject of intense
research. However, the picture is far from complete, and there remain many open
questions related to what exactly makes certain problems hard, or certain rules
immune to some attacks.
Supplementing previous results, we examine the complexity of group
microbribery on so-called protective problem instances; that is, instances
where all individuals from the constructive target set are already socially
qualified initially. In addition, we study a relaxed variant of group control
by deleting individuals for the consent rules, the consensus-start-respecting
rule, and the liberal-start-respecting rule. Based on existing literature, we
also formalize three new social rules of the iterative consensus type, and we
provide a comprehensive complexity-theoretic analysis of group control and
bribery problems for these rules.Comment: 93 pages, 8 figures, 3 table
Schulze and Ranked-Pairs Voting are Fixed-Parameter Tractable to Bribe, Manipulate, and Control
Schulze and ranked-pairs elections have received much attention recently, and
the former has quickly become a quite widely used election system. For many
cases these systems have been proven resistant to bribery, control, or
manipulation, with ranked pairs being particularly praised for being NP-hard
for all three of those. Nonetheless, the present paper shows that with respect
to the number of candidates, Schulze and ranked-pairs elections are
fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform,
polynomial-time algorithms whose degree does not depend on the number of
candidates. We also provide such algorithms for some weighted variants of these
problems
- …