English
Related papers

Related papers: Proportionality and Strategyproofness in Multiwinn…

200 papers

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

Computer Science and Game Theory · Computer Science 2026-05-07 Chris Dong , 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 an approval-based committee election, the goal is to select a committee consisting of $k$ out of $m$ candidates, based on $n$ voters who each approve an arbitrary number of the candidates. The core of such an election consists of all…

Computer Science and Game Theory · Computer Science 2025-05-15 Dominik Peters

Proportional representation plays a crucial role in electoral systems. In ordinal elections, where voters rank candidates based on their preferences, the Single Transferable Vote (STV) is the most widely used proportional voting method. STV…

Computer Science and Game Theory · Computer Science 2025-05-02 Tuva Bardal , Markus Brill , David McCune , Jannik Peters

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

Purpose: Multiwinner voting rules typically require full knowledge of voter preferences, which becomes impractical in large-scale or attention-limited settings. This paper investigates how accurately a winning committee can be approximated…

Computer Science and Game Theory · Computer Science 2026-04-01 Itay Asher Zimet , Shiri Alouf-Heffetz , Nimrod Talmon

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

Multiwinner Elections have emerged as a prominent area of research with numerous practical applications. We contribute to this area by designing parameterized approximation algorithms and also resolving an open question by Yang and Wang…

Computer Science and Game Theory · Computer Science 2025-07-21 Sushmita Gupta , Pallavi Jain , Souvik Saha , Saket Saurabh , Anannya Upasana

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

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 study two influential voting rules proposed in the 1890s by Phragm\'en and Thiele, which elect a committee or parliament of k candidates which proportionally represents the voters. Voters provide their preferences by approving an…

Computer Science and Game Theory · Computer Science 2022-11-01 Dominik Peters , Piotr Skowron

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be…

Computer Science and Game Theory · Computer Science 2015-01-12 Haris Aziz , Toby Walsh

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

The Gibbard-Satterthwaite theorem established that no non-trivial voting rule is strategy-proof, but that does not mean that all voting rules are equally susceptible to strategic manipulation. Over the past fifty years numerous approaches…

Computer Science and Game Theory · Computer Science 2022-03-30 Daria Teplova , Egor Ianovski

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

Computer Science and Game Theory · Computer Science 2025-08-04 Matthew M. Casey , Edith Elkind

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

In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large…

Computer Science and Game Theory · Computer Science 2024-09-10 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

In approval-based committee (ABC) elections, the goal is to select a fixed-size subset of the candidates, a so-called committee, based on the voters' approval ballots over the candidates. One of the most popular classes of ABC voting rules…

Computer Science and Game Theory · Computer Science 2024-03-05 Chris Dong , Patrick Lederer