Multi-Channel Marketing with Budget Complementarities

Utility maximization under a budget constraint is a classical problem in economics and management science. It is commonly assumed that the utility is a "nice" known analytic function, for example, continuous and concave. In many domains, such as marketing, increased availability of computational resources and data has enabled the development of sophisticated simulations to evaluate the impact of allocating a fixed budget among alternatives (e.g., marketing channels) on outcomes, such as demand. While simulations enable high resolution evaluation of alternative budget allocation strategies, they significantly complicate the associated budget optimization problem. In particular, simulation runs are time consuming, significantly limiting the space of options that can be explored. An important second challenge is the common presence of budget complementarities, where non-negligible budget increments are required for an appreciable marginal impact from a channel. This introduces a combinatorial structure on the decision space. We propose to address these challenges by first converting the problem into a multi-choice knapsack optimization problem with unknown weights. We show that if weights (corresponding to marginal impact thresholds for each channel) are well approximated, we can achieve a solution within a factor of 2 of optimal, and this bound is tight. We then develop several parsimonious query algorithms for achieving this approximation in an online fashion. Experimental evaluation demonstrates the effectiveness of our approach.

[1]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[2]  Yevgeniy Vorobeychik,et al.  Submodular Optimization with Routing Constraints , 2016, AAAI.

[3]  Adil M. Bagirov,et al.  Introduction to Nonsmooth Optimization , 2014 .

[4]  David Pisinger A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[5]  Anita Schöbel,et al.  The robust knapsack problem with queries , 2015, Comput. Oper. Res..

[6]  Jacquelyn S. Thomas,et al.  Challenges and Opportunities in Multichannel Customer Management , 2006 .

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

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

[9]  Hedi M'Halla,et al.  Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem , 2005, J. Comb. Optim..

[10]  Craig Boutilier,et al.  Budget Allocation using Weakly Coupled, Constrained Markov Decision Processes , 2016, UAI.

[11]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[12]  S. Neslin,et al.  Key Issues in Multichannel Customer Management: Current Knowledge and Future Directions , 2009 .

[13]  Adil M. Bagirov,et al.  Introduction to Nonsmooth Optimization: Theory, Practice and Software , 2014 .

[14]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1993, Handbook of Natural Computing.

[15]  Xi Chen,et al.  Quantitative models for direct marketing: A review from systems perspective , 2009, Eur. J. Oper. Res..

[16]  Mustafa Ç. Pinar A note on robust 0-1 optimization with uncertain cost coefficients , 2004, 4OR.

[17]  Jie Zhang,et al.  A Budget Optimization Framework for Search Advertisements Across Markets , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[18]  Arvind Rangaswamy,et al.  Opportunities and challenges in multichannel marketing: An introduction to the special issue , 2005 .

[19]  M. Dyer,et al.  A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem , 1995 .

[20]  Naoki Abe,et al.  Cross channel optimized marketing by reinforcement learning , 2004, KDD.

[21]  My T. Thai,et al.  Maximizing the Spread of Positive Influence in Online Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

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

[23]  Alan K. Graham,et al.  Dynamic, hard and strategic questions: using optimization to answer a marketing resource allocation question , 2003 .

[24]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[25]  T. Ibaraki,et al.  THE MULTIPLE-CHOICE KNAPSACK PROBLEM , 1978 .