Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …

We study the parameterized complexity of counting variants of Swap-and Shift-Bribery,
focusing on the parameterizations by the number of swaps and the number of voters. Facing …

We study the effects of campaigning, where the society is partitioned into voter clusters and
a diffusion process propagates opinions in a network connecting the clusters. Our model can …

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 …

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

We study the problem of bribery in multiwinner elections, for the case where the voters cast
approval ballots (ie, sets of candidates they approve) and the bribery actions are limited to …

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 …

We investigate how robust are results of committee elections to small changes in the input
preference orders, depending on the voting rules used. We find that for typical rules 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 …