English
Related papers

Related papers: Approval-Based Committee Voting under Uncertainty

200 papers

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

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

We study the {PAC} learnability of multiwinner voting, focusing on the class of approval-based committee scoring (ABCS) rules. These are voting rules applied on profiles with approval ballots, where each voter approves some of the…

Computer Science and Game Theory · Computer Science 2023-08-02 Ioannis Caragiannis , Karl Fehrs

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

Approval voting is a common method of preference aggregation where voters vote by ``approving'' of a subset of candidates and the winner(s) are those who are approved of by the largest number of voters. In approval voting, the degree to…

Computer Science and Game Theory · Computer Science 2023-07-19 Hari Sarang Nathan

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school's evaluation with social choice criteria to reflect the…

Computer Science and Game Theory · Computer Science 2026-03-05 Haoyu Song , Thanh Nguyen , Young-san Lin

This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…

Theoretical Economics · Economics 2026-02-24 Federico Fioravanti , Zoi Terzopoulou

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

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

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

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

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 define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

Computer Science and Game Theory · Computer Science 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

We study the Popular Matching problem in multiple models, where the preferences of the agents in the instance may change or may be unknown/uncertain. In particular, we study an Uncertainty model, where each agent has a possible set of…

Computer Science and Game Theory · Computer Science 2025-06-06 Gergely Csáji

In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…

Combinatorics · Mathematics 2021-08-30 Kristen Mazur , Mutiara Sondjaja , Matthew Wright , Carolyn Yarnall

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval…

Computer Science and Game Theory · Computer Science 2021-04-20 Piotr Faliszewski , Piotr Skowron , Nimrod Talmon

We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences. By proposing basic axioms to capture this objective, we…

Computer Science and Game Theory · Computer Science 2024-05-10 Théo Delemazure , Łukasz Janeczko , Andrzej Kaczmarczyk , Stanisław Szufa

Committee decisions are complicated by a deadline, e.g., the next start of a budget, or the beginning of a semester. In committee hiring decisions, it may be that if no candidate is supported by a strong majority, the default is to hire no…

Computers and Society · Computer Science 2024-01-09 Marina Bannikova , Lihi Dery , Svetlana Obraztsova , Zinovi Rabinovich , Jeffrey S. Rosenschein

In many collective decision making situations, agents vote to choose an alternative that best represents the preferences of the group. Agents may manipulate the vote to achieve a better outcome by voting in a way that does not reflect their…

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