English
Related papers

Related papers: Properties of Multiwinner Voting Rules

200 papers

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

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

Committee scoring voting rules are multiwinner analogues of positional scoring rules which constitute an important subclass of single-winner voting rules. We identify several natural subclasses of committee scoring rules, namely, weakly…

Computer Science and Game Theory · Computer Science 2018-02-20 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

In the popular debate over the use of ranked-choice voting, it is often claimed that the method of single transferable vote (STV) is immune or mostly immune to the so-called ``spoiler effect,'' where the removal of a losing candidate…

Methodology · Statistics 2024-03-07 David McCune , Jennifer Wilson

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

To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives. In this paper, we provide a quantitative analysis of…

Multiagent Systems · Computer Science 2020-09-01 Martin Lackner , Piotr Skowron

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the…

Computer Science and Game Theory · Computer Science 2017-11-23 Robert Bredereck , Piotr Faliszewski , Ayumi Igarashi , Martin Lackner , Piotr Skowron

We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single-peaked resp. single-crossing preferences. We show that for…

Multiagent Systems · Computer Science 2023-08-01 Jiehua Chen , Christian Hatschka , Sofia Simola

We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely…

Computer Science and Game Theory · Computer Science 2016-03-01 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

Computer Science and Game Theory · Computer Science 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

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

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

Committee scoring rules form a rich class of aggregators of voters' preferences for the purpose of selecting subsets of objects with desired properties, e.g., a shortlist of candidates for an interview, a representative collective body such…

Computer Science and Game Theory · Computer Science 2016-11-03 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

Criteria for a good voting system have been given particularly careful scrutiny in recent years, with general agreement that the core values are fair results, voter power and choice, and local representation. This paper reexamines the basic…

Physics and Society · Physics 2023-03-29 Denis Mollison

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

Computational Complexity · Computer Science 2010-05-03 Nadja Betzler , Britta Dorn

In this paper, we experimentally compare major approval-based multiwinner voting rules. To this end, we define a measure of similarity between two equal-sized committees subject to a given election. Using synthetic elections coming from…

Computer Science and Game Theory · Computer Science 2024-01-23 Piotr Faliszewski , Martin Lackner , Krzysztof Sornat , Stanisław Szufa

In real-world elections where voters cast preference ballots, voters often provide only a partial ranking of the candidates. Despite this empirical reality, prior social choice literature frequently analyzes fairness criteria under the…

General Economics · Economics 2024-08-08 Adam Graham-Squire , Matthew I. Jones , David McCune

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

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

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Computer Science and Game Theory · Computer Science 2025-10-28 Markus Schulze
‹ Prev 1 2 3 10 Next ›