English
Related papers

Related papers: Consistent Approval-Based Multi-Winner Rules

200 papers

Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always satisfiable, but they rely on a fixed quota (typically Hare…

Computer Science and Game Theory · Computer Science 2026-02-18 Patrick Becker , Fabian Frank

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

Optimization and Control · Mathematics 2016-11-03 Sergey Shvydun

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…

Computer Science and Game Theory · Computer Science 2014-02-05 Nadja Betzler , Arkadii Slinko , Johannes Uhlmann

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

We visualize aggregate outputs of popular multiwinner voting rules--SNTV, STV, Bloc, k-Borda, Monroe, Chamberlin--Courant, and HarmonicBorda--for elections generated according to the two-dimensional Euclidean model. We consider three…

Computer Science and Game Theory · Computer Science 2019-01-29 Edith Elkind , Piotr Faliszewski , Jean-Francois Laslier , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

While machine-learning models are flourishing and transforming many aspects of everyday life, the inability of humans to understand complex models poses difficulties for these models to be fully trusted and embraced. Thus, interpretability…

Artificial Intelligence · Computer Science 2020-06-18 Guangyi Zhang , Aristides Gionis

We investigate majority rule dynamics in a population with two classes of people, each with two opinion states $\pm 1$, and with tunable interactions between people in different classes. In an update, a randomly selected group adopts the…

Statistical Mechanics · Physics 2021-06-23 P. L. Krapivsky , S. Redner

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

In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large…

Computer Science and Game Theory · Computer Science 2024-09-10 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

We consider an odd-sized "jury", which votes sequentially between two states of Nature (say A and B, or Innocent and Guilty) with the majority opinion determining the verdict. Jurors have private information in the form of a signal in…

Theoretical Economics · Economics 2021-10-12 Steve Alpern , Bo Chen

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

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

Computer Science and Game Theory · Computer Science 2025-08-04 Matthew M. Casey , Edith Elkind

We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

In a district-based election, we apply a voting rule $r$ to decide the winners in each district, and a candidate who wins in a maximum number of districts is the winner of the election. We present efficient sampling-based algorithms to…

Artificial Intelligence · Computer Science 2022-03-02 Palash Dey , Debajyoti Kar , Swagato Sanyal

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large set of candidates such that the former have a consistent…

Computer Science and Game Theory · Computer Science 2024-07-29 Łukasz Janeczko , Jérôme Lang , Grzegorz Lisowski , Stanisław Szufa

We introduce the model of line-up elections which captures parallel or sequential single-winner elections with a shared candidate pool. The goal of a line-up election is to find a high-quality assignment of a set of candidates to a set of…

Computer Science and Game Theory · Computer Science 2020-07-10 Niclas Boehmer , Robert Bredereck , Piotr Faliszewski , Andrzej Kaczmarczyk , Rolf Niedermeier

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

The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define ("rationalize")…

Computer Science and Game Theory · Computer Science 2010-09-03 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

We show a prototype of a system that uses multiwinner voting to suggest resources (such as movies) related to a given query set (such as a movie that one enjoys). Depending on the voting rule used, the system can either provide resources…

Computer Science and Game Theory · Computer Science 2022-02-09 Grzegorz Gawron , Piotr Faliszewski