The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April-June (2013 vol.6)
pp: 168-176
Yanwu Yang , Chinese Academy of Sciences, Beijing
Jie Zhang , Chinese Academy of Sciences, Beijing
Rui Qin , Chinese Academy of Sciences, Beijing
Juanjuan Li , Chinese Academy of Sciences, Beijing
Baiyu Liu , University of Science and Technology Beijing, Beijing
Zhong Liu , National University of Defense Technology, Hunan
ABSTRACT
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.
INDEX TERMS
Advertising, Optimization, Uncertainty, Stochastic processes, Resource management, Search problems, Portals, search auctions, Budget optimization, budget decisions, optimal strategy, stochastic strategy
CITATION
Yanwu Yang, Jie Zhang, Rui Qin, Juanjuan Li, Baiyu Liu, Zhong Liu, "Budget Strategy in Uncertain Environments of Search Auctions: A Preliminary Investigation", IEEE Transactions on Services Computing, vol.6, no. 2, pp. 168-176, April-June 2013, doi:10.1109/TSC.2011.60
REFERENCES
[1] N. Archak, V.S. Mirrokni, and S. Muthukrishnan, "Budget Optimization for Online Advertising Campaigns with Carryover Effects," Proc. Eleventh ACM SIGCOMM Int'l Conf. Electronic Commerce, 2010.
[2] G. Aggarwal, S. Muthukrishnan, D. Pál, and M. Pál, "General Auction Mechanism for Search Advertising," Proc. Int'l Conf. World Wide Web (WWW '09), Apr. 2009.
[3] C. Borgs, J. Chayes, N. Immorlica, M. Mahdian, and A. Saberi, "Multi-Unit Auctions with Budget-Constrained Bidders," Proc. Sixth ACM Conf. Electronic Commerce, 2005.
[4] R. Du, Q. Hu, and S. Ai, "Stochastic Optimal Budget Decision for Advertising Considering Uncertain Sales Responses," European J. Operational Research, vol. 183, pp. 1042-1054, 2007.
[5] B. DasGupta and S. Muthukrishnan, "Stochastic Budget Optimization in Internet Advertising," eprint arXiv:1001.2735v1, 2010.
[6] G.M. Erickson, "Empirical Analysis of Closed-Loop Duopoly Advertising Strategies," Management Science, vol. 38, pp. 1732-1749, 1992.
[7] G.E. Fruchter and W. Dou, "Optimal Budget Allocation over Time for Keyword ads in Web Markets," J. Optimization Theory and Applications, vol. 124, no. 1, pp. 157-174, 2005.
[8] J. Feldman and S. Muthukrishnan, "Budget Optimization in Search-Based Advertising Auctions," Proc. Eighth ACM Conf. Electronic Commerce, 2007.
[9] B.J. Jansen, "Click Fraud," Computer, vol. 40, no. 7, pp. 85-86, July 2007.
[10] S. Muthukrishnan, M. Pál, and Z. Svitkina, "Stochastic Models for Budget Optimization in Search-Based Advertising," Algorithmica, vol. 58, pp. 1022-1044, 2010.
[11] P. Maille and B. Tuffin, "Adword Auction Bidding Strategies of Budget-Limited Advertisers on Competing Search Engines," Proc. Seventh Int'l Conf. Network and Service Management, Oct. 2011.
[12] M. Mahdian and G. Wang, "Clustering-Based Bidding Languages for Sponsored Search," Proc. European Symp. Algorithms (ESA), pp. 167-178, 2009.
[13] F.Y. Wang, "The Emergence of Intelligent Enterprises: From CPS to CPSS," IEEE Intelligent Systems, vol. 25, no. 4, pp. 85-88, July/Aug. 2010.
[14] Y. Yang, J. Li, J. Zhang, and D. Zeng, "Budget Allocation in Competitive Search Advertisements," Proc. 21st Workshop Information Technologies and Systems, pp. 219-220, Dec. 2011.
[15] Y. Yang, J. Zhang, B. Liu, and D. Zeng, "Optimal Budget Allocation across Search Advertising Markets," Proc. 21st Workshop Information Technologies and Systems, pp. 97-102, Dec. 2011.
[16] Y. Yang, J. Zhang, R. Qin, J. Li, F. Wang, and W. Qi, "A Budget Optimization Framework for Search Advertisements across Markets," IEEE Trans. Systems, Man, and Cybernetics. Part A: Systems and Humans, vol. 42, no. 5, pp. 1141-1151, Sept. 2012.
[17] O.O. Zluk and S. Cholette, "Allocating Expenditures across Keywords in Search Advertising," J. Revenue and Pricing Management, vol. 6, no. 4, pp. 347-356, 2007.
[18] J. Zhang, Y. Yang, R. Qin, D. Zeng, and X. Li, "Dynamic Budget Adjustment in Search Auctions," Proc. 21st Workshop Information Technologies and Systems, pp. 67-72, Dec. 2011.
39 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool