English
Related papers

Related papers: Conquering the Multiverse: The River Voting Method…

200 papers

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-26 Pierre Fraigniaud , Ran Gelles , Zvi Lotker

Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and model interpretability. With the emergence of big data, there…

Machine Learning · Computer Science 2016-11-07 Qi Meng , Guolin Ke , Taifeng Wang , Wei Chen , Qiwei Ye , Zhi-Ming Ma , Tie-Yan Liu

We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of…

Computer Science and Game Theory · Computer Science 2020-07-10 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier

When auditing a redistricting plan, a persuasive method is to compare the plan with an ensemble of neutrally drawn redistricting plans. Ensembles are generated via algorithms that sample distributions on balanced graph partitions. To audit…

Physics and Society · Physics 2024-02-01 Gabriel Chuang , Gregory Herschlag , Jonathan C. Mattingly

Inspired by recent successes with parallel optimization techniques for solving Boolean satisfiability, we investigate a set of strategies and heuristics that aim to leverage parallel computing to improve the scalability of neural network…

Logic in Computer Science · Computer Science 2020-08-24 Haoze Wu , Alex Ozdemir , Aleksandar Zeljić , Ahmed Irfan , Kyle Julian , Divya Gopinath , Sadjad Fouladi , Guy Katz , Corina Pasareanu , Clark Barrett

An election over a finite set of candidates is called single-crossing if, as we sweep through the list of voters from left to right, the relative order of every pair of candidates changes at most once. Such elections have many attractive…

Computer Science and Game Theory · Computer Science 2019-06-25 Nathann Cohenn , Edith Elkind , Foram Lakhani

In the committee voting setting, a subset of $k$ alternatives is selected based on the preferences of voters. In this paper, our goal is to efficiently compute $\textit{ex-ante}$ fair probability distributions over committees. We introduce…

Computer Science and Game Theory · Computer Science 2024-12-30 Mashbat Suzuki , Jeremy Vollen

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for…

Computer Science and Game Theory · Computer Science 2025-08-06 Zack Fitzsimmons , Zohair Raza Hassan , Edith Hemaspaandra

Gerrymandering, the deliberate manipulation of electoral district boundaries for political advantage, is a persistent issue in U.S. redistricting cycles. This paper introduces and analyzes a new phenomenon, 'votemandering'- a strategic…

Computer Science and Game Theory · Computer Science 2023-08-17 Sanyukta Deshpande , Ian G Ludden , Sheldon H Jacobson

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…

Several election districts in the US have recently moved to ranked-choice voting (RCV) to decide the results of local elections. RCV allows voters to rank their choices, and the results are computed in rounds, eliminating one candidate at a…

Computers and Society · Computer Science 2022-06-28 Alborz Jelvani , Amélie Marian

Ensuring fair outcomes for multiple stakeholders in recommender systems has been studied mostly in terms of algorithmic interventions: building new models with better fairness properties, or using reranking to improve outcomes from an…

Information Retrieval · Computer Science 2025-09-30 Elizabeth McKinnie , Anas Buhayh , Clement Canel , Robin Burke

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

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

In the face of adverse motives, it is indispensable to achieve a consensus. Elections have been the canonical way by which modern democracy has operated since the 17th century. Nowadays, they regulate markets, provide an engine for modern…

Machine Learning · Computer Science 2026-01-06 Hao Xiang Li , Yash Shah , Lorenzo Giusti

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

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia

Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States -- Winner takes all single-member districts -- both enables substantial partisan…

Computer Science and Game Theory · Computer Science 2026-02-23 Nikhil Garg , Wes Gurnee , David Rothschild , David Shmoys

High voter turnout in elections and referendums is very desirable in order to ensure a robust democracy. Secure electronic voting is a vision for the future of elections and referendums. Such a system can counteract factors that hinder…

Cryptography and Security · Computer Science 2019-09-17 Maximilian Schiedermeier , Omar Hasan , Tobias Mayer , Lionel Brunie , Harald Kosch