Optimizing budget allocation among channels and influencers

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.

[1]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[2]  Moshe Tennenholtz,et al.  On the Emergence of Social Conventions: Modeling, Analysis, and Simulations , 1997, Artif. Intell..

[3]  Nikolay Archak,et al.  Budget Optimization for Online Advertising Campaigns with Carryover Effects , 2010 .

[4]  J. Kleinberg.  Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[5]  Noam Nisan,et al.  Multi-unit Auctions with Budget Limits , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Elchanan Mossel,et al.  Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..

[7]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[8]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[9]  J. Davenport.  Editor , 1960 .

[10]  Ning Chen,et al.  On the approximability of budget feasible mechanisms , 2010, SODA '11.

[11]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[12]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[13]  H. Peyton Young,et al.  Individual Strategy and Social Structure , 2020 .

[14]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[15]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[16]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[17]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[18]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[19]  Jon Feldman,et al.  Budget optimization in search-based advertising auctions , 2006, EC '07.

[20]  Yaron Singer,et al.  Budget Feasible Mechanisms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[21]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[22]  E. Stanley Lee,et al.  Discrete Multi-Level Programming in a Dynamic Environment , 2001 .

[23]  T. Schelling.  Micromotives and Macrobehavior , 1978 .

[24]  Gagan Goel,et al.  Budget constrained auctions with heterogeneous items , 2009, STOC '10.

[25]  Gagan Ghosh.  Multi-unit auctions with budget-constrained bidders , 2012 .

[26]  Vahab S. Mirrokni,et al.  Budget Optimization for Online Campaigns with Positive Carryover Effects , 2012, WINE.

[27]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[28]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

[29]  Laurence A. Wolsey,et al.  Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..