activity
20082026
most citedStable partitions in additively separable hedonic games

112 citations · 871 across the 84 of their papers we have counts for

collaborators

115 papers

cs.GT2026

The Team Order Problem: Maximizing the Probability of Matching Being Large Enough

Haris Aziz, Jiarui Gan, Grzegorz Lisowski +1

We consider a matching problem, which is meaningful in team competitions, as well as in information theory, recommender systems, and assignment problems. In the competitions which…

cs.GT2024★ 2 cited

Group Fairness in Peer Review

Haris Aziz, Evi Micha, Nisarg Shah

Large conferences such as NeurIPS and AAAI serve as crossroads of various AI fields, since they attract submissions from a vast number of communities. However, in some cases, this…

cs.DM2023

Computational complexity of -stable matchings

Haris Aziz, Gergely Csáji, Ágnes Cseh

We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a…

cs.LG2023

Proportionally Representative Clustering

Haris Aziz, Barton E. Lee, Sean Morota Chu +1

In recent years, there has been a surge in effort to formalize notions of fairness in machine learning. We focus on centroid clustering--one of the fundamental tasks in unsupervise…

cs.GT2023★ 3 cited

Best-of-Both-Worlds Fairness in Committee Voting

Haris Aziz, Xinhang Lu, Mashbat Suzuki +2

The best-of-both-worlds paradigm advocates an approach that achieves desirable properties both ex-ante and ex-post. We launch a best-of-both-worlds fairness perspective for the imp…

cs.GT2023

Matching Algorithms under Diversity-Based Reservations

Haris Aziz, Sean Morota Chu, Zhaohong Sun

Selection under category or diversity constraints is a ubiquitous and widely-applicable problem that is encountered in immigration, school choice, hiring, and healthcare rationing.…