Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View

In marketing planning, advertisers seek to maximize the number of customers by allocating given budgets to each media channel effectively. The budget allocation problem with a bipartite influence model captures this scenario; however, the model is problematic because it assumes there is only one advertiser in the market. In reality, there are many advertisers which are in conflict of advertisement; thus we must extend the model for such a case. By extending the budget allocation problem with a bipartite influence model, we propose a gametheoretic model problem that considers many advertisers. By simulating our model, we can analyze the behavior of a media channel market, e.g., we can estimate which media channels are allocated by an advertiser, and which customers are influenced by an advertiser. Our model has many attractive features. First, our model is a potential game; therefore, it has a pure Nash equilibrium. Second, any Nash equilibrium of our game has 2-optimal social utility, i.e., the price of anarchy is 2. Finally, the proposed model can be simulated very efficiently; thus it can be used to analyze large markets.

[1]  Akiyoshi Shioura,et al.  On the Pipage Rounding Algorithm for Submodular Function Maximization - a View from Discrete Convex Analysis , 2009, Discret. Math. Algorithms Appl..

[2]  Noga Alon,et al.  Optimizing budget allocation among channels and influencers , 2012, WWW.

[3]  Ludger Rüschendorf,et al.  Solution of a statistical optimization problem by rearrangement methods , 1983 .

[4]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Sahin Cem Geyik,et al.  Multi-Touch Attribution Based Budget Allocation in Online Advertising , 2014, ADKDD'14.

[6]  Michael Kearns,et al.  Competitive contagion in networks , 2011, STOC '12.

[7]  David Kempe,et al.  Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions , 2013, WINE.

[8]  Jun Wang,et al.  Real-time bidding for online advertising: measurement and analysis , 2013, ADKDD '13.

[9]  Noga Alon,et al.  Information Processing Letters a Note on Competitive Diffusion through Social Networks , 2022 .

[10]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[11]  Jian Li,et al.  A unified approach to ranking in probabilistic databases , 2009, The VLDB Journal.

[12]  Evangelos Markakis,et al.  A Game-Theoretic Analysis of a Competitive Diffusion Process over Social Networks , 2012, WINE.

[13]  Anna Nagurney,et al.  A network equilibrium framework for Internet advertising: Models, qualitative analysis, and algorithms , 2008, Eur. J. Oper. Res..

[14]  Paul Milgrom,et al.  Substitute goods, auctions, and equilibrium , 2009, J. Econ. Theory.

[15]  Brigitte Maier,et al.  Supermodularity And Complementarity , 2016 .

[16]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[17]  J. Shanthikumar,et al.  Parametric stochastic convexity and concavity of stochastic processes , 1990 .

[18]  Ken-ichi Kawarabayashi,et al.  Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm , 2014, ICML.

[19]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[20]  L. Shapley,et al.  Fictitious Play Property for Games with Identical Interests , 1996 .

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

[22]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[23]  Sergei Vassilvitskii,et al.  Advertising in a stream , 2014, WWW.

[24]  Ken-ichi Kawarabayashi,et al.  Lagrangian Decomposition Algorithm for Allocating Marketing Channels , 2015, AAAI.

[25]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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