Group-Fairness in Influence Maximization

Influence maximization is a widely used model for information dissemination in social networks. Recent work has employed such interventions across a wide range of social problems, spanning public health, substance abuse, and international development (to name a few examples). A critical but understudied question is whether the benefits of such interventions are fairly distributed across different groups in the population; e.g., avoiding discrimination with respect to sensitive attributes such as race or gender. Drawing on legal and game-theoretic concepts, we introduce formal definitions of fairness in influence maximization. We provide an algorithmic framework to find solutions which satisfy fairness constraints, and in the process improve the state of the art for general multi-objective submodular maximization problems. Experimental results on real data from an HIV prevention intervention for homeless youth show that standard influence maximization techniques oftentimes neglect smaller groups which contribute less to overall utility, resulting in a disparity which our proposed algorithms substantially reduce.

[1]  Renato Paes Leme,et al.  Tight Bounds for Approximate Carathéodory and Beyond , 2015, ICML.

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

[3]  Milind Tambe,et al.  Optimizing Network Structure for Preventative Health , 2018, AAMAS.

[4]  Jan Vondrák,et al.  Fast algorithms for maximizing submodular functions , 2014, SODA.

[5]  Haifeng Xu,et al.  Using Social Networks to Aid Homeless Shelters: Dynamic Influence Maximization under Uncertainty , 2016, AAMAS.

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

[7]  Rajan Udwani,et al.  Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint , 2017, NeurIPS.

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

[9]  Makoto Yokoo,et al.  Strategy-proof school choice mechanisms with minimum quotas and initial endowments , 2017, Artif. Intell..

[10]  Piotr Faliszewski,et al.  Multiwinner Elections with Diversity Constraints , 2017, AAAI.

[11]  Alexander Shapiro,et al.  Stochastic Approximation approach to Stochastic Programming , 2013 .

[12]  Lutz Priese,et al.  Fairness , 1988, Bull. EATCS.

[13]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[14]  Balaraman Ravindran,et al.  Near Optimal Strategies for Targeted Marketing in Social Networks , 2015, AAMAS.

[15]  Andrew D. Selbst,et al.  Big Data's Disparate Impact , 2016 .

[16]  Dimitris Bertsimas,et al.  Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation , 2013, Oper. Res..

[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]  Piotr Faliszewski,et al.  Multiwinner Voting: A New Challenge for Social Choice Theory , 2017 .

[19]  Yuchen Li,et al.  Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.

[20]  Milind Tambe,et al.  Bridging the Gap Between Theory and Practice in Influence Maximization: Raising Awareness about HIV among Homeless Youth , 2018, IJCAI.

[21]  Makoto Yokoo,et al.  Generalizing Envy-Freeness toward Group of Agents , 2011, IJCAI.

[22]  Nicole Immorlica,et al.  Maximizing Influence in an Unknown Social Network , 2018, AAAI.

[23]  Kamesh Munagala,et al.  Fair Allocation of Indivisible Public Goods , 2018, EC.

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

[25]  Y. Narahari,et al.  Groupwise Maximin Fair Allocation of Indivisible Goods , 2017, AAAI.

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

[27]  Andreas Krause,et al.  Stochastic Submodular Maximization: The Case of Coverage Functions , 2017, NIPS.

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

[29]  T. Valente,et al.  Identifying Opinion Leaders to Promote Behavior Change , 2007, Health education & behavior : the official publication of the Society for Public Health Education.

[30]  Hong-Han Shuai,et al.  Maximizing Social Influence on Target Users , 2018, PAKDD.

[31]  Amin Karbasi,et al.  Gradient Methods for Submodular Maximization , 2017, NIPS.

[32]  Milind Tambe,et al.  End-to-End Influence Maximization in the Field , 2018, AAMAS.

[33]  Grigorios Loukides,et al.  Limiting the Influence to Vulnerable Users in Social Networks: A Ratio Perspective , 2019, AINA.

[34]  Arun G. Chandrasekhar,et al.  The Diffusion of Microfinance , 2012, Science.

[35]  H. B. McMahan,et al.  Robust Submodular Observation Selection , 2008 .

[36]  Edith Cohen,et al.  Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

[37]  Jeffrey S. Foster,et al.  The Diverse Cohort Selection Problem: Multi-Armed Bandits with Varied Pulls , 2017, ArXiv.