English
Related papers

Related papers: Perpetual Voting: The Axiomatic Lens

200 papers

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters with cohesive preferences should be adequately represented…

Computer Science and Game Theory · Computer Science 2025-12-10 Luis Sánchez-Fernández , Edith Elkind , Martin Lackner , Norberto Fernández , Jesús A. Fisteus , Pablo Basanta Val , Piotr Skowron

We extend Approval voting to the settings where voters may have intransitive preferences. The major obstacle to applying Approval voting in these settings is that voters are not able to clearly determine who they should approve or…

Computer Science and Game Theory · Computer Science 2017-02-28 Yongjie Yang

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…

Theoretical Economics · Economics 2022-05-25 Arash Abizadeh , Adrian Vetta

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

Online discussion platforms are a vital part of the public discourse in a deliberative democracy. However, how to interpret the outcomes of the discussions on these platforms is often unclear. In this paper, we propose a novel and…

Computer Science and Game Theory · Computer Science 2024-02-09 Michael Bernreiter , Jan Maly , Oliviero Nardi , Stefan Woltran

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

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á

In approval-based budget division, a budget needs to be distributed to candidates based on the voters' approval ballots over these candidates. In the pursuit of a simple, consistent, and approximately fair rule for this setting, we…

Computer Science and Game Theory · Computer Science 2025-10-06 Haris Aziz , Patrick Lederer , Xinhang Lu , Mashbat Suzuki , Jeremy Vollen

Randomisation and time-sharing are some of the oldest methods to achieve fairness. I make a case that applying these approaches to social choice settings constitutes a powerful paradigm that deserves an extensive and thorough examination. I…

Computer Science and Game Theory · Computer Science 2020-02-25 Haris Aziz

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

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

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

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

This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…

Data Structures and Algorithms · Computer Science 2024-01-22 Lisa Hellerstein , Naifeng Liu , Kevin Schewior

Machine learning systems have been shown to propagate the societal errors of the past. In light of this, a wealth of research focuses on designing solutions that are "fair." Even with this abundance of work, there is no singular definition…

Machine Learning · Computer Science 2020-05-18 Ninareh Mehrabi , Yuzhong Huang , Fred Morstatter

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…

Computer Science and Game Theory · Computer Science 2025-12-05 Jannik Peters
‹ Prev 1 3 4 5 6 7 10 Next ›