Fairness of Information Flow in Social Networks

Author:

Jalali Zeinab S.1ORCID,Chen Qilan1ORCID,Srikanta Shwetha M.1ORCID,Wang Weixiang1ORCID,Kim Myunghwan2ORCID,Raghavan Hema2ORCID,Soundarajan Sucheta1ORCID

Affiliation:

1. Syracuse University, Syracuse, NY

2. Kumo.AI, Mountain View, California

Abstract

Social networks form a major parts of people’s lives, and individuals often make important life decisions based on information that spreads through these networks. For this reason, it is important to know whether individuals from different protected groups have equal access to information flowing through a network. In this article, we define the Information Unfairness (IUF) metric, which quantifies inequality in access to information across protected groups. We then introduce MinIUF , an algorithm for reducing inequalities in information flow by adding edges to the network. Finally, we provide an in-depth analysis of information flow with respect to an attribute of interest, such as gender, across different types of networks to evaluate whether the structure of these networks allows groups to equally access information flowing in the network. Moreover, we investigate the causes of unfairness in such networks and how it can be improved.

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Efficient Maximum Relative Fair Clique Computation in Attributed Graphs;Lecture Notes in Computer Science;2023-11-07

2. Data Context-Aware Web Information Retrieval;2023 XLIX Latin American Computer Conference (CLEI);2023-10-16

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