Diverse Data Selection under Fairness Constraints

by   Zafeiria Moumoulidou, et al.

Diversity is an important principle in data selection and summarization, facility location, and recommendation systems. Our work focuses on maximizing diversity in data selection, while offering fairness guarantees. In particular, we offer the first study that augments the Max-Min diversification objective with fairness constraints. More specifically, given a universe U of n elements that can be partitioned into m disjoint groups, we aim to retrieve a k-sized subset that maximizes the pairwise minimum distance within the set (diversity) and contains a pre-specified k_i number of elements from each group i (fairness). We show that this problem is NP-complete even in metric spaces, and we propose three novel algorithms, linear in n, that provide strong theoretical approximation guarantees for different values of m and k. Finally, we extend our algorithms and analysis to the case where groups can be overlapping.


Streaming Algorithms for Diversity Maximization with Fairness Constraints

Diversity maximization is a fundamental problem with wide applications i...

Improved Approximation and Scalability for Fair Max-Min Diversification

Given an n-point metric space (𝒳,d) where each point belongs to one of m...

Balanced Ranking with Diversity Constraints

Many set selection and ranking algorithms have recently been enhanced wi...

Matchings Under Diversity Constraints

Matching problems with group fairness constraints have numerous applicat...

Fair and Diverse DPP-based Data Summarization

Sampling methods that choose a subset of the data proportional to its di...

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

We investigate the following many-to-one stable matching problem with di...

Improving Screening Processes via Calibrated Subset Selection

Many selection processes such as finding patients qualifying for a medic...