Maximizing coverage while ensuring fairness: a tale of conflicting objective

by   Abolfazl Asudeh, et al.

Ensuring fairness in computational problems has emerged as a key topic during recent years, buoyed by considerations for equitable resource distributions and social justice. It is possible to incorporate fairness in computational problems from several perspectives, such as using optimization, game-theoretic or machine learning frameworks. In this paper we address the problem of incorporation of fairness from a combinatorial optimization perspective. We formulate a combinatorial optimization framework, suitable for analysis by researchers in approximation algorithms and related areas, that incorporates fairness in maximum coverage problems as an interplay between two conflicting objectives. Fairness is imposed in coverage by using coloring constraints that minimizes the discrepancies between number of elements of different colors covered by selected sets; this is in contrast to the usual discrepancy minimization problems studied extensively in the literature where (usually two) colors are not given a priori but need to be selected to minimize the maximum color discrepancy of each individual set. Our main results are a set of randomized and deterministic approximation algorithms that attempts to simultaneously approximate both fairness and coverage in this framework.


page 1

page 2

page 3

page 4


Fair Correlation Clustering

In this paper, we study correlation clustering under fairness constraint...

Fair Disaster Containment via Graph-Cut Problems

Graph cut problems form a fundamental problem type in combinatorial opti...

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints

Metric clustering is fundamental in areas ranging from Combinatorial Opt...

Streaming Algorithms for Diversity Maximization with Fairness Constraints

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

Maximum n-times Coverage for COVID-19 Vaccine Design

In the maximum n-times coverage problem, we are provided a set of elemen...

On λ-backbone coloring of cliques with tree backbones in linear time

A λ-backbone coloring of a graph G with its subgraph (also called a back...

Fairness in Influence Maximization through Randomization

The influence maximization paradigm has been used by researchers in vari...