Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.17736 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913670406078464 |
|---|---|
| author | Chowdhary, Shubham De Pasquale, Giulia Lanzetti, Nicolas Stoica, Ana-Andreea Dorfler, Florian |
| author_facet | Chowdhary, Shubham De Pasquale, Giulia Lanzetti, Nicolas Stoica, Ana-Andreea Dorfler, Florian |
| contents | We study fairness in social influence maximization, whereby one seeks to select seeds that spread a given information throughout a network, ensuring balanced outreach among different communities (e.g. demographic groups). In the literature, fairness is often quantified in terms of the expected outreach within individual communities. In this paper, we demonstrate that such fairness metrics can be misleading since they overlook the stochastic nature of information diffusion processes. When information diffusion occurs in a probabilistic manner, multiple outreach scenarios can occur. As such, outcomes such as ``In 50% of the cases, no one in group 1 gets the information, while everyone in group 2 does, and in the other 50%, it is the opposite'', which always results in largely unfair outcomes, are classified as fair by a variety of fairness metrics in the literature. We tackle this problem by designing a new fairness metric, mutual fairness, that captures variability in outreach through optimal transport theory. We propose a new seed-selection algorithm that optimizes both outreach and mutual fairness, and we show its efficacy on several real datasets. We find that our algorithm increases fairness with only a minor decrease (and at times, even an increase) in efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_17736 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fairness in Social Influence Maximization via Optimal Transport Chowdhary, Shubham De Pasquale, Giulia Lanzetti, Nicolas Stoica, Ana-Andreea Dorfler, Florian Social and Information Networks Computers and Society Combinatorics We study fairness in social influence maximization, whereby one seeks to select seeds that spread a given information throughout a network, ensuring balanced outreach among different communities (e.g. demographic groups). In the literature, fairness is often quantified in terms of the expected outreach within individual communities. In this paper, we demonstrate that such fairness metrics can be misleading since they overlook the stochastic nature of information diffusion processes. When information diffusion occurs in a probabilistic manner, multiple outreach scenarios can occur. As such, outcomes such as ``In 50% of the cases, no one in group 1 gets the information, while everyone in group 2 does, and in the other 50%, it is the opposite'', which always results in largely unfair outcomes, are classified as fair by a variety of fairness metrics in the literature. We tackle this problem by designing a new fairness metric, mutual fairness, that captures variability in outreach through optimal transport theory. We propose a new seed-selection algorithm that optimizes both outreach and mutual fairness, and we show its efficacy on several real datasets. We find that our algorithm increases fairness with only a minor decrease (and at times, even an increase) in efficiency. |
| title | Fairness in Social Influence Maximization via Optimal Transport |
| topic | Social and Information Networks Computers and Society Combinatorics |
| url | https://arxiv.org/abs/2406.17736 |