Group-Fairness in Influence Maximization
Abstract
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.
Cite
Text
Tsang et al. "Group-Fairness in Influence Maximization." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/831Markdown
[Tsang et al. "Group-Fairness in Influence Maximization." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/tsang2019ijcai-group/) doi:10.24963/IJCAI.2019/831BibTeX
@inproceedings{tsang2019ijcai-group,
title = {{Group-Fairness in Influence Maximization}},
author = {Tsang, Alan and Wilder, Bryan and Rice, Eric and Tambe, Milind and Zick, Yair},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {5997-6005},
doi = {10.24963/IJCAI.2019/831},
url = {https://mlanthology.org/ijcai/2019/tsang2019ijcai-group/}
}