Budget Strategy in Uncertain Environments of Search Auctions: A Preliminary Investigation

How to rationally allocate the limited advertising budget is a critical issue in sponsored search auctions. There are plenty of uncertainties in the mapping from the budget into the advertising performance. This paper presented some preliminary efforts to deal with uncertainties in search marketing environments, following principles of a hierarchical budget optimization framework (BOF). We proposed a stochastic, risk-constrained budget strategy, by considering a random factor of clicks per unit cost to capture a kind of uncertainty at the campaign level. Uncertainties of random factors at the campaign level lead to risk at the market/system level. We also proved its theoretical soundness through analyzing some desirable properties. Some computational experiments were made to evaluate our proposed budget strategy with real-word data collected from reports and logs of search advertising campaigns. Experimental results illustrated that our strategy outperforms two baseline strategies. We also noticed that 1) the risk tolerance has great influences on the determination of optimal budget solutions; 2) the higher risk tolerance leads to more expected revenues.

[1]  S. Muthukrishnan,et al.  Stochastic Models for Budget Optimization in Search-Based Advertising , 2006, Algorithmica.

[2]  S. Muthukrishnan,et al.  General auction mechanism for search advertising , 2008, WWW '09.

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

[4]  S. Muthukrishnan,et al.  Stochastic Budget Optimization in Internet Advertising , 2010, Algorithmica.

[5]  Rong Du,et al.  Stochastic optimal budget decision for advertising considering uncertain sales responses , 2007, Eur. J. Oper. Res..

[6]  Fei-Yue Wang,et al.  The Emergence of Intelligent Enterprises: From CPS to CPSS , 2010, IEEE Intelligent Systems.

[7]  Mohammad Mahdian,et al.  Clustering-Based Bidding Languages for Sponsored Search , 2009, ESA.

[8]  Daniel Zeng,et al.  Dynamic budget adjustment in search auctions , 2011, WITS 2011.

[9]  Patrick Maillé,et al.  Adword auction bidding strategies of budget-limited advertisers on competing search engines , 2011, 2011 7th International Conference on Network and Service Management.

[10]  Jie Zhang,et al.  Optimal Budget Allocation Across Search Advertising Markets , 2015, INFORMS J. Comput..

[11]  Yi Zhu,et al.  Click Fraud , 2009, Mark. Sci..

[12]  Nicole Immorlica,et al.  Multi-unit auctions with budget-constrained bidders , 2005, EC '05.

[13]  S. Cholette,et al.  Allocating expenditures across keywords in search advertising , 2007 .

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

[15]  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.

[16]  G. Fruchter,et al.  Optimal Budget Allocation over Time for Keyword Ads in Web Portals , 2005 .

[17]  G. Erickson,et al.  Empirical analysis of closed-loop duopoly advertising strategies , 1992 .