Affiliation:
1. Yale University, New Haven, CT, USA
Abstract
An increasing amount of work studies fairness in socio-technical settings from a computational perspective. This work has introduced a variety of metrics to measure fairness in different settings. Most of these metrics, however, do not account for the interactions between individuals or evaluate any underlying network's effect on the outcomes measured. While a wide body of work studies the organization of individuals into a network structure and how individuals access resources in networks, the impact of network structure on fairness has been largely unexplored.
We introduce templates for group fairness metrics that account for network structure. More specifically, we present two types of group fairness metrics that measure distinct yet complementary forms of bias in networks. The first type of metric evaluates how access to others in the network is distributed across groups. The second type of metric evaluates how groups distribute their interactions across other groups, and hence captures inter-group biases. We find that ignoring the network can lead to spurious fairness evaluations by either not capturing imbalances in influence and reach illuminated by the first type of metric, or by overlooking interaction biases as evaluated by the second type of metric. Our empirical study illustrates these pronounced differences between network and non-network evaluations of fairness.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Human-Computer Interaction,Social Sciences (miscellaneous)
Reference90 articles.
1. William Aiello Fan R. K. Chung and Linyuan Lu. 2000. A random graph model for massive graphs. In STOC. ACM 171--180. William Aiello Fan R. K. Chung and Linyuan Lu. 2000. A random graph model for massive graphs. In STOC. ACM 171--180.
2. Junaid Ali Mahmoudreza Babaei Abhijnan Chakraborty Baharan Mirzasoleiman Krishna P. Gummadi and Adish Singla. 2019. On the Fairness of Time-Critical Influence Maximization in Social Networks. arXiv:1905.06618 [cs.SI] Junaid Ali Mahmoudreza Babaei Abhijnan Chakraborty Baharan Mirzasoleiman Krishna P. Gummadi and Adish Singla. 2019. On the Fairness of Time-Critical Influence Maximization in Social Networks. arXiv:1905.06618 [cs.SI]
3. Discrimination through Optimization
4. The Diversity-Bandwidth Trade-off
5. Sinan Aral and Dylan Walker . 2012. Identifying Influential and Susceptible Members of Social Networks. Science 337, 6092 (July 2012 ), 337--341. https://doi.org/10.1126/science.1215842 Publisher : American Association for the Advancement of Science Section: Report. 10.1126/science.1215842 Sinan Aral and Dylan Walker. 2012. Identifying Influential and Susceptible Members of Social Networks. Science 337, 6092 (July 2012), 337--341. https://doi.org/10.1126/science.1215842 Publisher: American Association for the Advancement of Science Section: Report.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献