DMCA
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm (2014)
| Citations: | 4 - 1 self |
BibTeX
@MISC{Soma14optimalbudget,
author = {Tasuku Soma and Kazuhiro Inaba and et al.},
title = {Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm},
year = {2014}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider the budget allocation problem over bipartite influence model proposed by Alon et al. (Alon et al., 2012). This problem can be viewed as the well-known influence maximization problem with budget constraints. We first show that this problem and its much more general form fall into a general setting; namely the monotone submodular function maximization over integer lattice subject to a knapsack constraint. Our framework includes Alon et al.’s model, even with a competitor and with cost. We then give a (1 − 1/e)-approximation algorithm for this more general problem. Furthermore, when influence probabili-
Keyphrases
optimal budget allocation efficient algorithm theoretical guarantee budget constraint influence probabili bipartite influence model knap-sack constraint monotone submodular function max-imization general setting general form fall approximation algorithm alon et al well-known influence maximiza-tion problem general problem budget allocation problem integer lattice subject
