TY - GEN
T1 - Optimizing budget allocation among channels and influencers
AU - Alon, Noga
AU - Gamzu, Iftah
AU - Tennenholtz, Moshe
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - Brands and agencies use marketing as a tool to influence customers. One of the major decisions in a marketing plan deals with the allocation of a given budget among media channels in order to maximize the impact on a set of potential customers. A similar situation occurs in a social network, where a marketing budget needs to be distributed among a set of potential influencers in a way that provides high-impact. We introduce several probabilistic models to capture the above scenarios. The common setting of these models consists of a bipartite graph of source and target nodes. The objective is to allocate a fixed budget among the source nodes to maximize the expected number of influenced target nodes. The concrete way in which source nodes influence target nodes depends on the underlying model. We primarily consider two models: a source-side influence model, in which a source node that is allocated a budget of k makes k independent trials to influence each of its neighboring target nodes, and a target-side influence model, in which a target node becomes influenced according to a specified rule that depends on the overall budget allocated to its neighbors. Our main results are an optimal (1 - 1/e)-approximation algorithm for the source-side model, and several inapproximability results for the target-side model, establishing that influence maximization in the latter model is provably harder.
AB - Brands and agencies use marketing as a tool to influence customers. One of the major decisions in a marketing plan deals with the allocation of a given budget among media channels in order to maximize the impact on a set of potential customers. A similar situation occurs in a social network, where a marketing budget needs to be distributed among a set of potential influencers in a way that provides high-impact. We introduce several probabilistic models to capture the above scenarios. The common setting of these models consists of a bipartite graph of source and target nodes. The objective is to allocate a fixed budget among the source nodes to maximize the expected number of influenced target nodes. The concrete way in which source nodes influence target nodes depends on the underlying model. We primarily consider two models: a source-side influence model, in which a source node that is allocated a budget of k makes k independent trials to influence each of its neighboring target nodes, and a target-side influence model, in which a target node becomes influenced according to a specified rule that depends on the overall budget allocated to its neighbors. Our main results are an optimal (1 - 1/e)-approximation algorithm for the source-side model, and several inapproximability results for the target-side model, establishing that influence maximization in the latter model is provably harder.
KW - Approximation algorithms
KW - Budget allocation
KW - Influence models
UR - http://www.scopus.com/inward/record.url?scp=84860852108&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860852108&partnerID=8YFLogxK
U2 - 10.1145/2187836.2187888
DO - 10.1145/2187836.2187888
M3 - Conference contribution
AN - SCOPUS:84860852108
SN - 9781450312295
T3 - WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web
SP - 381
EP - 388
BT - WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web
T2 - 21st Annual Conference on World Wide Web, WWW'12
Y2 - 16 April 2012 through 20 April 2012
ER -