Revisiting Group Fairness Metrics: The Effect of Networks

Author:

Mehrotra Anay1,Sachs Jeff1,Celis L. Elisa1

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.

Funder

AWS

NSF

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Intervening to Increase Community Trust for Fair Network Outcomes;The 2024 ACM Conference on Fairness, Accountability, and Transparency;2024-06-03

2. AI Fairness in Data Management and Analytics: A Review on Challenges, Methodologies and Applications;Applied Sciences;2023-09-13

3. Reducing Access Disparities in Networks using Edge Augmentation✱;2023 ACM Conference on Fairness, Accountability, and Transparency;2023-06-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3