Budgeted Online Influence Maximization
Pierre Perrault, Jennifer Healey, Zheng Wen, Michal Valko
Abstract
We introduce a new budgeted framework for on-line influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a chosen influ-encer set. Our approach models better the real-world setting where the cost of influencers varies and advertizers want to find the best value for their overall social advertising budget. We propose an algorithm assuming an independent cascade diffusion model and edge-level semi-bandit feedback, and provide both theoretical and experimental results. Our analysis is also valid for the cardinality-constraint setting and improves the state of the art regret bound in this case.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext afca9b21-b520-44f3-83b2-6e77f4da1f4dCited by top-tier papers6
- Statistical Efficiency of Thompson Sampling for Combinatorial Semi-BanditsPierre Perrault, Etienne Boursier, Michal Valko, Vianney PerchetNeurIPS 2020 · 45 citations
- Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent ArmsXutong Liu, Jinhang Zuo, Siwei Wang, Carlee Joe-Wong et al.NeurIPS 2022 · 31 citations
- A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit FeedbackGuanyu Nie, Yididiya Y. Nadew, Yanhui Zhu, Vaneet Aggarwal et al.ICML 2023 · 17 citations
- Combinatorial Stochastic-Greedy BanditFares Fourati, Christopher John Quinn, Mohamed-Slim Alouini, Vaneet AggarwalAAAI 2024 · 14 citations
- When Combinatorial Thompson Sampling meets Approximation RegretPierre PerraultNeurIPS 2022 · 9 citations
Builds on1
Related papers
- Online Influence Maximization with Node-Level Feedback Using Standard Offline OraclesZhijie Zhang, Wei Chen, Xiaoming Sun, Jialin ZhangAAAI 2022 · 13 citations
- Efficient Online Influence Maximization under the Independent Cascade Model with Node-Level FeedbackArpit Agarwal, Varad Deolankar, Rohan GhugeICML 2026
- Correlation Robust Influence MaximizationLouis Chen, Divya Padmanabhan, Chee Chin Lim, Karthik NatarajanNeurIPS 2020 · 2 citations
- Online Influence Maximization under Linear Threshold ModelShuai Li, Fang Kong, Kejie Tang, Qizhi Li et al.NeurIPS 2020 · 45 citations
- Influence Maximization via Graph Neural BanditsYuting Feng, Vincent Y. F. Tan, Bogdan CautisKDD 2024 · 6 citations
