1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery
problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is …

We study the computational complexity of candidate control in elections with few voters, that
is, we consider the parameterized complexity of candidate control in elections with respect to …

Challenge the champ tournaments are one of the simplest forms of competition, where a
(initially selected) champ is repeatedly challenged by other players. If a player beats the …

Abstract In the Shift Bribery problem, we are given an election, a preferred candidate p, and
a budget. The goal is to ensure p's victory by shifting p higher in some voters' preference …

We study the (parameterized) complexity of Shift Bribery for multiwinner voting rules. We
focus on the SNTV, Bloc, k-Borda, and Chamberlin-Courant rules, as well as on approximate …

Abstract “Control” studies attempts to set the outcome of elections through the addition,
deletion, or partition of voters or candidates. The set of benchmark control types was largely …

We study the complexity of Destructive Shift Bribery. In this problem, we are given an
election with a set of candidates and a set of voters (each ranking the candidates from the …

Computing the margin of victory (MOV) in an Instant Runoff Voting (IRV) election is NP-hard.
In an IRV election with winning candidate w, the MOV defines the smallest number of cast …

The integrity of democratic elections depends on voters' access to accurate information.
However, modern media environments, which are dominated by social media, provide …