English
Related papers

Related papers: Characterizations of Sequential Valuation Rules

200 papers

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

While proportionality is frequently named as a desirable property of voting rules, its interpretation in multiwinner voting differs significantly from that in apportionment. We aim to bridge these two distinct notions of proportionality by…

Computer Science and Game Theory · Computer Science 2026-02-11 Daria Boratyn , Dariusz Stolicki

We study the committee selection problem in the canonical impartial culture model with a large number of voters and an even larger candidate set. Here, each voter independently reports a uniformly random preference order over the…

Computer Science and Game Theory · Computer Science 2026-02-05 Yifan Lin , Shenyu Qin , Kangning Wang , Lirong Xia

In Approval-Based Committee (ABC) voting, each voter lists the candidates they approve and then a voting rule aggregates the individual approvals into a committee that represents the collective choice of the voters. An extensively studied…

Databases · Computer Science 2025-01-29 Roi Yona , Benny Kimelfeld

To aggregate rankings into a social ranking, one can use scoring systems such as Plurality, Veto, and Borda. We distinguish three types of methods: ranking by score, ranking by repeatedly choosing a winner that we delete and rank at the…

Computer Science and Game Theory · Computer Science 2022-09-20 Niclas Boehmer , Robert Bredereck , Dominik Peters

Approval-based multiwinner voting rules have recently received much attention in the Computational Social Choice literature. Such rules aggregate approval ballots and determine a winning committee of alternatives. To assess effectiveness,…

Artificial Intelligence · Computer Science 2020-11-10 Ioannis Caragiannis , Christos Kaklamanis , Nikos Karanikolas , George A. Krimpas

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

Computer Science and Game Theory · Computer Science 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a score not smaller than (respectively, strictly greater than)…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

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

Approval-like voting rules, such as Sincere-Strategy Preference-Based Approval voting (SP-AV), the Bucklin rule (an adaptive variant of $k$-Approval voting), and the Fallback rule (an adaptive variant of SP-AV) have many desirable…

Computer Science and Game Theory · Computer Science 2015-01-05 Ildikó Schlotter , Piotr Faliszewski , Edith Elkind

We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain…

Computer Science and Game Theory · Computer Science 2024-07-30 Hariz Aziz , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

The goal of this paper is to propose and study properties of multiwinner voting rules which can be consider as generalisations of single-winner scoring voting rules. We consider SNTV, Bloc, k-Borda, STV, and several variants of…

Computer Science and Game Theory · Computer Science 2015-06-10 Edith Elkind , Piotr Faliszewski , Piotr Skowron , Arkadii Slinko

We study approval-based committee voting from a novel perspective. While extant work largely centers around proportional representation of the voters, we shift our focus to the candidates while preserving proportionality. Intuitively,…

Computer Science and Game Theory · Computer Science 2025-06-24 Gregory Kehne , Ulrike Schmidt-Kraepelin , Krzysztof Sornat

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Computer Science and Game Theory · Computer Science 2014-01-17 Lirong Xia , Vincent Conitzer

In this paper, we propose a family of approval voting-schemes for electing committees based on the preferences of voters. In our schemes, we calculate the vector of distances of the possible committees from each of the ballots and, for a…

Computer Science and Game Theory · Computer Science 2018-01-24 Shankar N. Sivarajan

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly

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

In a recently introduced model of successive committee elections (Bredereck et al., AAAI-20) for a given set of ordinal or approval preferences one aims to find a sequence of a given length of "best" same-size committees such that each…

Computer Science and Game Theory · Computer Science 2025-05-27 Pallavi Jain , Andrzej Kaczmarczyk

We study two concepts of proportionality in the model of approval-based committee elections. In degressive proportionality small minorities of voters are favored in comparison with the standard linear proportionality. Regressive…

Computer Science and Game Theory · Computer Science 2022-01-13 Michal Jaworski , Piotr Skowron