Fairness in Influence Maximization through Randomization

DOI10.1613/jair.1.13367OpenAlexW3174834916MaRDI QIDQ5076357

Sajjad Ghobadi, Gianlorenzo D'Angelo, Ruben Becker, Hugo Gilbert

Publication date: 16 May 2022

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.03438

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Budget-feasible mechanisms for proportionally selecting agents from groups ⋮ Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling

Uses Software

• NetworkX
• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A solution to the random assignment problem on the full preference domain
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Strategyproof mechanisms for competitive influence in networks
• On Popular Random Assignments
• Statistical mechanics of complex networks
• A threshold of ln n for approximating set cover
• Consistent Probabilistic Social Choice
• Algorithmics of Matching Under Preferences
• Maximizing Social Influence in Nearly Optimal Time
• A new solution to the random assignment problem.

This page was built for publication: Fairness in Influence Maximization through Randomization