Exploring Algorithmic Fairness in Robust Graph Covering Problems

Fueled by algorithmic advances, AI algorithms are increasingly being deployed in settings subject to unanticipated challenges with complex social effects. Motivated by real-world deployment of AI driven, social-network based suicide prevention and landslide risk management interventions, this paper focuses on a robust graph covering problem subject to group fairness constraints. We show that, in the absence of fairness constraints, state-of-the-art algorithms for the robust graph covering problem result in biased node coverage: they tend to discriminate individuals (nodes) based on membership in traditionally marginalized groups. To remediate this issue, we propose a novel formulation of the robust covering problem with fairness constraints and a tractable approximation scheme applicable to real world instances. We provide a formal analysis of the price of group fairness (PoF) for this problem, where we show that uncertainty can lead to greater PoF. We demonstrate the effectiveness of our approach on several real-world social networks. Our method yields competitive node coverage while significantly improving group fairness relative to state-of-the-art methods.

[1]  M. Jackson,et al.  An Economic Model of Friendship: Homophily, Minorities and Segregation , 2007 .

[2]  Vahab S. Mirrokni,et al.  Fair Resource Allocation in A Volatile Marketplace , 2016, EC.

[3]  Che Hassandi Abdullah,et al.  Public Awareness and Education Programme for Landslide Management and Evaluation Using a Social Research Approach to Determining “Acceptable Risk” and “Tolerable Risk” in Landslide Risk Areas in Malaysia (IPL-194, IPL-207) , 2017 .

[4]  James B. Orlin,et al.  Robust monotone submodular function maximization , 2018, Math. Program..

[5]  Kaname Miyagishima Fair criteria for social decisions under uncertainty , 2019, Journal of Mathematical Economics.

[6]  Daniel Kuhn,et al.  K-Adaptability in Two-Stage Robust Binary Programming , 2015, Oper. Res..

[7]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[8]  Dick den Hertog,et al.  Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set , 2016, INFORMS J. Comput..

[9]  Dick den Hertog,et al.  A survey of adjustable robust optimization , 2019, Eur. J. Oper. Res..

[10]  Mark Fuge,et al.  Diverse Weighted Bipartite b-Matching , 2017, IJCAI.

[11]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[12]  Jean Walrand,et al.  Lecture Notes on Probability Theory and Random Processes , 2014 .

[13]  Iain Dunning,et al.  Multistage Robust Mixed-Integer Optimization with Adaptive Partitions , 2016, Oper. Res..

[14]  Volkan Cevher,et al.  Robust Submodular Maximization: A Non-Uniform Partitioning Approach , 2017, ICML.

[15]  Daniel Kuhn,et al.  Decision rules for information discovery in multi-stage stochastic programming , 2011, IEEE Conference on Decision and Control and European Control Conference.

[16]  Constantine Caramanis,et al.  Theory and Applications of Robust Optimization , 2010, SIAM Rev..

[17]  Jan Vondrák,et al.  Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[18]  Julie A. Shah,et al.  Fairness in Multi-Agent Sequential Decision-Making , 2014, NIPS.

[19]  Dimitris Bertsimas,et al.  Binary decision rules for multistage adaptive mixed-integer optimization , 2018, Math. Program..

[20]  Eric Rice,et al.  Group-Fairness in Influence Maximization , 2019, IJCAI.

[21]  Eric Rice,et al.  Sociometric network structure and its association with methamphetamine use norms among homeless youth. , 2016, Social science research.

[22]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[23]  D. Bertsimas,et al.  Data-driven learning in dynamic pricing using adaptive optimization , 2014 .

[24]  Dimitris Bertsimas,et al.  The Price of Fairness , 2011, Oper. Res..

[25]  S. Fienberg,et al.  Categorical Data Analysis of Single Sociometric Relations , 1981 .

[26]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[27]  Danah Boyd,et al.  Gaps in Information Access in Social Networks? , 2019, WWW.

[28]  Phebe Vayanos,et al.  Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making , 2019, AAAI.

[29]  George J. Pappas,et al.  Resilient monotone submodular function maximization , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[30]  Eric Rice,et al.  Designing Fair, Efficient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources , 2018, CPAIOR.

[31]  Dimitris Bertsimas,et al.  Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization , 2015, Oper. Res..

[32]  Sanmay Das,et al.  Allocating Interventions Based on Predicted Outcomes: A Case Study on Homelessness Services , 2019, AAAI.

[33]  Milind Tambe,et al.  A Robust Optimization Approach to Designing Near-Optimal Strategies for Constant-Sum Monitoring Games , 2018, GameSec.

[34]  Christopher Jung,et al.  Fair Algorithms for Learning in Allocation Problems , 2018, FAT.

[35]  Dan W. Brockt,et al.  The Theory of Justice , 2017 .

[36]  Yair Zick,et al.  Diversity Constraints in Public Housing Allocation , 2017, AAMAS.

[37]  Pasin Manurangsi,et al.  The Price of Fairness for Indivisible Goods , 2019, Theory of Computing Systems.

[38]  Vincent Conitzer,et al.  Group Fairness for the Allocation of Indivisible Goods , 2019, AAAI.

[39]  Jitender Sareen,et al.  Gatekeeper Training as a Preventative Intervention for Suicide: A Systematic Review , 2009, Canadian journal of psychiatry. Revue canadienne de psychiatrie.

[40]  Warut Suksompong,et al.  Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..

[41]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[42]  Han Yu,et al.  Robust Optimization with Decision-Dependent Information Discovery , 2020, 2004.08490.

[43]  Michael Poss,et al.  Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty , 2019, Eur. J. Oper. Res..

[44]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[45]  Erel Segal-Halevi,et al.  Democratic fair allocation of indivisible goods , 2019, Artif. Intell..

[46]  Constantine Caramanis,et al.  Finite Adaptability in Multistage Linear Optimization , 2010, IEEE Transactions on Automatic Control.

[47]  E. Polak Introduction to linear and nonlinear programming , 1973 .

[48]  A. Frieze,et al.  Introduction to Random Graphs , 2016 .