English
Related papers

Related papers: Collecting, Classifying, Analyzing, and Using Real…

200 papers

The map of elections framework is a methodology for visualizing and analyzing election datasets. So far, the framework was restricted to elections that have equal numbers of candidates, equal numbers of voters, and where all the (ordinal)…

Computer Science and Game Theory · Computer Science 2026-01-27 Piotr Faliszewski , Jitka Mertlová , Pierre Nunn , Stanisław Szufa , Tomasz Wąs

Recently, Szufa et al. [AAMAS 2020] presented a "map of elections" that visualizes a set of 800 elections generated from various statistical cultures. While similar elections are grouped together on this map, there is no obvious…

Computer Science and Game Theory · Computer Science 2021-05-18 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Rolf Niedermeier , Stanisław Szufa

We give an overview of the diverse electoral systems used in local, national, or super-national elections around the world. We discuss existing methods for selecting single and multiple winners and give real-world examples for some more…

Economics · Quantitative Finance 2016-10-25 Siamak F. Shahandashti

We contribute the largest publicly available dataset of naturally occurring factual claims for the purpose of automatic claim verification. It is collected from 26 fact checking websites in English, paired with textual sources and rich…

Computation and Language · Computer Science 2019-10-22 Isabelle Augenstein , Christina Lioma , Dongsheng Wang , Lucas Chaves Lima , Casper Hansen , Christian Hansen , Jakob Grue Simonsen

Many democratic political parties hold primary elections, which nicely reflects their democratic nature and promote, among other things, the democratic value of inclusiveness. However, the methods currently used for holding such primary…

Multiagent Systems · Computer Science 2022-01-20 Ariel Rosenfeld , Ehud Shapiro , Nimrod Talmon

Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all…

Physics and Society · Physics 2013-01-25 Arnab Chatterjee , Marija Mitrović , Santo Fortunato

In this paper we present the ClaimBuster dataset of 23,533 statements extracted from all U.S. general election presidential debates and annotated by human coders. The ClaimBuster dataset can be leveraged in building computational methods to…

Computation and Language · Computer Science 2020-05-01 Fatma Arslan , Naeemul Hassan , Chengkai Li , Mark Tremayne

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Computer Science and Game Theory · Computer Science 2026-04-23 Itai Zilberstein , Ratip Emin Berker , George Li , Ruben Martins

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

Computer Science and Game Theory · Computer Science 2025-12-02 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang

From the perspective of social choice theory, ranked-choice voting (RCV) is known to have many flaws. RCV can fail to elect a Condorcet winner and is susceptible to monotonicity paradoxes and the spoiler effect, for example. We use a…

General Economics · Economics 2023-03-07 Adam Graham-Squire , David McCune

Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of…

Multiagent Systems · Computer Science 2024-07-17 Stanisław Szufa

We study in details the turnout rate statistics for 77 elections in 11 different countries. We show that the empirical results established in a previous paper for French elections appear to hold much more generally. We find in particular…

Physics and Society · Physics 2015-06-03 Christian Borghesi , Jean-Claude Raynal , Jean-Philippe Bouchaud

Elections for public offices in democratic nations are large-scale examples of collective decision-making. As a complex system with a multitude of interactions among agents, we can anticipate that universal macroscopic patterns could emerge…

Physics and Society · Physics 2025-01-14 Ritam Pal , Aanjaneya Kumar , M. S. Santhanam

Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. The study of tournaments is fundamental to ComSoc and many results have been…

Computer Science and Game Theory · Computer Science 2016-08-04 Nicholas Mattei , Toby Walsh

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of…

We describe several analytical results obtained in five candidates social choice elections under the assumption of the Impartial Anonymous Culture. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of…

Combinatorics · Mathematics 2023-08-21 Winfried Bruns , Bogdan Ichim

An election is a pair $(C,V)$ of candidates and voters. Each vote is a ranking (permutation) of the candidates. An election is $d$-Euclidean if there is an embedding of both candidates and voters into $\mathbb{R}^d$ such that voter $v$…

Computer Science and Game Theory · Computer Science 2025-02-12 Michal Dvořák , Dušan Knop , Jan Pokorný , Martin Slávik

We describe several experimental results obtained in four candidates social choice elections. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality voting with runoff. The computations are done by…

Combinatorics · Mathematics 2017-04-18 Winfried Bruns , Bogdan Ichim , Christof Söger
‹ Prev 1 2 3 10 Next ›