English
Related papers

Related papers: The Condorcet Principle for Multiwinner Elections:…

200 papers

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 consider the participatory budgeting problem where each of $n$ voters specifies additive utilities over $m$ candidate projects with given sizes, and the goal is to choose a subset of projects (i.e., a committee) with total size at most…

Computer Science and Game Theory · Computer Science 2026-01-07 Kamesh Munagala , Yiheng Shen , Kangning Wang

We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size $k$ is selected from a set of candidates based on voters' ordinal preferences. We assume that voters and candidates are embedded on a…

Computer Science and Game Theory · Computer Science 2026-02-18 Negar Babashah , Hasti Karimi , Masoud Seddighin , Golnoosh Shahkarami

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

Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-04-18 Dan Alistarh , Rati Gelashvili

Based on the generalized Routh-Hurwitz criterion, we propose a sufficient and necessary criterion for testing the stability of fractional-order linear systems with order {\alpha}{\in}[1,2), called the fractional-order Routh-Hurwitz…

Dynamical Systems · Mathematics 2022-02-22 Jing Yang , Xiaorong Hou , Yajun Li

A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…

Computer Science and Game Theory · Computer Science 2023-10-10 Damien Berriaud , Andrei Constantinescu , Roger Wattenhofer

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

An important desideratum in approval-based multiwinner voting is proportionality. We study the problem of reconfiguring proportional committees: given two proportional committees, is there a transition path that consists only of…

Computer Science and Game Theory · Computer Science 2025-04-22 Chris Dong , Fabian Frank , Jannik Peters , Warut Suksompong

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

We study the canonical fair clustering problem where each cluster is constrained to have close to population-level representation of each group. Despite significant attention, the salient issue of having incomplete knowledge about the group…

Machine Learning · Computer Science 2024-11-21 Sharmila Duppala , Juan Luque , John P. Dickerson , Seyed A. Esmaeili

We present a new model that describes the process of electing a group of representatives (e.g., a parliament) for a group of voters. In this model, called the voting committee model, the elected group of representatives runs a number of…

Multiagent Systems · Computer Science 2016-11-22 Piotr Skowron

We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…

Computer Science and Game Theory · Computer Science 2023-09-22 Martin Lackner , Piotr Skowron

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

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

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…

Theoretical Economics · Economics 2025-12-23 Hans Gersbach

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

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