English
Related papers

Related papers: Multiwinner Approval Rules as Apportionment Method…

200 papers

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

Computer Science and Game Theory · Computer Science 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…

Data Structures and Algorithms · Computer Science 2017-12-06 Raphael Reitzig , Sebastian Wild

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 this note, we uncover three connections between the metric distortion problem and voting methods and axioms from the social choice literature.

Computer Science and Game Theory · Computer Science 2023-05-16 Jannik Peters

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

Computer Science and Game Theory · Computer Science 2026-05-07 Chris Dong , Jannik Peters

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

Multiagent Systems · Computer Science 2020-03-02 Mohammad Ali Javidian , Pooyan Jamshidi , Marco Valtorta , Rasoul Ramezanian

We describe a machine learning method for predicting the value of a real-valued function, given the values of multiple input variables. The method induces solutions from samples in the form of ordered disjunctive normal form (DNF) decision…

Artificial Intelligence · Computer Science 2014-11-17 S. M. Weiss , N. Indurkhya

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

Artificial Intelligence · Computer Science 2024-08-27 Clément Contet , Umberto Grandi , Jérôme Mengin

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

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

Multi-winner voting plays a crucial role in selecting representative committees based on voter preferences. Previous research has predominantly focused on single-stage voting rules, which are susceptible to manipulation during preference…

Computer Science and Game Theory · Computer Science 2024-02-06 Shengjie Gong , Lingxiao Huang , Shuangping Huang , Yuyi Wang , Zhiqi Wang , Tao Xiao , Xiang Yan , Chunxue Yang

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

We consider the following problem in which a given number of items has to be chosen from a predefined set. Each item is described by a vector of attributes and for each attribute there is a desired distribution that the selected set should…

Artificial Intelligence · Computer Science 2021-03-29 Jerome Lang , Piotr Skowron

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

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

A variant of Phragm\'en's method for proportional representation via approval voting is briefly explored. Instead of D'Hondt's rule, this variant generalizes Sainte-Lagu\"e's rule.

Optimization and Control · Mathematics 2016-11-22 Xavier Mora

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

Participatory budgeting is one of the exciting developments in deliberative grassroots democracy. We concentrate on approval elections and propose proportional representation axioms in participatory budgeting, by generalizing relevant…

Computer Science and Game Theory · Computer Science 2017-11-23 Haris Aziz , Barton Lee , Nimrod Talmon

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia