English
Related papers

Related papers: Axiomatic Characterization of Committee Scoring Ru…

200 papers

In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all…

Computer Science and Game Theory · Computer Science 2019-05-14 Yu Cheng , Zhihao Jiang , Kamesh Munagala , Kangning Wang

We study approval-based committee voting in which a target number of candidates are selected based on voters' approval preferences over candidates. In contrast to most of the work, we consider the setting where voters express uncertain…

Computer Science and Game Theory · Computer Science 2024-07-30 Hariz Aziz , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

It is common that a jury must grade a set of candidates in a cardinal scale such as {1,2,3,4,5} or an ordinal scale such as {Great, Good, Average, Bad }. When the number of candidates is very large such as hotels (BOOKING), restaurants…

Computer Science and Game Theory · Computer Science 2023-02-24 Rida Laraki , Estelle Varloot

We study the task of electing egalitarian sequences of $\tau$ committees given a set of agents with additive utilities for candidates available on each of $\tau$ levels. We introduce several rules for electing an egalitarian committee…

Computer Science and Game Theory · Computer Science 2025-08-21 Paula Böhm , Robert Bredereck , Till Fluschnik

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Artificial Intelligence · Computer Science 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

As the world's democratic institutions are challenged by dissatisfied citizens, political scientists and also computer scientists have proposed and analyzed various (innovative) methods to select representative bodies, a crucial task in…

Multiagent Systems · Computer Science 2023-04-07 Manon Revel , Niclas Boehmer , Rachael Colley , Markus Brill , Piotr Faliszewski , Edith Elkind

We study two-stage committee elections where voters have dynamic preferences over candidates; at each stage, a committee is chosen under a given voting rule. We are interested in identifying a winning committee for the second stage that…

Computer Science and Game Theory · Computer Science 2024-08-21 Valentin Zech , Niclas Boehmer , Edith Elkind , Nicholas Teh

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

Categorization axioms have been proposed to axiomatizing clustering results, which offers a hint of bridging the difference between human recognition system and machine learning through an intuitive observation: an object should be assigned…

Machine Learning · Computer Science 2016-01-18 Jian Yu

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

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Logic · Mathematics 2023-05-18 Saeed Salehi

Drafts are sequential round-robin allocation procedures for distributing heterogeneous and indivisible objects among agents subject to some priority order (e.g., allocating players' contract rights to teams in professional sports leagues).…

Theoretical Economics · Economics 2026-04-09 Jacob Coreno , Ivan Balbuzanov

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

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 define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the…

Computer Science and Game Theory · Computer Science 2023-01-27 Théo Delemazure , Jérôme Lang , Jean-François Laslier , Remzi M. Sanver

We study three axioms in the model of constrained social choice under uncertainty where (i) agents have subjective expected utility preferences over acts and (ii) different states of nature have (possibly) different sets of available…

Theoretical Economics · Economics 2024-08-05 Eric Bahel

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

Computer Science and Game Theory · Computer Science 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

A primary challenge in collective decision-making is that achieving unanimous agreement is difficult, even at the level of criteria. The history of social choice theory illustrates this: numerous normative criteria on voting rules have been…

Theoretical Economics · Economics 2026-01-23 Takahiro Suzuki , Stefano Moretti , Michele Aleandri

The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee of size k that has a Chamberlin-Courant (respectively,…

Data Structures and Algorithms · Computer Science 2020-04-30 Chinmay Sonar , Palash Dey , Neeldhara Misra

We present a new model of collective decision making that captures important crowd-funding and donor coordination scenarios. In the setting, there is a set of projects (each with its own cost) and a set of agents (that have their budgets as…

Computer Science and Game Theory · Computer Science 2021-01-29 Haris Aziz , Aditya Ganguly