English
Related papers

Related papers: Justifying Groups in Multiwinner Approval Voting

200 papers

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

Justified Representation (JR)/Extended Justified Representation (EJR) is a desirable axiom in multiwinner approval voting. In contrast to that (E)JR only requires at least \emph{one} voter to be represented in every cohesive group, we study…

Computer Science and Game Theory · Computer Science 2025-02-19 Biaoshuai Tao , Chengkai Zhang , Houyu Zhou

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 study the approval-based multi-winner election problem where $n$ voters jointly decide a committee of $k$ winners from $m$ candidates. We focus on the axiom \emph{average justified representation} (AJR) proposed by Fernandez, Elkind,…

Computer Science and Game Theory · Computer Science 2025-10-22 Qishen Han , Biaoshuai Tao , Lirong Xia , Chengkai Zhang , Houyu Zhou

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

In multiwinner approval voting, forming a committee that proportionally represents voters' approval ballots is an essential task. The notion of justified representation (JR) demands that any large "cohesive" group of voters should be…

Computer Science and Game Theory · Computer Science 2025-01-22 Yusuf Hakan Kalayci , Jiasen Liu , David Kempe

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

Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always satisfiable, but they rely on a fixed quota (typically Hare…

Computer Science and Game Theory · Computer Science 2026-02-18 Patrick Becker , Fabian Frank

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

In this short note, we describe an approval-based committee selection rule that admits a polynomial-time algorithm and satisfies the Extended Justified Representation (EJR) axiom. This rule is based on approximately maximizing the PAV…

Computer Science and Game Theory · Computer Science 2017-04-04 Piotr Skowron , Martin Lackner , Edith Elkind , Luis Sánchez-Fernández

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

We identify a whole family of approval-based multi-winner voting rules that satisfy PJR. Moreover, we identify a subfamily of voting rules within this family that satisfy EJR. All these voting rules can be computed in polynomial time as…

Computer Science and Game Theory · Computer Science 2017-04-19 Luis Sánchez-Fernández , Edith Elkind , Martin Lackner

Online comment sections, such as those on news sites or social media, have the potential to foster informal public deliberation, However, this potential is often undermined by the frequency of toxic or low-quality exchanges that occur in…

Social and Information Networks · Computer Science 2025-07-10 Manon Revel , Smitha Milli , Tyler Lu , Jamelle Watson-Daniels , Max Nickel

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

Data Structures and Algorithms · Computer Science 2021-09-14 Alfonso Cevallos , Alistair Stewart

When selecting a subset of candidates (a so-called committee) based on the preferences of voters, proportional representation is often a major desideratum. When going beyond simplistic models such as party-list or district-based elections,…

Computer Science and Game Theory · Computer Science 2023-02-07 Markus Brill , Jannik Peters

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

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 study proportional representation in the framework of temporal voting with approval ballots. Prior work adapted basic proportional representation concepts -- justified representation (JR), proportional JR (PJR), and extended JR (EJR) --…

Computer Science and Game Theory · Computer Science 2025-05-29 Bradley Phillips , Edith Elkind , Nicholas Teh , Tomasz Wąs

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