English
Related papers

Related papers: Multiwinner Temporal Voting with Aversion to Chang…

200 papers

We study a class of elections in which the input format is trichotomous and allows voters to elicit their negative feelings explicitly. In particular, we study multiwinner elections with a special proclivity to elect proportionally…

Computer Science and Game Theory · Computer Science 2021-01-14 Nimrod Talmon , Rutvik Page

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

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 consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders. Of course, shifting comes at a price (depending on the voter…

Artificial Intelligence · Computer Science 2018-09-26 Robert Bredereck , Piotr Faliszewski , Rolf Niedermeier , Nimrod Talmon

We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely…

Computer Science and Game Theory · Computer Science 2016-03-01 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

Computer Science and Game Theory · Computer Science 2017-11-23 Robert Bredereck , Piotr Faliszewski , Ayumi Igarashi , Martin Lackner , 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

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris

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

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

The successive and the amendment procedures have been widely employed in parliamentary and legislative decision making and have undergone extensive study in the literature from various perspectives. However, investigating them through the…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

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 paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a…

Discrete Mathematics · Computer Science 2025-06-11 N. I. Shushko , D. V. Lemtyuzhnikova

Electoral control refers to attempts by an election's organizer ("the chair") to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreaking work of Bartholdi, Tovey, and Trick [BTT92] on (constructive)…

Computer Science and Game Theory · Computer Science 2008-09-26 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all…

Computer Science and Game Theory · Computer Science 2019-05-14 Yu Cheng , Zhihao Jiang , Kamesh Munagala , Kangning Wang

Committee scoring rules form a rich class of aggregators of voters' preferences for the purpose of selecting subsets of objects with desired properties, e.g., a shortlist of candidates for an interview, a representative collective body such…

Computer Science and Game Theory · Computer Science 2016-11-03 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko