English
Related papers

Related papers: Algorithmics of Egalitarian versus Equitable Seque…

200 papers

We study the problem of allocating a set of indivisible goods to multiple agents. Recent work [Bouveret and Lang, 2011] focused on allocating goods in a sequential way, and studied what is the "best" sequence of agents to pick objects based…

Multiagent Systems · Computer Science 2014-05-27 Wei Huang , Jian Lou , Zhonghua Wen

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

Building fair recommender systems is a challenging and crucial area of study due to its immense impact on society. We extended the definitions of two commonly accepted notions of fairness to recommender systems, namely equality of…

Machine Learning · Statistics 2022-08-12 Preetam Nandy , Cyrus Diciccio , Divya Venugopalan , Heloise Logan , Kinjal Basu , Noureddine El Karoui

Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirability of a committee, Pareto optimality is a minimal and…

Computer Science and Game Theory · Computer Science 2018-03-20 Haris Aziz , Jerome Lang , Jerome Monnot

Committee decisions are complicated by a deadline, e.g., the next start of a budget, or the beginning of a semester. In committee hiring decisions, it may be that if no candidate is supported by a strong majority, the default is to hire no…

Computers and Society · Computer Science 2024-01-09 Marina Bannikova , Lihi Dery , Svetlana Obraztsova , Zinovi Rabinovich , Jeffrey S. Rosenschein

The sequential allocation protocol is a simple and popular mechanism to allocate indivisible goods, in which the agents take turns to pick the items according to a predefined sequence. While this protocol is not strategy-proof, it has been…

Computer Science and Game Theory · Computer Science 2019-11-27 Michele Flammini , Hugo Gilbert

We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of…

Discrete Mathematics · Computer Science 2021-06-01 Klaus Heeger , Danny Hermelin , George B. Mertzios , Hendrik Molter , Rolf Niedermeier , Dvir Shabtay

In many institutional settings, $k$ items are selected with the goal of representing the underlying distribution of claims, opinions, or characteristics in a large population. We study environments with two adversarial parties whose…

Theoretical Economics · Economics 2026-03-27 Alma Cohen , Alon Klement , Zvika Neeman , Eilon Solan

We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same group share the same set of goods even though they may have different preferences. Previous work has focused on unanimous fairness, in which…

Computer Science and Game Theory · Computer Science 2020-01-01 Erel Segal-Halevi , Warut Suksompong

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

A population of committees of agents that learn by using neural networks is implemented to simulate the stock market. Each committee of agents, which is regarded as a player in a game, is optimised by continually adapting the architecture…

Multiagent Systems · Computer Science 2007-05-23 T. Marwala , P. De Wilde , L. Correia , P. Mariano , R. Ribeiro , V. Abramov , N. Szirbik , J. Goossenaerts

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

Artificial Intelligence · Computer Science 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the…

Computer Science and Game Theory · Computer Science 2022-05-25 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for…

Computer Science and Game Theory · Computer Science 2025-08-06 Zack Fitzsimmons , Zohair Raza Hassan , Edith Hemaspaandra

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

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

Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alternatives (or at least a winning alternative) is produced.…

Computer Science and Game Theory · Computer Science 2014-01-16 Vincent Conitzer

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

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters