English
Related papers

Related papers: Participation Incentives in Approval-Based Committ…

200 papers

Proportional representation (PR) is one of the central principles in voting. Elegant rules with compelling PR axiomatic properties have the potential to be adopted for several important collective decision making settings. I survey some…

Computer Science and Game Theory · Computer Science 2018-02-06 Haris Aziz

Voting is a very general method of preference aggregation. A voting rule takes as input every voter's vote (typically, a ranking of the alternatives), and produces as output either just the winning alternative or a ranking of the…

Computer Science and Game Theory · Computer Science 2012-07-09 Vincent Conitzer , Tuomas Sandholm

When aggregating preferences of agents via voting, two desirable goals are to identify outcomes that are Pareto optimal and to incentivize agents to participate in the voting process. We consider participation notions as formalized by…

Computer Science and Game Theory · Computer Science 2016-11-10 Haris Aziz

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Artificial Intelligence · Computer Science 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

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

We analyze Assessment Voting, a new two-round voting procedure that can be applied to binary decisions in democratic societies. In the first round, a randomly-selected number of citizens cast their vote on one of the two alternatives at…

Econometrics · Economics 2018-02-06 Hans Gersbach , Akaki Mamageishvili , Oriol Tejada

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

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

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

We investigate the complexity of several manipulation and control problems under numerous prevalent approval-based multiwinner voting rules. Particularly, the rules we study include approval voting (AV), satisfaction approval voting (SAV),…

Computer Science and Game Theory · Computer Science 2023-09-06 Yongjie Yang

Aggregating agent preferences into a collective decision is an important step in many problems (e.g., hiring, elections, peer review) and across areas of computer science (e.g., reinforcement learning, recommender systems). As Social Choice…

Multiagent Systems · Computer Science 2025-09-12 Leonardo Matone , Ben Abramowitz , Ben Armstrong , Avinash Balakrishnan , Nicholas Mattei

We provide the first large-scale data collection of real-world approval-based committee elections. These elections have been conducted on the Polkadot blockchain as part of their Nominated Proof-of-Stake mechanism and contain around one…

Computer Science and Game Theory · Computer Science 2023-12-20 Niclas Boehmer , Markus Brill , Alfonso Cevallos , Jonas Gehrlein , Luis Sánchez-Fernández , Ulrike Schmidt-Kraepelin

This article describes an action rule induction algorithm based on a sequential covering approach. Two variants of the algorithm are presented. The algorithm allows the action rule induction from a source and a target decision class point…

Artificial Intelligence · Computer Science 2021-06-11 Marek Sikora , Paweł Matyszok , Łukasz Wróbel

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

A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive counterparts seem to be less explored. This paper investigates…

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

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

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 participatory budgeting we are given a set of projects---each with a cost, an available budget, and a set of voters who in some form express their preferences over the projects. The goal is to select---based on voter preferences---a…

Multiagent Systems · Computer Science 2020-09-08 Piotr Skowron , Arkadii Slinko , Stanisław Szufa , Nimrod Talmon

We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several…

Computer Science and Game Theory · Computer Science 2020-12-10 Pallavi Jain , Krzysztof Sornat , Nimrod Talmon , Meirav Zehavi

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