Adaptive seeding for profit maximization in social networks

DOI10.1007/S10898-021-01076-1zbMATH Open1486.91062OpenAlexW3198924685MaRDI QIDQ2114590FDOQ2114590

Authors: Chuangen Gao, Shuyang Gu, Jiguo Yu, 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

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

zbMATH Keywords

social networksadaptive non-submodularadaptive sandwich policyadaptive submodularstochastic submodular maximization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Title not available (Why is that?)
• On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
• Maximization of submodular functions: theory and enumeration algorithms
• Adaptive submodularity: theory and applications in active learning and stochastic optimization

Cited In (5)

• Profit maximization in social networks and non-monotone DR-submodular maximization
• Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
• Online non-monotone diminishing return submodular maximization in the bandit setting
• Maximizing profit of multiple adoptions in social networks with a martingale approach
• Diversified-profit maximization in competitive social advertising

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)