Nowadays, Artificial Intelligence (AI) has become a top priority on the agenda of different
nations around the world. AI may lead to transformative applications within a wide range of …

The area of computational social choice (COMSOC) analyzes collective decision problems
from an algorithmic perspective. So far, the main focus in this area lied on analyzing …

Social influence occurs when one's opinions, emotions, or behaviors are affected by others
in a social network. However, social influence takes many forms, and its underlying …

In social networks, how to establish an effective recommendation model is an important
research topic. This paper proposes a trust-based probabilistic recommendation model for …

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 …

In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

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 investigate the problem of deciding whether a given preference profile is close to having
a certain nice structure, as for instance single-peaked, single-caved, single-crossing, value …

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 thoroughly study a generalized version of the famous Stable Marriage problem, now
based on multi-modal preference lists. The central twist herein is to allow each agent to rank …