English
Related papers

Related papers: The River Method

200 papers

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

Condorcet's jury theorem states that the correct outcome is reached in direct majority voting systems with sufficiently large electorates as long as each voter's independent probability of voting for that outcome is greater than 0.5. Yet,…

Combinatorics · Mathematics 2023-01-10 Lucas Böttcher , Georgia Kernell

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct…

Machine Learning · Computer Science 2020-02-17 Hanan Shteingart , Eran Marom , Igor Itkin , Gil Shabat , Michael Kolomenkin , Moshe Salhov , Liran Katzir

The major finding, of this article, is an ensemble method, but more exactly, a novel, better ranked voting system (and other variations of it), that aims to solve the problem of finding the best candidate to represent the voters. We have…

Artificial Intelligence · Computer Science 2021-10-15 Gabriel-Claudiu Grama

Designing private voting rules is an important and pressing problem for trustworthy democracy. In this paper, under the framework of differential privacy, we propose a novel famliy of randomized voting rules based on the well-known…

Computer Science and Game Theory · Computer Science 2024-10-16 Zhechen Li , Ao Liu , Lirong Xia , Yongzhi Cao , Hanpin Wang

In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made…

Artificial Intelligence · Computer Science 2013-03-05 Umberto Grandi , Andrea Loreggia , Francesca Rossi , Kristen Brent Venable , Toby Walsh

Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set, assuming that the number of voters is odd, and alternatives…

Discrete Mathematics · Computer Science 2025-09-26 Bei Zhou , Klas Markström

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

Majority voting is considered an effective method to enhance chain-of-thought reasoning, as it selects the answer with the highest "self-consistency" among different reasoning paths (Wang et al., 2023). However, previous chain-of-thought…

Computation and Language · Computer Science 2025-05-19 Weiqin Wang , Yile Wang , Hui Huang

Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the…

Artificial Intelligence · Computer Science 2016-08-10 Arne Recknagel , Tarek R. Besold

The budget is the key means for effecting policy in democracies, yet its preparation is typically an excluding, opaque, and arcane process. We aim to rectify this by providing for the democratic creation of complete budgets --- for…

Computer Science and Game Theory · Computer Science 2018-06-21 Ehud Shapiro , Nimrod Talmon

This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…

Logic in Computer Science · Computer Science 2026-04-08 Raúl Gutiérrez , Salvador Lucas , Miguel Vítores

By relaxing the dominating set in three ways (e.g., from "each member beats every non-member" to "each member beats or ties every non-member, with an additional requirement that at least one member beat every non-member"), we propose a new…

Theoretical Economics · Economics 2024-03-26 Fujun Hou

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

Computer Science and Game Theory · Computer Science 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…

Data Structures and Algorithms · Computer Science 2016-11-02 Colin Cooper , Robert Elsässer , Tomasz Radzik

We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…

Computer Science and Game Theory · Computer Science 2017-07-28 Dominik Peters

We revisit Tree-Ring Watermarking, a recent diffusion model watermarking method that demonstrates great robustness to various attacks. We conduct an in-depth study on it and reveal that the distribution shift unintentionally introduced by…

Computer Vision and Pattern Recognition · Computer Science 2024-07-19 Hai Ci , Pei Yang , Yiren Song , Mike Zheng Shou

A Condorcet voting scheme chooses a winning candidate as one who defeats all others in pairwise majority rule. We provide a review which includes the rigorous mathematical treatment for calculating the limiting probability of a Condorcet…

Statistics Theory · Mathematics 2007-06-13 M. S. Krishnamoorthy , M. Raghavachari

Liquid democracy is the principle of making collective decisions by letting agents transitively delegate their votes. Despite its significant appeal, it has become apparent that a weakness of liquid democracy is that a small subset of…

Computer Science and Game Theory · Computer Science 2019-11-20 Paul Gölz , Anson Kahng , Simon Mackenzie , Ariel D. Procaccia