Math‐based reinforcement learning for the adaptive budgeted influence maximization problem

DOI10.1002/net.22206OpenAlexW4390233201MaRDI QIDQ6196896

Unnamed Author, Unnamed Author, Unnamed Author, Edoardo Fadda, Unnamed Author

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

zbMATH Keywords

reinforcement learningapproximate dynamic programmingtwo-stage stochastic problemgraph neural networksadaptive budgeted influence maximization problemmixed integer linear problem

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• A two-stage stochastic programming approach for influence maximization in social networks
• Large-scale influence maximization via maximal covering location
• The polynomial robust knapsack problem
• Adaptive seeding for profit maximization in social networks
• An information spreading model based on online social networks
• Statistical mechanics of complex networks
• Approximate Dynamic Programming
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Optimal Social Influence
• Maximizing Social Influence in Nearly Optimal Time
• Automata, Languages and Programming

This page was built for publication: Math‐based reinforcement learning for the adaptive budgeted influence maximization problem