We analyze how numerical experiments regarding elections were conducted within the
computational social choice literature (focusing on papers published in the IJCAI, AAAI, and …

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 …

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 initiate the study of external manipulations in Stable Marriage by considering several
manipulative actions as well as several manipulation goals. For instance, one goal is to …

We study the robustness of approval-based participatory budgeting (PB) rules to random
noise in the votes. First, we analyze the computational complexity of the# Flip-Bribery …

We use the" map of elections" approach of Szufa et al.(AAMAS 2020) to analyze several well-
known vote distributions. For each of them, we give an explicit formula or an efficient …

When dealing with real-world election data and preferences, it is often realistic to assume
that the given data are incomplete or noisy. The reasons for such deficiencies are manifold …

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 …

Tournament solutions are frequently used to select winners from a set of alternatives based
on pairwise comparisons between them. Prior work has shown that several common …

Given a set of agents qualifying or disqualifying each other, group identification is the task of
identifying a socially qualified subgroup of agents. Social qualification depends on the …