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 consider opinion diffusion in binary influence networks, where at each step one or more
agents update their opinions so as to be in agreement with the majority of their neighbors …

Election control considers the problem of an adversary who attempts to tamper with a voting
process, in order to either ensure that their favored candidate wins (constructive control) or …

We study the complexity of (approximate) winner determination under the Monroe and
Chamberlin–Courant multiwinner voting rules, which determine the set of representatives by …

Many electoral bribery, control, and manipulation problems (which we will refer to in general
as" manipulative actions" problems) are NP-hard in the general case. It has recently been …

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 …

Schulze's rule and ranked pairs are two Condorcet methods that both satisfy many natural
axiomatic properties. Schulze's rule is used in the elections of many organizations, including …

We focus on the following natural question: is it possible to influence the outcome of a voting
process through the strategic provision of information to voters who update their beliefs …

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 …