Alongside theoretical research, experimental studies lie in the very heart of computational
social choice [9]. The computational aspects of elections, such as the problems of winner …

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 …

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 develop a framework that leverages the smoothed complexity analysis by Spielman and
Teng to circumvent paradoxes and impossibility theorems in social choice, motivated by …

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 …

The goal of this paper is to propose a comparison of four multi-winner voting rules, k-
Plurality, k-Negative Plurality, k-Borda, and Bloc. These four election methods are …

We describe several analytical results obtained in four candidates social choice elections
under the assumption of the Impartial Anonymous Culture. These include the Condorcet and …

Results from voting theory are increasingly used when dealing with collective decision
making in computational multiagent systems. An important and surprising phenomenon in …

Research in both computational social choice and preference reasoning uses tools and
techniques from computer science, generally algorithms and complexity analysis, to …

The main purpose of this paper is to compute the theoretical likelihood of some electoral
outcomes under the impartial anonymous culture in four-candidate elections by using the …