In a typical social choice scenario, agents rank the available alternatives and have to
collectively decide on the best alternative, or a ranking of the alternatives. If there are just …

Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

A survey of papers on practically significant restrictions on the preference profile of a
collective is carried out, including single-peaked preferences, group-separable preferences …

Many hard computational social choice problems are known to become tractable when
voters' preferences belong to a restricted domain, such as those of single-peaked or single …

In decision-making methods, it is common to assume that the experts are honest and
professional. However, this is not the case when one or more experts in the pairwise-based …

We introduce the domain of preferences that are single-peaked on a circle, which is a
generalization of the well-studied single-peaked domain. This preference restriction is …

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 …

Euclidean preferences are a widely studied preference model, in which decision makers
and alternatives are embedded in d-dimensional Euclidean space. Decision makers prefer …

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 present a collection of 7582 real-world elections divided into 25 datasets from various
sources ranging from sports competitions over music charts to survey-and indicator-based …