English
Related papers

Related papers: Group Fairness in Committee Selection

200 papers

Team assembly is a problem that demands trade-offs between multiple fairness criteria and computational optimization. We focus on four criteria: (i) fair distribution of workloads within the team, (ii) fair distribution of skills and…

Databases · Computer Science 2023-06-27 Rodrigo Borges , Otto Sahlgrens , Sami Koivunen , Kostas Stefanidis , Thomas Olsson , Arto Laitinen

Rankings of people and items has been highly used in selection-making, match-making, and recommendation algorithms that have been deployed on ranging of platforms from employment websites to searching tools. The ranking position of a…

Social and Information Networks · Computer Science 2021-03-03 Akrati Saxena , George Fletcher , Mykola Pechenizkiy

Consider the stable matching problem on two sets. We introduce the concept of a preference cycle and show how its natural presence in stable matchings proves a series of classical results in an elementary way.

Discrete Mathematics · Computer Science 2018-04-19 Andrei Ciupan

We focus on the one-to-one two-sided matching model with two disjoint sets of agents of equal size, where each agent in a set has preferences on the agents in the other set modeled by a linear order. A matching mechanism associates a set of…

Theoretical Economics · Economics 2024-11-27 Daniela Bubboloni , Michele Gori , Claudia Meo

The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from…

Artificial Intelligence · Computer Science 2016-11-25 Maria Silvia Pini , Francesca Rossi , Brent Venable , Toby Walsh

Electing a committee of size k from m alternatives (k < m) is an interesting problem under the multi-winner voting rules. However, very few committee selection rules found in the literature consider the coalitional possibilities among the…

Theoretical Economics · Economics 2023-08-08 Ritu Dutta , Rajnish Kumnar , Surajit Borkotokey

In this work, we define and solve the Fair Top-k Ranking problem, in which we want to determine a subset of k candidates from a large pool of n >> k candidates, maximizing utility (i.e., select the "best" candidates) subject to group…

Computers and Society · Computer Science 2018-07-03 Meike Zehlike , Francesco Bonchi , Carlos Castillo , Sara Hajian , Mohamed Megahed , Ricardo Baeza-Yates

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

This paper studies algorithmic fairness when the protected attribute is location. To handle protected attributes that are continuous, such as age or income, the standard approach is to discretize the domain into predefined groups, and…

Machine Learning · Computer Science 2023-02-27 Dimitris Sacharidis , Giorgos Giannopoulos , George Papastefanatos , Kostas Stefanidis

In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…

Computer Science and Game Theory · Computer Science 2024-04-29 Rasoul Ramezanian

A population of voters must elect representatives among themselves to decide on a sequence of possibly unforeseen binary issues. Voters care only about the final decision, not the elected representatives. The disutility of a voter is…

Computer Science and Game Theory · Computer Science 2020-06-16 Reshef Meir , Fedor Sandomirskiy , Moshe Tennenholtz

We argue that an imperfect criminal law procedure cannot be group-fair, if 'group fairness' involves ensuring the same chances of acquittal or convictions to all innocent defendants independently of their morally arbitrary features. We show…

Computers and Society · Computer Science 2022-02-09 Nicolò Cangiotti , Michele Loi

Stability selection is a widely adopted resampling-based framework for high-dimensional variable selection. This paper seeks to broaden the use of an established stability estimator to evaluate the overall stability of the stability…

Methodology · Statistics 2025-06-04 Mahdi Nouraie , Samuel Muller

Motivated by data on coauthorships in scientific publications, we analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different…

Theoretical Economics · Economics 2022-11-29 Leonardo Boncinelli , Alessio Muscillo , Paolo Pin

In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…

Computer Science and Game Theory · Computer Science 2025-11-10 Jonathan Shaki , Jiarui Gan , Sarit Kraus

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2)…

Artificial Intelligence · Computer Science 2018-04-02 Haris Aziz

Various measures can be used to estimate bias or unfairness in a predictor. Previous work has already established that some of these measures are incompatible with each other. Here we show that, when groups differ in prevalence of the…

Applications · Statistics 2017-09-13 Thomas Miconi

We examine a controlled school choice model where students are categorized into different types, and the distribution of these types within a school influences its priority structure. This study provides a general framework that integrates…

Theoretical Economics · Economics 2025-03-25 Minoru Kitahara , Yasunori Okumura

Stability is crucial in matching markets, yet in many real-world settings - from hospital residency allocations to roommate assignments - full stability is either impossible to achieve or can come at the cost of leaving many agents…

Computer Science and Game Theory · Computer Science 2026-01-21 Frederik Glitzner , David Manlove

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
‹ Prev 1 4 5 6 7 8 10 Next ›