English
Related papers

Related papers: Tradeoffs in Hierarchical Voting Systems

200 papers

This paper establishes non-asymptotic convergence of the cutoffs in Random serial dictatorship in an environment with many students, many schools, and arbitrary student preferences. Convergence is shown to hold when the number of schools,…

Theoretical Economics · Economics 2026-05-26 Suhas Vijaykumar

We study the probability that a given candidate is an alpha-winner, i.e. a candidate preferred to each other candidate j by a fraction alpha_j of the voters. This extends the classical notion of Condorcet winner, which corresponds to the…

Computer Science and Game Theory · Computer Science 2025-05-12 Emma Caizergues , François Durand , Marc Noy , Élie de Panafieu , Vlady Ravelomanana

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

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Computer Science and Game Theory · Computer Science 2025-10-28 Markus Schulze

The study of fairness in multiwinner elections focuses on settings where candidates have attributes. However, voters may also be divided into predefined populations under one or more attributes (e.g., "California" and "Illinois" populations…

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

Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside…

Computers and Society · Computer Science 2022-03-09 Adway Mitra

The dynamics of random transitive delegations on a graph are of particular interest when viewed through the lens of an emerging voting paradigm, liquid democracy. This paradigm allows voters to choose between directly voting and…

Discrete Mathematics · Computer Science 2024-08-28 Adam Berinsky , Daniel Halpern , Joseph Y. Halpern , Ali Jadbabaie , Elchanan Mossel , Ariel D. Procaccia , Manon Revel

We study proportional representation in the framework of temporal voting with approval ballots. Prior work adapted basic proportional representation concepts -- justified representation (JR), proportional JR (PJR), and extended JR (EJR) --…

Computer Science and Game Theory · Computer Science 2025-05-29 Bradley Phillips , Edith Elkind , Nicholas Teh , Tomasz Wąs

We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing…

Multiagent Systems · Computer Science 2021-03-09 Aris Anagnostopoulos , Luca Becchetti , Emilio Cruciani , Francesco Pasquale , Sara Rizzo

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…

Computer Science and Game Theory · Computer Science 2025-02-06 Ildikó Schlotter , Katarína Cechlárová

We uncover a new relation between Closeness centrality and the Condorcet principle. We define a Condorcet winner in a graph as a node that compared to any other node is closer to more nodes. In other words, if we assume that nodes vote on a…

Social and Information Networks · Computer Science 2021-12-02 Oskar Skibski

Liquid democracy is a novel paradigm for collective decision-making that gives agents the choice between casting a direct vote or delegating their vote to another agent. We consider a generalization of the standard liquid democracy setting…

Computer Science and Game Theory · Computer Science 2021-12-15 Markus Brill , Théo Delemazure , Anne-Marie George , Martin Lackner , Ulrike Schmidt-Kraepelin

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

A Ranked candidate voting method based on Phragmen's procedure is described that can be used to produce a top-down proportional candidate list. The method complies with the Droop proportionality criterion satisfied by Single Transferable…

Theoretical Economics · Economics 2026-04-14 Ross Hyman

In selection processes such as hiring, promotion, and college admissions, implicit bias toward socially-salient attributes such as race, gender, or sexual orientation of candidates is known to produce persistent inequality and reduce…

Computers and Society · Computer Science 2022-06-08 Anay Mehrotra , Bary S. R. Pradelski , Nisheeth K. Vishnoi

We introduces a general linear framework that unifies the study of multi-winner voting rules and proportionality axioms, demonstrating that many prominent multi-winner voting rules-including Thiele methods, their sequential variants, and…

Computer Science and Game Theory · Computer Science 2025-03-06 Lirong Xia

Data of proportional elections show a striking feature: If the parties are ranked according to the number of their voters, the number of votes grows exponentially with the rank of the party. This so-called Zipf's law has been reported…

Physics and Society · Physics 2018-03-30 Volker Hösel , Johannes Müller , Aurélien Tellier

Background: It has repeatedly been reported that when making decisions under uncertainty, groups outperform individuals. In a lab setting, real groups are often replaced by simulated groups: Instead of performing an actual group discussion,…

Applications · Statistics 2021-06-08 Sascha Meyen , Dorothee M. B. Sigg , Ulrike von Luxburg , Volker H. Franz

A Condorcet winning set is a set of candidates such that no other candidate is preferred by at least half the voters over all members of the set. The Condorcet dimension, which is the minimum cardinality of a Condorcet winning set, is known…

Computer Science and Game Theory · Computer Science 2025-12-02 Alexandra Lassota , Adrian Vetta , Bernhard von Stengel
‹ Prev 1 8 9 10 Next ›