Fairness in Influence Maximization through Randomization
From MaRDI portal
Publication:5076357
Recommendations
- Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling
- Maximizing social influence in nearly optimal time
- A random algorithm for profit maximization in online social networks
- Influence Maximization in Undirected Networks
- Seeding with costly network information
Cites work
- A new solution to the random assignment problem.
- A solution to the random assignment problem on the full preference domain
- A threshold of ln n for approximating set cover
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Consistent probabilistic social choice
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 44383 (Why is no real title available?)
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- scientific article; zbMATH DE number 6783427 (Why is no real title available?)
- Maximizing social influence in nearly optimal time
- On popular random assignments
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Statistical mechanics of complex networks
- Strategyproof mechanisms for competitive influence in networks
Cited in
(4)- Budget-feasible mechanisms for proportionally selecting agents from groups
- Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling
- A complexity-theoretic analysis of majority illusion in social networks
- Maximizing the spread of influence through a social network using partial incentives
This page was built for publication: Fairness in Influence Maximization through Randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076357)
