Adaptive seeding for profit maximization in social networks

DOI10.1007/s10898-021-01076-1zbMath1486.91062OpenAlexW3198924685MaRDI QIDQ2114590

Chuangen Gao, Jiguo Yu, Shuyang Gu, Hai Du, Weili Wu

Publication date: 15 March 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-021-01076-1

zbMATH Keywords

social networksstochastic submodular maximizationadaptive non-submodularadaptive sandwich policyadaptive submodular

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (2)

Math‐based reinforcement learning for the adaptive budgeted influence maximization problem ⋮ Profit maximization in social networks and non-monotone DR-submodular maximization

Cites Work

• On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
• Maximization of submodular functions: theory and enumeration algorithms
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive seeding for profit maximization in social networks