English
Related papers

Related papers: Gerrymandering and fair districting in parallel vo…

200 papers

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 consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

The topic of this paper is "gerrymandering", namely the curse of deliberate creations of district maps with highly asymmetric electoral outcomes to disenfranchise voters, and it has a long legal history. Measuring and eliminating…

Computational Complexity · Computer Science 2020-08-05 Tanima Chatterjee , Bhaskar DasGupta

We study how office-seeking parties use direct democracy to shape elections. A party with a strong electoral base can benefit from using a binding referendum to resolve issues that divide its core supporters. When referendums do not bind,…

Theoretical Economics · Economics 2022-08-12 Peter Buisseret , Richard Van Weelden

The process of legislative redistricting in New Hampshire, along with many other states across the country, was particularly contentious during the 2020 census cycle. In this paper we present an ensemble analysis of the enacted districts to…

Social and Information Networks · Computer Science 2025-09-12 Atticus McWhorter , Daryl DeFord

We focus on the scenario in which an agent can exploit his information advantage to manipulate the outcome of an election. In particular, we study district-based elections with two candidates, in which the winner of the election is the…

Computer Science and Game Theory · Computer Science 2020-12-11 Matteo Castiglioni , Nicola Gatti

Gerrymandering is a pervasive problem within the US political system. In the past decade, methods based on Markov Chain Monte Carlo (MCMC) sampling and statistical outlier tests have been proposed to quantify gerrymandering and were used as…

Computers and Society · Computer Science 2025-01-13 Ranthony A. Clark , Susan Glenn , Harlin Lee , Soledad Villar

We present an online voting architecture based on partitioning the election in small clusters of voters and using a new Multi-party Computation algorithm for obtaining voting results from the clusters. This new algorithm has some practical…

Cryptography and Security · Computer Science 2016-03-15 Juanjo Bermúdez

Most democratic countries use election methods to transform election results into whole numbers which usually give the number of seats in a legislative body the parties obtained. Which election method does this best can be specified by…

History and Overview · Mathematics 2015-10-27 Horst F. Niemeyer , Alice C. Niemeyer

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

This paper discusses several recent electronic-paper remote voting hybrid schemes, concentrating more specifically on the proposal put forward for Belgian elections. We point to some problems in the proposal, and consider addition of blind…

Cryptography and Security · Computer Science 2023-05-17 Jan Willemson

Election data represent a precious source of information to study human behavior at a large scale. In proportional elections with open lists, the number of votes received by a candidate, rescaled by the average performance of all…

Physics and Society · Physics 2013-01-25 Arnab Chatterjee , Marija Mitrović , Santo Fortunato

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

Interconnection networks of parallel systems are used for servicing traf- fic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-02 Zhuang Wang , Xiao Lv , Mingyu Yan , Wei Yang , Ge Li

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 develop methods to evaluate whether a political districting accurately represents the will of the people. To explore and showcase our ideas, we concentrate on the congressional districts for the U.S. House of representatives and use the…

Voting methods are instrumental design elements of democracies. Citizens use them to express and aggregate their preferences to reach a collective decision. However, voting outcomes can be as sensitive to voting rules as they are to…

The simplified hypothesis that an election is polarized as an explanation of recent electoral outcomes worldwide is centered on perceptions of voting patterns rather than ideological data from the electorate. While the literature focuses on…

Computers and Society · Computer Science 2024-07-30 Carlos Navarrete , Mariana Macedo , Viktor Stojkoski , Marcela Parada-Contzen , Christopher A Martínez

We show how to use automated computation of election margins to assess the number of votes that would need to change in order to alter a parliamentary outcome for single-member preferential electorates. In the context of increasing…

Data Structures and Algorithms · Computer Science 2017-08-02 Michelle Blom , Peter J. Stuckey , Vanessa Teague

We introduce a single-winner perspective on voting on matchings, in which voters have preferences over possible matchings in a graph, and the goal is to select a single collectively desirable matching. Unlike in classical matching problems,…

Computer Science and Game Theory · Computer Science 2026-01-28 Niclas Boehmer , Jessica Dierking