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 …

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 …

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 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 …

We present an almost optimal algorithm for the classic Chamberlin-Courant multiwinner
voting rule (CC) on single-peaked preference profiles. Given $ n $ voters and $ m …

Social choice theory is the field of scientific inquiry that studies the aggregation of individual
preferences toward a collective choice. For example, social choice theorists—who hail from …

Restricted domains over voter preferences have been extensively studied within the area of
computational social choice, initially for preferences that are total orders over the set of …

This paper contains an extensive combinatorial analysis of the single-peaked domain
restriction and investigates the likelihood that an election is single-peaked. We provide a …