Reachability-aware fair influence maximization

Publication Type

Conference Proceeding Article

Publication Date

8-2024

Abstract

How can we ensure that an information dissemination campaign reaches every corner of society and also achieves high overall reach? The problem of maximizing the spread of influence over a social network has commonly been considered with an aggregate objective. Less attention has been paid to achieving equality of opportunity, reducing information barriers, and ensuring that everyone in the network has a fair chance to be reached. To that end, the fairness objective aims to maximize the minimum probability of reaching an individual. To address this inapproximable problem, past research has proposed heuristics, which, however, perform less well when the promotion budget is low and achieve fairness at the expense of overall welfare. In this paper, we propose novel reachability-aware algorithms for the fairness-oriented IM problem. Our experimental study shows that our algorithms outperform past work in challenging real-world problem instances by up to a factor of 4 in terms of the fairness objective and strike a balance between fairness and total welfare, even while no solution is universally superior across data, influence probability models, and propagation models.

Keywords

Reachability-aware algorithm, Information dissemination

Discipline

Artificial Intelligence and Robotics

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 8th APWeb-WAIM Joint International Conference on Web and Big Data (APWeb-WAIM 2024) : Jinhua, China, August 30 – September 1

First Page

342

Last Page

359

Identifier

10.1007/978-981-97-7238-4_22

Publisher

Springer

City or Country

Jinhua, China

Additional URL

https://doi.org/10.1007/978-981-97-7238-4_22

This document is currently not available here.

Share

COinS