Abstract
Online keywords bidding as a new business model for search engine market facilitates the prosperity of internet economy as well as attracts myriad small business to directly target their customers. In order to effectively manage each advertising campaign the manager needs to figure out smart strategy to bid. This paper successively developed two models (static and dynamic) with four crucial variants at keyword bidding (bid, rank, click through and impression) based on the bayesian network to assist the prediction of bidding. Herein dynamic model, evolved from the static model, takes the influence of click through on the last period into account and extends the strategy space. Empirical study by aid of data from the largest online travel agency in China is carried out to test both models and the results indicate that they are effective while the dynamic model is more attractive in terms of prediction accuracy. Finally further research directions along this paper is shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Animesh, A., Ramachandran, V., Viswanathan, S.: Online Advertisers Bidding Strategies for Search, Experience, and Credence Goods: An Empirical Investigation. Working paper (2005)
Animesh, A., Ramachandran, V., Viswanathan, S.: Quality Uncertainty and Adverse Selection In Sponsored Search Markets, working paper (2005)
Edelman, B., Ostrovsky, M.: Strategic Bidder Behavior in Sponsored Search Auctions. Int. J. Internet Marketing and Advertising 2, 92–108 (2005)
Kitts, B., Leblanc, B.: Optimal Bidding on Keyword Auctions. Electronic Markets, special issue: innovative auction markets 14, 186–201 (2004)
Feng, J., Bhargava, H.K., Pennock, D.M.: Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms. working paper (2005)
Park, S., Durfee, E.H., Birmingham, W.P.: Use of Markov Chains to Design an Agent Bidding Strategy for Continuous Double Auctions. Journal of Artificial Intelligence Research 22, 175–214 (2004)
Park, Y.-H., Bradlow, E.T.: An Integrated Model for Bidding Behavior in Internet Auctions: Whether, Who, When, and How Much. Journal of Marketing Research XLII, 470–482 (2005)
Jensen, F.V.: Bayesian Networks and Decision Graphs. Springer, Heidelberg (2001)
Murphy, K.: Bayes Net Toolbox for Matlab (Accessed November 15, 2007) (2007), http://www.cs.ubc.ca/~murphyk/Software/BNT/bnt.html
Kitts, B., Leblanc, B.: Optimal Bidding on Keyword Auctions. Electronic Markets 14, 186–201 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, L., Wang, L., Yang, J. (2008). Evolutionary Prediction of Online Keywords Bidding. In: Psaila, G., Wagner, R. (eds) E-Commerce and Web Technologies. EC-Web 2008. Lecture Notes in Computer Science, vol 5183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85717-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-85717-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85716-7
Online ISBN: 978-3-540-85717-4
eBook Packages: Computer ScienceComputer Science (R0)