English
Related papers

Related papers: Explanation Systems for Approval-Based Multiwinner…

200 papers

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

Participatory budgeting is one of the exciting developments in deliberative grassroots democracy. We concentrate on approval elections and propose proportional representation axioms in participatory budgeting, by generalizing relevant…

Computer Science and Game Theory · Computer Science 2017-11-23 Haris Aziz , Barton Lee , Nimrod Talmon

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler

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

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that…

Computer Science and Game Theory · Computer Science 2021-04-21 Markus Brill , Jean-François Laslier , Piotr Skowron

We present a novel approach to the core set/instance selection problem in machine learning. Our approach is based on recent results on (proportional) representation in approval-based multi-winner elections. In our model, instances play a…

Machine Learning · Computer Science 2025-12-15 Luis Sánchez-Fernández , Jesús A. Fisteus , Rafael López-Zaragoza

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

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended…

Computer Science and Game Theory · Computer Science 2017-03-31 Haris Aziz , Shenwei Huang

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

In an approval-based committee election, the task is to select a committee of up to $k$ candidates from a set of $m$ candidates based on the preferences of $n$ voters, each of whom approves a subset of the candidates. A central open…

Computer Science and Game Theory · Computer Science 2026-05-08 Patrick Becker , Matthias Greger , Dominik Peters

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

Computer Science and Game Theory · Computer Science 2023-12-14 Markus Brill , Jannik Peters

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree…

Computer Science and Game Theory · Computer Science 2022-02-02 Sonja Kraiczy , Edith Elkind

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…

Computer Science and Game Theory · Computer Science 2014-07-14 Haris Aziz , Serge Gaspers , Joachim Gudmundsson , Simon Mackenzie , Nicholas Mattei , Toby Walsh

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

Optimization and Control · Mathematics 2017-07-31 Diego Ponce , Justo Puerto , Federica Ricca , Andrea Scozzari

We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners (committee). We propose a natural axiom for this setting,…

Multiagent Systems · Computer Science 2016-09-13 Haris Aziz , Markus Brill , Vincent Conitzer , Edith Elkind , Rupert Freeman , Toby Walsh

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus