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 …

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

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

We investigate the computational complexity of electoral control in elections. Electoral
control describes the scenario where the election chair seeks to alter the outcome of the …

Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …

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 …

Manipulation, bribery, and control are well-studied ways of changing the outcome of an
election. Many voting systems are, in the general case, computationally resistant to some of …