Robust Fair Influence Maximization under Multiple Community Partitions
Summary: Robust FIM over multiple candidate community partitions/fairness settings, optimizing worst-case normalized fairness objective rather than a single given partition. Hardness is near-unconditional; bicriteria approximation via submodular saturation, with S-HIST/SG-HIST instantiations achieving robust near-(1-1/e) performance. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Tianyou Gao (Kyoto University)
- 2. Takayuki Ito (Kyoto University)
BibTeX Citation
@inproceedings{gao_sigmod26,
title = {{Robust Fair Influence Maximization under Multiple Community Partitions}},
author = {Gao, Tianyou and Ito, Takayuki},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786692},
url = {https://dl.acm.org/doi/10.1145/3786692},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 194 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.000259047 |
| 315 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD | 0.00021436156 |
| 453 | Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks | 2016 | SIGMOD | 0.00018145895 |
| 1,478 | Online Processing Algorithms for Influence Maximization | 2018 | SIGMOD | 0.00010651983 |
| 2,320 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD | 8.7576221e-05 |
| 2,547 | From Competition to Complementarity: Comparative Influence Diffusion and Maximization | 2016 | VLDB | 8.4331576e-05 |
| 5,920 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD | 6.0418521e-05 |
| 8,913 | Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee | 2024 | SIGMOD | 5.3483178e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,409 | Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach | 2023 | SIGMOD |
| 2 | 296 | A Data-Based Approach to Social Influence Maximization | 2012 | VLDB |
| 3 | 3,962 | Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach | 2015 | SIGMOD |
| 4 | 10,611 | Augmenting Social Influence of Uncertain Seeds via Probabilistic Link Insertion | 2026 | VLDB |
| 5 | 1,919 | Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models | 2016 | SIGMOD |
| 6 | 5,920 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD |
| 7 | 4,804 | Efficient Algorithms for Adaptive Influence Maximization | 2018 | VLDB |
| 8 | 9,057 | Efficient Influence Minimization via Node Blocking | 2024 | VLDB |
| 9 | 9,848 | Maximizing Fair Content Spread via Edge Suggestion in Social Networks | 2022 | VLDB |
| 10 | 2,752 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB |