Adaptive seeding for profit maximization in social networks
From MaRDI portal
Publication:2114590
Recommendations
- A random algorithm for profit maximization in online social networks
- Maximizing profit of multiple adoptions in social networks with a martingale approach
- Diversified-profit maximization in competitive social advertising
- Fixed observation time-step: adaptive influence maximization
- Seeding with costly network information
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Maximization of submodular functions: theory and enumeration algorithms
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
Cited in
(11)- Fixed observation time-step: adaptive influence maximization
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Maximizing profit of multiple adoptions in social networks with a martingale approach
- Nonsubmodular constrained profit maximization from increment perspective
- Seeding with costly network information
- Interaction-aware influence maximization and iterated sandwich method
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
- Diversified-profit maximization in competitive social advertising
- Online non-monotone diminishing return submodular maximization in the bandit setting
- A random algorithm for profit maximization in online social networks
- Profit maximization problem with coupons in social networks
This page was built for publication: Adaptive seeding for profit maximization in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114590)
