Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
From MaRDI portal
Publication:6196896
DOI10.1002/NET.22206OpenAlexW4390233201MaRDI QIDQ6196896FDOQ6196896
Authors: Edoardo Fadda
Publication date: 15 March 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22206
Recommendations
approximate dynamic programmingreinforcement learningtwo-stage stochastic problemgraph neural networksadaptive budgeted influence maximization problemmixed integer linear problem
Cites Work
- Statistical mechanics of complex networks
- Approximate dynamic programming. Solving the curses of dimensionality
- Automata, Languages and Programming
- Title not available (Why is that?)
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Maximizing social influence in nearly optimal time
- An information spreading model based on online social networks
- A two-stage stochastic programming approach for influence maximization in social networks
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Large-scale influence maximization via maximal covering location
- The polynomial robust knapsack problem
- Adaptive seeding for profit maximization in social networks
- Optimal Social Influence
This page was built for publication: Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196896)