English
Related papers

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

200 papers

Voting advice applications (VAAs) help millions of voters understand which political parties or candidates best align with their views. This paper explores the potential risks these applications pose to the democratic process when targeted…

Computers and Society · Computer Science 2025-05-20 Frédéric Berdoz , Dustin Brunner , Yann Vonlanthen , Roger Wattenhofer

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

Computer Science and Game Theory · Computer Science 2023-07-07 Friedemann Kemm

Single Transferable Vote (STV) is a voting method used to elect multiple candidates in ranked-choice elections. One weakness of STV is that it fails multiple fairness criteria related to monotonicity and no show paradoxes. We analyze 1,079…

General Economics · Economics 2023-10-20 David McCune , Adam Graham-Squire

In this paper, we consider mixtures of two Mallows models for top-$k$ rankings, both with the same location parameter but with different scale parameters, i.e., a mixture of concentric Mallows models. This situation arises when we have a…

Machine Learning · Statistics 2020-11-06 Collas Fabien , Irurozki Ekhine

We introduce a bottleneck method for learning data representations based on information deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The…

Information Theory · Computer Science 2020-11-05 Pradeep Kr. Banerjee , Guido Montúfar

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

Computer Science and Game Theory · Computer Science 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

Much research in electoral control -- one of the most studied form of electoral attacks, in which an entity running an election alters the structure of that election to yield a preferred outcome -- has focused on giving decision complexity…

Computer Science and Game Theory · Computer Science 2026-05-14 Huy Vu Bui , Michael C. Chavrimootoo , Kien T. Le , Son M. Nguyen

Finding outlying elements in probability distributions can be a hard problem. Taking a real example from Voting Rights Act enforcement, we consider the problem of maximizing the number of simultaneous majority-minority districts in a…

Physics and Society · Physics 2022-06-23 Sarah Cannon , Ari Goldbloom-Helzner , Varun Gupta , JN Matthews , Bhushan Suwal

Visual Place Recognition has recently seen a surge of endeavours utilizing different ensemble approaches to improve VPR performance. Ideas like multi-process fusion or switching involve combining different VPR techniques together, utilizing…

Computer Vision and Pattern Recognition · Computer Science 2023-05-11 Maria Waheed , Michael Milford , Xiaojun Zhai , Klaus McDonald-Maier , Shoaib Ehsan

Previous studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM), though the theoretical reasons for this remain unclear. To address this gap, we analyze the susceptibility to CM of three…

Computer Science and Game Theory · Computer Science 2025-10-17 François Durand

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Since the 1970s there has been a large number of countries that combine formal democratic institutions with authoritarian practices. Although in such countries the ruling elites may receive considerable voter support they often employ…

Applications · Statistics 2016-04-27 Raúl Jiménez , Manuel Hidalgo , Peter Klimek

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

Instant runoff voting (IRV) has recently gained popularity as an alternative to plurality voting for political elections, with advocates claiming a range of advantages, including that it produces more moderate winners than plurality and…

Multiagent Systems · Computer Science 2024-01-19 Kiran Tomlinson , Johan Ugander , Jon Kleinberg

There are many sources of error in counting votes: the apparent winner might not be the rightful winner. Hand tallies of the votes in a random sample of precincts can be used to test the hypothesis that a full manual recount would find a…

Applications · Statistics 2008-07-28 Philip B. Stark

We provide elementary proofs of several results concerning the possible outcomes arising from a fixed profile within the class of positional voting systems. Our arguments enable a simple and explicit construction of paradoxical profiles,…

Combinatorics · Mathematics 2020-08-17 Jacqueline Anderson , Brian Camara , John Pike

The rebellious voter model, introduced by Sturm and Swart (2008), is a variation of the standard, one-dimensional voter model, in which types that are locally in the minority have an advantage. It is related, both through duality and…

Probability · Mathematics 2010-08-17 Jan M. Swart , Karel Vrbensky

We present an approximate sampling framework and discuss how risk-limiting audits can compensate for these approximations, while maintaining their "risk-limiting" properties. Our framework is general and can compensate for counting mistakes…

Data Structures and Algorithms · Computer Science 2019-01-04 Mayuri Sridhar , Ronald L. Rivest

Risk-limiting audits (RLAs) can provide routine, affirmative evidence that reported election outcomes are correct by checking a random sample of cast ballots. An efficient RLA requires checking relatively few ballots. Here we construct…

Applications · Statistics 2024-10-16 Jacob Spertus