Most solution concepts in collective decision making are defined assuming complete
knowledge of individuals' preferences and of the mechanism used for aggregating them …

The presence of big data, online systems, collaborations of remote agents, distributed
knowledge, social media interaction, and generally, digital globalization, changes the way …

Bribery in elections is an important problem in computational social choice theory. We
introduce and study two important special cases of the classical $ Bribery problem, namely …

This article deals with strategic voting under incomplete information. We propose a
descriptive model, inspired by political elections, where the information about the vote …

ABSTRACT The Possible Winner (PW) problem, a fundamental algorithmic problem in
computational social choice, concerns elections where voters express only partial …

Gerrymandering is a practice of manipulating district boundaries and locations in order to
achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein …

Understanding when and how computational complexity can be used to protect elections
against different manipulative actions has been a highly active research area over the past …

We study strategic voting problems for majority judgment, in which each voter assigns to
every candidate a grade and the winners are determined by their majority-grades. We first …

We study the parameterized complexity of the Optimal Defense and Optimal Attack problems
in voting. In both the problems, the input is a set of voter groups (every voter group is a …

Many research works in computational social choice assume a fixed set of voters in an
election and study the resistance of different voting rules against electoral manipulation. In …