Abstract
Keyword Advertising is a main marketing instrument for e-commerce companies in order to generate traffic from search engines on their website. The costs for Keyword Advertising are determined in an auction that is conducted for every single search query, which is entered in by a user. In case of an online market place, each adlink provided by the search engine refers to an ordered list of products on the website of the online market place. Hereby, the price of the product is oftentimes one important criteria for the user when deciding for one or the other product from the list. However, existing models assume the price of products to be exogeneous. By taking into account the prices of linked products as a further class of decision variables, we propose a joint version of the advertiser’s decision problem that, apart from finding the optimal bidding strategy for Keyword Advertising, also finds the optimal pricing strategy for the offered products under a budget restriction and capacity constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bitran, G. R., & Caldentey, R. (2003). An overview of pricing models for revenue management. Manufacturing & Service Operations Management, 5(3), 203–229.
Edelman, B., Ostrovsky, M., & Schwarz, M. (2006). Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1), 242–259.
Edelman, B., & Ostrovsky, M. (2007). Strategic bidder behavior in sponsored search auctions. Decision Support Systems, 43(1), 192–198.
Feng, J., Bhargava, H. K., & Pennock, D. M. (2007). Implementing sponsored search in web search engines: Computational evaluation of alternative mechanisms. INFORMS Journal on Computing, 19(1), 137–148.
Ghose, A., & Yang, S. (2009). An empirical analysis of search engine advertising: Sponsored search in electronic markets. Management Science, 55(10), 1605–1622.
Hosanagar, K., Abhishek, V., (2010). Optimal bidding in multi-item multi-slot sponsored search auctions. Social Science Research Network. http://dx.doi.org/10.2139/ssrn.1544580
Kalish, S. (1985). A new product adoption model with price, advertising and uncertainty. Management Science, 31(12), 1569–1585.
MacDonald, L., & Rasmussen, H. (2009). Revenue management with dynamic pricing and advertising. Journal of Revenue and Pricing Management, 9, 126–136.
McGill, J. I., & Van Ryzin, G. J. (1999). Revenue management: Research overview and prospects. Transportation Science, 33(2), 233–256.
Talluri, K. T., & Van Ryzin, G. J. (2004). The theory and practice of revenue management. Boston: Kluwer Academic Publishers.
Thompson, G. L., & Teng, J. T. (1984). Optimal pricing and advertising policies for new product oligopoly models. Marketing Science, 3(2), 148–168.
Tso, A., & Law, R. (2005). Analysing the online pricing practices of hotels in Hong Kong. International Journal of Hospitality Management, 24(2), 301–307.
Venkateshwara Rao, B., & Smith, B. (2006). Decision support in online travel retailing. Journal of Revenue and Pricing Management, 5(1), 72–80.
Yao, S., & Mela, C. (2009). Sponsored search auctions: Research opportunities in marketing. Foundations and Trends in Marketing, 3(2), 75–126.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Goertz, T., Pfeiffer, J., Schmidt, H., Rothlauf, F. (2014). Integrating Keyword Advertising and Dynamic Pricing for an Online Market Place. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-07001-8_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07000-1
Online ISBN: 978-3-319-07001-8
eBook Packages: Business and EconomicsBusiness and Management (R0)