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 …

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 …

Borda Count is one of the earliest and most important voting rules and has been central to
many applications in artificial intelligence. We study the problem of control in Borda …

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 …

In many practical scenarios, a population is divided into disjoint groups for better
administration, eg, electorates into political districts, employees into departments, students …

Bribery in an election is one of the well-studied control problems in computational social
choice. In this paper, we propose and study the safe bribery problem. Here the goal of the …

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 …

The problem of aggregating the preferences of different agents (or voters) occurs in diverse
situations and plays a fundamental role in artificial intelligence and social choice [5, 25] …