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 analyze how numerical experiments regarding elections were conducted within the
computational social choice literature (focusing on papers published in the IJCAI, AAAI, and …

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 …

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 provide the first large-scale data collection of real-world approval-based committee
elections. These elections have been conducted on the Polkadot blockchain as part of their …

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 …

We study the properties of elections that have a given position matrix (in such elections each
candidate is ranked on each position by a number of voters specified in the matrix). We …

We consider elections where the set of candidates is split into parties and each party can
nominate just one candidate. We study the computational complexity of two problems. The …

For the problem of aggregating several rankings into one ranking, Kemeny (1959) proposed
two methods: the median rule which selects the ranking with the smallest total swap distance …

We study the parameterized complexity of winner determination problems for three prevalent
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …