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

When selecting a subset of candidates (a so-called committee) based on the preferences of
voters, proportional representation is often a major desideratum. When going beyond …

The Mallows model is a popular distribution for ranked data. We empirically and theoretically
analyze how the properties of rankings sampled from the Mallows model change when …

Group decision making is an important, long‐standing, and ubiquitous problem in all
societies, where collective decisions must be made by a group of agents despite individual …

To aggregate rankings into a social ranking, one can use scoring systems such as Plurality,
Veto, and Borda. We distinguish three types of methods: ranking by score, ranking by …

We study the multifaceted question of how to sample approval elections in a meaningful
way. Our analysis aims to discern the properties of various statistical cultures (both …

Motivated by putting empirical work based on (synthetic) election data on a more solid
mathematical basis, we analyze six distances among elections, including, eg, the …

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 consider the notions of agreement, diversity, and polarization in ordinal elections (that is,
in elections where voters rank the candidates). While (computational) social choice offers …

Contributing to the toolbox for interpreting election results, we evaluate the robustness of
election winners to random noise. We compare the robustness of different voting rules and …