English
Related papers

Related papers: Consistent Approval-Based Multi-Winner Rules

200 papers

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC)…

Multiagent Systems · Computer Science 2022-02-25 Jiehua Chen , Sanjukta Roy

We study the parameterized complexity of winner determination problems for three prevalent $k$-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin-Courant's…

Computer Science and Game Theory · Computer Science 2023-06-13 Yongjie Yang , Jianxin Wang

We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head…

Theoretical Economics · Economics 2023-02-14 Wesley H. Holliday , Eric Pacuit

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly

In real-world elections where voters cast preference ballots, voters often provide only a partial ranking of the candidates. Despite this empirical reality, prior social choice literature frequently analyzes fairness criteria under the…

General Economics · Economics 2024-08-08 Adam Graham-Squire , Matthew I. Jones , David McCune

We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain…

Computer Science and Game Theory · Computer Science 2024-07-30 Hariz Aziz , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

Committee scoring voting rules are multiwinner analogues of positional scoring rules which constitute an important subclass of single-winner voting rules. We identify several natural subclasses of committee scoring rules, namely, weakly…

Computer Science and Game Theory · Computer Science 2018-02-20 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

Committee-selection problems arise in many contexts and applications, and there has been increasing interest within the social choice research community on identifying which properties are satisfied by different multi-winner voting rules.…

Artificial Intelligence · Computer Science 2025-08-11 Joshua Caiata , Ben Armstrong , Kate Larson

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

Computer Science and Game Theory · Computer Science 2023-07-19 Hari Sarang Nathan

In this paper, we study the problem of Participatory Budgeting (PB) with approval ballots, inspired by Multi-Winner Voting schemes. We present generalized preference aggregation methods for participatory budgeting, especially for finding…

Computational Engineering, Finance, and Science · Computer Science 2024-10-10 Rutvik Page , Arnav Doifode , Jitendra Tembhurne , Aishwarya Sagar Anand Ukey

We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optimizing the total (dis)satisfaction of the voters with their…

Artificial Intelligence · Computer Science 2013-12-17 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee of size k that has a Chamberlin-Courant (respectively,…

Data Structures and Algorithms · Computer Science 2020-04-30 Chinmay Sonar , Palash Dey , Neeldhara Misra

We propose the maximin support method, a novel extension of the D'Hondt apportionment method to approval-based multiwinner elections. The maximin support method is based on maximizing the support of the least supported elected candidate. It…

Computer Science and Game Theory · Computer Science 2018-09-07 Luis Sánchez-Fernández , Norberto Fernández , Jesús A. Fisteus , Markus Brill

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

Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on…

Computer Science and Game Theory · Computer Science 2018-07-03 Artur Poplawski

To understand and summarize approval preferences and other binary evaluation data, it is useful to order the items on an axis which explains the data. In a political election using approval voting, this could be an ideological left-right…

Computer Science and Game Theory · Computer Science 2024-05-08 Théo Delemazure , Chris Dong , Dominik Peters , Magdaléna Tydrichová