English
Related papers

Related papers: Proportionality and Strategyproofness in Multiwinn…

200 papers

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

Computer Science and Game Theory · Computer Science 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

Computer Science and Game Theory · Computer Science 2019-10-15 Piotr Skowron

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

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

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

In this paper, we experimentally compare major approval-based multiwinner voting rules. To this end, we define a measure of similarity between two equal-sized committees subject to a given election. Using synthetic elections coming from…

Computer Science and Game Theory · Computer Science 2024-01-23 Piotr Faliszewski , Martin Lackner , Krzysztof Sornat , Stanisław Szufa

We investigate the complexity of several manipulation and control problems under numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we study include approval voting (AV), satisfaction approval voting (SAV),…

Computer Science and Game Theory · Computer Science 2023-09-06 Yongjie Yang

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis

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 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

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

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

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

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

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…

Computer Science and Game Theory · Computer Science 2022-03-31 Markus Brill , Paul Gölz , Dominik Peters , Ulrike Schmidt-Kraepelin , Kai Wilker

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

An important desideratum in approval-based multiwinner voting is proportionality. We study the problem of reconfiguring proportional committees: given two proportional committees, is there a transition path that consists only of…

Computer Science and Game Theory · Computer Science 2025-04-22 Chris Dong , Fabian Frank , Jannik Peters , Warut Suksompong

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

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
‹ Prev 1 2 3 10 Next ›