2000 character limit reached
Fair Set Cover
Published 19 May 2024 in cs.DS | (2405.11639v3)
Abstract: The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in computer science is Set Cover, which has numerous applications with societal impacts, such as assembling a small team of individuals that collectively satisfy a range of expertise requirements. However, despite its broad application spectrum and significant potential impact, set cover has yet to be studied through the lens of fairness. Therefore, in this paper, we introduce Fair Set Cover, which aims not only to cover with a minimum-size set but also to satisfy demographic parity in its selection of sets. To this end, we develop multiple versions of fair set cover, study their hardness, and devise efficient approximation algorithms for each variant. Notably, under certain assumptions, our algorithms always guarantee zero-unfairness, with only a small increase in the approximation ratio compared to regular set cover. Furthermore, our experiments on various data sets and across different settings confirm the negligible price of fairness, as (a) the output size increases only slightly (if any) and (b) the time to compute the output does not significantly increase.
- Maximizing coverage while ensuring fairness: A tale of conflicting objectives. Algorithmica 85, 5 (2023), 1287–1331.
- Designing fair ranking schemes. In Proceedings of the 2019 international conference on management of data. 1259–1276.
- Optimum experimental designs, with SAS. Vol. 34. OUP Oxford.
- On fair covering and hitting problems. In Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers 47. Springer, 39–51.
- Fairness in machine learning. Nips tutorial 1 (2017), 2017.
- Fairness and machine learning: Limitations and opportunities. MIT Press.
- Reducing Access Disparities in Networks using Edge Augmentation. In Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency. 1635–1651.
- VÃctor Blanco and Ricardo Gázquez. 2023. Fairness in maximal covering location problems. Computers & Operations Research 157 (2023), 106287.
- Moses Charikar and Rina Panigrahy. 2001. Clustering to minimize the sum of cluster diameters. In Proceedings of the thirty-third annual ACM symposium on Theory of computing. 1–10.
- Chapter 5: Network biology approach to complex diseases. PLoS computational biology 8, 12 (2012), e1002820.
- Analysis and simulation of a fair queueing algorithm. ACM SIGCOMM Computer Communication Review 19, 4 (1989), 1–12.
- Approximation algorithms for clustering to minimize the sum of diameters. In Scandinavian Workshop on Algorithm Theory. Springer, 237–250.
- Kate Donahue and Jon Kleinberg. 2020. Fairness and utilization in allocating resources with uncertain demand. In Proceedings of the 2020 conference on fairness, accountability, and transparency. 658–668.
- Rawlsian fairness in online bipartite matching: Two-sided, group, and individual. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37. 5624–5632.
- David GarcÃa-Soriano and Francesco Bonchi. 2020. Fair-by-design matching. Data Mining and Knowledge Discovery 34 (2020), 1291–1335.
- Xun Ge. 2010. An application of covering approximation spaces on network security. Computers & Mathematics with Applications 60, 5 (2010), 1191–1199.
- Pierre Hansen and Brigitte Jaumard. 1997. Cluster analysis and mathematical programming. Mathematical programming 79, 1-3 (1997), 191–215.
- The black: white disparity in breast cancer mortality: the example of Chicago. Cancer Causes & Control 18 (2007), 323–333.
- Fixed-Parameter Algorithms for Fair Hitting Set Problems. In 48th International Symposium on Mathematical Foundations of Computer Science.
- Rawlsian fairness in push and pull supply chains. European Journal of Operational Research 291, 1 (2021), 194–205.
- Fair k-centers via maximum matching. In International conference on machine learning. PMLR, 4940–4949.
- A center in your neighborhood: Fairness in facility location. arXiv preprint arXiv:1908.09041 (2019).
- Inherent trade-offs in the fair determination of risk scores. arXiv preprint arXiv:1609.05807 (2016).
- Fair k-center clustering for data summarization. In International Conference on Machine Learning. PMLR, 3448–3457.
- Yuan Ma and Jiping Zheng. 2021. Fair Regret Minimization Queries. In International Conference on Intelligent Data Engineering and Automated Learning. Springer, 511–523.
- Yury Makarychev and Ali Vakilian. 2021. Approximation algorithms for socially fair clustering. In Conference on Learning Theory. PMLR, 3246–3264.
- Chantelle Marcelle. [n. d.]. Analysis of Influencer Marketing and Social Media Diversity Reflects Visual Bias. chantellemarcelle.com/influencer-marketing-reflects-social-media-diversity-issue/.
- Trade-offs between group fairness metrics in societal resource allocation. In Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency. 1095–1105.
- A survey on bias and fairness in machine learning. ACM computing surveys (CSUR) 54, 6 (2021), 1–35.
- Clyde Monma and Subhash Suri. 1989. Partitioning points and graphs to minimize the maximum or the sum of diameters. In Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs), Vol. 2. 899–912.
- Dana Pessach and Erez Shmueli. 2022. A review on fairness in machine learning. ACM Computing Surveys (CSUR) 55, 3 (2022), 1–44.
- Applications of the location set-covering problem. Geographical analysis 8, 1 (1976), 65–76.
- Jerrold Rubin. 1973. A technique for the solution of massive set covering problems, with application to airline crew scheduling. Transportation Science 7, 1 (1973), 34–48.
- Mallory Simon. 2009. HP looking into claim webcams can’t see black people. CNN.
- Maximizing fair content spread via edge suggestion in social networks. Proceedings of the VLDB Endowment 15, 11 (2022), 2692–2705.
- Diversity-aware k-median: Clustering with fair center representation. In Machine Learning and Knowledge Discovery in Databases. Research Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13–17, 2021, Proceedings, Part II 21. Springer, 765–780.
- Tess Townsend. 2017. Most engineers are white and so are the faces they use to train software. Recode.
- Group-fairness in influence maximization. arXiv preprint arXiv:1903.00967 (2019).
- Rao R Vemuganti. 1998. Applications of set covering, set packing and set partitioning models: A survey. Handbook of Combinatorial Optimization: Volume1–3 (1998), 573–746.
- Amanda Vinicky. 2022. While a Black-Owned Cannabis Dispensary Opens in Chicago, Critics Say State’s Equity Work Still Falling Short. WTTW.
- Balancing Utility and Fairness in Submodular Maximization (Technical Report). arXiv preprint arXiv:2211.00980 (2022).
- An experimental survey of regret minimization query and variants: bridging the best worlds between top-k query and skyline query. The VLDB Journal 29, 1 (2020), 147–175.
- Rui Xu and Donald Wunsch. 2005. Survey of clustering algorithms. IEEE Transactions on neural networks 16, 3 (2005), 645–678.
- Neal E Young. 2008. Greedy set-cover algorithms (1974-1979, chvátal, johnson, lovász, stein). Encyclopedia of algorithms (2008), 379–381.
- Fa* ir: A fair top-k ranking algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1569–1578.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.