English
Related papers

Related papers: Analysing Guarantees in Australian Senate Outcomes

200 papers

The Pret a Voter cryptographic voting system was designed to be flexible and to offer voters a familiar and easy voting experience. In this paper we present a case study of our efforts to adapt Pret a Voter to the idiosyncrasies of…

Cryptography and Security · Computer Science 2015-09-22 Chris Culnane , Peter Y. A. Ryan , Steve Schneider , Vanessa Teague

Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the…

Computer Science and Game Theory · Computer Science 2018-06-05 Haris Aziz , Barton Lee

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that…

Computer Science and Game Theory · Computer Science 2024-08-21 Valentin Zech , Niclas Boehmer , Edith Elkind , Nicholas Teh

We consider the problem of selecting an $n$-member committee made up of one of $m$ candidates from each of $n$ distinct departments. Using an algebraic approach, we analyze positional voting procedures, including the Borda count, as…

Tabulation audits for an election provide statistical evidence that a reported contest outcome is "correct" (meaning that the tabulation of votes was properly performed), or else the tabulation audit determines the correct outcome. Stark…

Cryptography and Security · Computer Science 2018-02-13 Ronald L. Rivest

Instant Runoff Voting (IRV) is used in elections for many political offices around the world. It allows voters to specify their preferences among candidates as a ranking. We identify a generalization of the rule, called Approval-IRV, that…

Computer Science and Game Theory · Computer Science 2024-04-18 Théo Delemazure , Dominik Peters

We introduce a quantum voting protocol that uses superposition and entanglement to enable secure, anonymous voting in both centralized and distributed settings. Votes are encoded via phase-flip operations on entangled candidate states,…

Quantum Physics · Physics 2026-04-10 Ali Emre Aydin , Ammar Daskin

To help their users to discover important items at a particular time, major websites like Twitter, Yelp, TripAdvisor or NYTimes provide Top-K recommendations (e.g., 10 Trending Topics, Top 5 Hotels in Paris or 10 Most Viewed News Stories),…

Social and Information Networks · Computer Science 2018-11-22 Abhijnan Chakraborty , Gourab K Patro , Niloy Ganguly , Krishna P. Gummadi , Patrick Loiseau

Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent…

Cryptography and Security · Computer Science 2025-05-21 Tamir Tassa , Lihi Dery , Arthur Zamarin

It is widely known that males and females typically possess different sound characteristics when singing, such as timbre and pitch, but it has never been explored whether these gender-based characteristics lead to a performance disparity in…

Sound · Computer Science 2023-08-08 Xiangming Gu , Wei Zeng , Ye Wang

An important question in elections is the determine whether a candidate can be a winner when some votes are absent. We study this determining winner with the absent votes (WAV) problem when the votes are top-truncated. We show that the WAV…

Computer Science and Game Theory · Computer Science 2023-10-12 Qishen Han , Amélie Marian , Lirong Xia

We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our…

Computer Science and Game Theory · Computer Science 2015-09-09 Robert Bredereck , Jiehua Chen , Rolf Niedermeier , Toby Walsh

Electoral control models ways of changing the outcome of an election via such actions as adding/deleting/partitioning either candidates or voters. These actions modify an election's participation structure and aim at either making a…

Computational Complexity · Computer Science 2016-08-14 Gábor Erdélyi , Lena Piras , Jörg Rothe

The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity…

Quantum Physics · Physics 2007-05-23 Shahar Dolev , Itamar Pitowsky , Boaz Tamir

Sequential voting rules have played a crucial role in shaping decisions within parliamentary and legislative frameworks. After observing that the existing sequential rules fail several fundamental axioms, Horan and Sprumont [2022] proposed…

Computer Science and Game Theory · Computer Science 2026-03-16 Yongjie Yang

We define several different thresholds for election methods by considering different scenarios, corresponding to different proportionality criteria that have been proposed by various authors. In particular, we reformulate the criteria known…

Computer Science and Game Theory · Computer Science 2018-10-16 Svante Janson

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be…

Computer Science and Game Theory · Computer Science 2015-01-12 Haris Aziz , Toby Walsh

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