English
Related papers

Related papers: Approval-Based Committee Voting under Uncertainty

200 papers

In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of $n$ eligible candidates, the decision maker needs to choose the…

Data Structures and Algorithms · Computer Science 2019-05-08 Manish Raghavan , Manish Purohit , Sreenivas Gollupadi

Multi-winner voting plays a crucial role in selecting representative committees based on voter preferences. Previous research has predominantly focused on single-stage voting rules, which are susceptible to manipulation during preference…

Computer Science and Game Theory · Computer Science 2024-02-06 Shengjie Gong , Lingxiao Huang , Shuangping Huang , Yuyi Wang , Zhiqi Wang , Tao Xiao , Xiang Yan , Chunxue Yang

We consider an agent community wishing to decide on several binary issues by means of issue-by-issue majority voting. For each issue and each agent, one of the two options is better than the other. However, some of the agents may be…

Computer Science and Game Theory · Computer Science 2022-07-12 Shiri Alouf-Heffetz , Laurent Bulteau , Edith Elkind , Nimrod Talmon , Nicholas Teh

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 the computational complexity of committee selection problem for several approval-based voting rules in the presence of outliers. Our first result shows that outlier consideration makes committee selection problem intractable for…

Multiagent Systems · Computer Science 2015-11-16 Palash Dey , Neeldhara Misra , Y. Narahari

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each…

Computer Science and Game Theory · Computer Science 2016-07-12 Haris Aziz , Péter Biró , Serge Gaspers , Ronald de Haan , Nicholas Mattei , Baharak Rastegari

Core stability is a natural and well-studied notion for group fairness in multi-winner voting, where the task is to select a committee from a pool of candidates. We study the setting where voters either approve or disapprove of each…

Computer Science and Game Theory · Computer Science 2025-12-19 Ratip Emin Berker , Emanuel Tewolde , Vincent Conitzer , Mingyu Guo , Marijn Heule , Lirong Xia

We study the envy-free house allocation problem when agents have uncertain preferences over items and consider several well-studied preference uncertainty models. The central problem that we focus on is computing an allocation that has the…

Computer Science and Game Theory · Computer Science 2023-12-19 Haris Aziz , Isaiah Iliffe , Bo Li , Angus Ritossa , Ankang Sun , Mashbat Suzuki

We propose a framework for strategic voting when a voter may lack knowledge about the preferences of other voters, or about other voters' knowledge about her own preference. In this setting we define notions of manipulation, equilibrium,…

Computer Science and Game Theory · Computer Science 2021-11-30 Zeinab Bakhtiari , Hans van Ditmarsch , Abdallah Saffidine

Voting rules based on evaluation inputs rather than preference orders have been recently proposed, like majority judgement, range voting or approval voting. Traditionally, probabilistic analysis of voting rules supposes the use of…

Artificial Intelligence · Computer Science 2021-04-19 Antoine Rolland , Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni

Considering voting rules based on evaluation inputs rather than preference rankings modifies the paradigm of probabilistic studies of voting procedures. This article proposes several simulation models for generating evaluation-based voting…

Applications · Statistics 2024-03-18 Antoine Rolland , Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni

Approval-based committee selection is a model of significant interest in social choice theory. In this model, we have a set of voters $\mathcal{V}$, a set of candidates $\mathcal{C}$, and each voter has a set $A_v \subset \mathcal{C}$ of…

Computer Science and Game Theory · Computer Science 2025-08-04 Drew Gao , Yihang Sun , Jan Vondrák

We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…

Computer Science and Game Theory · Computer Science 2023-09-22 Martin Lackner , Piotr Skowron

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

Computer Science and Game Theory · Computer Science 2019-05-31 Jaelle Scheuerman , Jason L. Harman , Nicholas Mattei , K. Brent Venable

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that…

Computer Science and Game Theory · Computer Science 2024-08-21 Valentin Zech , Niclas Boehmer , Edith Elkind , Nicholas Teh

In a real expert system, one may have unreliable, unconfident, conflicting estimates of the value for a particular parameter. It is important for decision making that the information present in this aggregate somehow find its way into use.…

Artificial Intelligence · Computer Science 2013-04-15 Henry Hamburger

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

Electing a committee of size k from m alternatives (k < m) is an interesting problem under the multi-winner voting rules. However, very few committee selection rules found in the literature consider the coalitional possibilities among the…

Theoretical Economics · Economics 2023-08-08 Ritu Dutta , Rajnish Kumnar , Surajit Borkotokey

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