English
Related papers

Related papers: An Evaluation of Borda Count Variations Using Rank…

200 papers

In this note we study randomized voting trees, previously introduced by Fisher, Procaccia and Samorodnitsky. They speculate that a non-trivial performance guarantee may be achievable using randomized, balanced trees whose height is…

Combinatorics · Mathematics 2019-05-09 Jason Long , Adam Zsolt Wagner

Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections. While they provide rigorous guarantees of correctness, widespread adoption has been impeded by both efficiency concerns and the fact they offer…

Cryptography and Security · Computer Science 2024-06-19 Benjamin Fuller , Rashmi Pai , Alexander Russell

It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…

Numerical Analysis · Mathematics 2021-03-30 Regina S. Burachik , Bethany I. Caldwell , C. Yalçın Kaya

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris

Quality assurance remains a key topic in human computation research. Prior work indicates that majority voting is effective for low difficulty tasks, but has limitations for harder tasks. This paper explores two methods of addressing this…

Social and Information Networks · Computer Science 2012-04-17 Yu-An Sun , Christopher Dance

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

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 Nominated Proof-of-Stake mechanism and contain around one…

Computer Science and Game Theory · Computer Science 2023-12-20 Niclas Boehmer , Markus Brill , Alfonso Cevallos , Jonas Gehrlein , Luis Sánchez-Fernández , Ulrike Schmidt-Kraepelin

Colorado conducted risk-limiting tabulation audits (RLAs) across the state in 2017, including both ballot-level comparison audits and ballot-polling audits. Those audits only covered contests restricted to a single county; methods to…

Applications · Statistics 2018-03-05 Mark Lindeman , Neal McBurnett , Kellie Ottoboni , Philip B. Stark

This paper provides a serious attempt towards constructing a switching-algebraic theory for weighted monotone voting systems, whether they are scalar-weighted or vector-weighted. The paper concentrates on the computation of a prominent…

Computer Science and Game Theory · Computer Science 2023-04-18 Ali Muhammad Rushdi , Muhammad Ali Rushdi

We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require…

Cryptography and Security · Computer Science 2008-06-12 Anne Broadbent , Alain Tapp

Liquid democracy with ranked delegations is a novel voting scheme that unites the practicability of representative democracy with the idealistic appeal of direct democracy: Every voter decides between casting their vote on a question at…

Computer Science and Game Theory · Computer Science 2024-03-07 Markus Utke , Ulrike Schmidt-Kraepelin

Risk-limiting audits (RLAs) are expected to strengthen the public confidence in the correctness of an election outcome. We hypothesize that this is not always the case, in part because for large margins between the winner and the runner-up,…

Computers and Society · Computer Science 2021-09-17 Asmita Dalela , Oksana Kulyk , Carsten Schürmann

Risk-limiting audits (RLAs) are rigorous statistical procedures meant to detect invalid election results. RLAs examine paper ballots cast during the election to statistically assess the possibility of a disagreement between the winner…

Cryptography and Security · Computer Science 2022-12-23 Benjamin Fuller , Abigail Harrison , Alexander Russell

Accounting for undecided and uncertain voters is a challenging issue for predicting election results from public opinion polls. Undecided voters typify the uncertainty of swing voters in polls but are often ignored or allocated to each…

Applications · Statistics 2019-01-18 Joshua J Bon , Timothy Ballard , Bernard Baffour

We study the ability of different classes of voting rules to induce agents to report their preferences truthfully, if agents want to avoid regret. First, we show that regret-free truth-telling is equivalent to strategy-proofness among…

Theoretical Economics · Economics 2025-03-21 R. Pablo Arribillaga , Agustin G. Bonifacio , Marcelo Ariel Fernandez

This study explores the relationship between voter trust and their experiences during elections by applying a rule-based data mining technique to the 2022 Survey of the Performance of American Elections (SPAE). Using the Apriori algorithm…

Computers and Society · Computer Science 2025-07-22 Md Al Jubair , Mohammad Shamsul Arefin , Ahmed Wasif Reza

The voter model with multiple states has found applications in areas as diverse as population genetics, opinion formation, species competition and language dynamics, among others. In a single step of the dynamics, an individual chosen at…

Physics and Society · Physics 2019-10-09 Federico Vazquez , Ernesto S. Loscar , Gabriel Baglietto

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

The Borda voting rule is a positional scoring rule for $z$ candidates such that in each vote, the first candidate receives $z-1$ points, the second $z-2$ points and so on. The winner in the Borda rule is the candidate with highest total…

Computer Science and Game Theory · Computer Science 2020-10-08 Yiheng Shen , Pingzhong Tang , Yuan Deng

Cooperation in the form of vote trading, also known as logrolling, is central for law-making processes, shaping the development of democratic societies. Empirical evidence of logrolling is scarce and limited to highly specific situations…

Physics and Society · Physics 2016-11-07 Omar A. Guerrero , Ulrich Matter