Maximizing coverage while ensuring fairness: a tale of conflicting objective release_5bg6htqwrzd7hbmrzeopm7s2m4

by Abolfazl Asudeh and Tanya Berger-Wolf and Bhaskar DasGupta and Anastasios Sidiropoulos

Released as a article .

2020  

Abstract

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 combinatorialoptimization 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 apriori 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.
In text/plain format

Archived Files and Locations

application/pdf  523.1 kB
file_zeybkijk6rdethjzsshby32tue
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-07-16
Version   v1
Language   en ?
arXiv  2007.08069v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 67067ee4-678d-418a-93e2-a58918728c3b
API URL: JSON