English
Related papers

Related papers: Reconfiguring Proportional Committees

200 papers

We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We consider a family of Thiele rules, their greedy variants,…

Computer Science and Game Theory · Computer Science 2023-05-04 Łukasz Janeczko , Piotr Faliszewski

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

We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…

Computer Science and Game Theory · Computer Science 2021-08-05 Grzegorz Pierczyński , Piotr Skowron

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

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

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

We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…

General Economics · Economics 2025-05-19 Ali Lazrak , Jianfeng Zhang

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

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

Suppose a committee consisting of three members has to match $n$ candidates to $n$ different positions. Each member of the committee proposes a matching, however the proposed matchings totally disagree, i.e., every candidate is matched to…

Combinatorics · Mathematics 2021-02-22 Andrii Arman , Vojtěch Rödl , Marcelo Tadeu Sales

Polarization is a major concern for a well-functioning society. Often, mass polarization of a society is driven by polarizing political representation, even when the latter is easily preventable. The existing computational social choice…

Computer Science and Game Theory · Computer Science 2025-09-03 Chris Dong , Martin Bullinger , Tomasz Wąs , Larry Birnbaum , Edith Elkind

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld

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 the committee voting setting, a subset of $k$ alternatives is selected based on the preferences of voters. In this paper, our goal is to efficiently compute $\textit{ex-ante}$ fair probability distributions over committees. We introduce…

Computer Science and Game Theory · Computer Science 2024-12-30 Mashbat Suzuki , Jeremy Vollen

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability…

Physics and Society · Physics 2018-01-17 Alexis R. Hernandez , Carlos Gracia-Lazaro , Edgardo Brigatti , Yamir Moreno

In many proportional parliamentary elections, electoral thresholds (typically 3-5%) are used to promote stability and governability by preventing the election of parties with very small representation. However, these thresholds often result…

Computer Science and Game Theory · Computer Science 2025-03-24 Théo Delemazure , Rupert Freeman , Jérôme Lang , Jean-François Laslier , Dominik Peters

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Computer Science and Game Theory · Computer Science 2026-04-23 Itai Zilberstein , Ratip Emin Berker , George Li , Ruben Martins