English
Related papers

Related papers: Analysing Guarantees in Australian Senate Outcomes

200 papers

In many real world elections, agents are not required to rank all candidates. We study three of the most common methods used to modify voting rules to deal with such partial votes. These methods modify scoring rules (like the Borda count),…

Computer Science and Game Theory · Computer Science 2014-06-02 Nina Narodytska , Toby Walsh

Keeping track of how lawmakers vote is essential for government transparency. While many parliamentary voting records are available online, they are often difficult to interpret, making it challenging to understand legislative behavior…

Social and Information Networks · Computer Science 2025-05-20 Zahi Mizrahi , Shai Berkovitz , Nimrod Talmon , Michael Fire

The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random…

Combinatorics · Mathematics 2011-05-26 Ehud Friedgut , Gil Kalai , Nathan Keller , Noam Nisan

Democracies are built upon secure and reliable voting systems. Electronic voting systems seek to replace ballot papers and boxes with computer hardware and software. Proposed electronic election schemes have been subjected to scrutiny, with…

Cryptography and Security · Computer Science 2026-02-16 Paul Keeler , Ben Smyth

When each voter rates or ranks several candidates for a single office, a strong Condorcet winner (SCW) is one who beats all others in two-way races. Among 21 electoral systems examined, 18 will sometimes make candidate X the winner even if…

Methodology · Statistics 2016-09-22 Richard B. Darlington

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 study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions---such as…

Computer Science and Game Theory · Computer Science 2010-04-21 Gábor Erdélyi , Lena Piras , Jörg Rothe

AWAIRE is one of two extant methods for conducting risk-limiting audits of instant-runoff voting (IRV) elections. In principle AWAIRE can audit IRV contests with any number of candidates, but the original implementation incurred memory and…

Computers and Society · Computer Science 2024-09-24 Alexander Ek , Michelle Blom , Philip B. Stark , Peter J. Stuckey , Damjan Vukcevic

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of…

Combinatorics · Mathematics 2012-11-05 Jennifer Iglesias , Nathaniel Ince , Po-Shen Loh

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

Transit Timing Variations (TTVs) are a powerful tool for detecting unseen companions in systems with known transiting exoplanets and for characterizing their masses and orbital properties. Large-scale and homogeneous TTV analyses are a…

Earth and Planetary Astrophysics · Physics 2026-01-14 Luca Naponiello

In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal results have shown that all general voting protocols are…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Tuomas Sandholm

Strategic manipulation of elections is typically studied in the context of promoting individual candidates. In parliamentary elections, however, the focus shifts: voters may care more about the overall governing coalition than the…

Computer Science and Game Theory · Computer Science 2026-01-13 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

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

Automatic speaker verification (ASV) is a well developed technology for biometric identification, and has been ubiquitous implemented in security-critic applications, such as banking and access control. However, previous works have shown…

Machine Learning · Computer Science 2021-07-20 Haibin Wu , Yang Zhang , Zhiyong Wu , Dong Wang , Hung-yi Lee

Switching from one electoral system to another one is frequently criticized by the opposition and is viewed as a means for the ruling party to stay in power. In particular, when the new electoral system is a parallel voting (or a…

Physics and Society · Physics 2020-02-18 Igor Mandric , Igor Roşca , Radu Buzatu

Roll call data are widely used to assess legislators' preferences and ideology, as well as test theories of legislative behavior. In particular, roll call data is often used to determine whether the revealed preferences of legislators are…

Applications · Statistics 2016-01-29 Chelsea Lofland , Abel Rodriguez , Scott Moser

We propose a simple risk-limiting audit for elections, ClipAudit. To determine whether candidate A (the reported winner) actually beat candidate B in a plurality election, ClipAudit draws ballots at random, without replacement, until either…

Cryptography and Security · Computer Science 2017-01-31 Ronald L. Rivest

In Hotelling's model of spatial competition, a unit mass of voters is distributed in the interval $[0,1]$ (with their location corresponding to their political persuasion), and each of $m$ candidates selects as a strategy his distinct…

Computer Science and Game Theory · Computer Science 2024-05-09 Umang Bhaskar , Soumyajit Pyne
‹ Prev 1 8 9 10 Next ›