Abstract
Sellers of goods or services wishing to participate in sponsored search auctions (SSA) must define a pool of keywords that are matched on-line to the queries submitted by the users to a search engine. Sellers must also define the value of their bid to the search engine for showing their advertisements in case of a query-keyword match. In order to optimize its revenue a seller might decide to substitute a keyword with a high cost, thus likely to be the object of intense competition, with sets of related keywords that collectively have lower cost while capturing an equivalent volume of user clicks. This technique is called keyword spreading and has recently attracted the attention of several researchers in the area of sponsored search auctions. In this paper we describe an experimental benchmark that, through large scale realistic simulations, allows us to pin-point the potential benefits/drawbacks of keyword spreading for the players using this technique, for those not using it, and for the search engine itself. Experimental results reveal that keyword spreading is generally convenient (or non-damaging) to all parties involved.
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
Abhishek, V., Hosanagar, K.: Keyword Generation for Search Engine Advertising using Semantic Similarity between Terms. In: ICEC 2007 (2007)
Abrams, Z.: Revenue maximization when bidders have budgets. In: Proceedings of the ACM-SIAM SODA ’06 (2006)
Abrams, Z., Mendelevitch, O., Tomlin, J.: Optimal delivery of sponsored search advertisements subject to budget constraints. In: Proc. of the 8th ACM EC, San Diego, California, pp. 272–278 (2007)
Acharya, S., Krishnamurthy, P., Deshpande, K., Yan, T.W., Chang, C.C.: A Simulation Framework for Evaluating Designs for Sponsored Search Markets. In: WWW 2007 Sponsored Search Auctions Workshop (2007)
Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proceedings of the 7th ACM EC, pp. 1–7 (2006)
Amer-Yahia, S., Lahaie, S., Pennock, D.M.: Towards a generic bidding standard for online advertising. In: Fourth Workshop on Ad Auctions (2008)
Auerbach, J., Galenson, J., Sundararajan, M.: An empirical analysis of return on investment maximization in sponsored search auctions. In: Proc. of ADKDD ’08, Las Vegas, Nevada, pp. 1–9 (2008)
Budinich, M., Codenotti, B., Geraci, F., Pellegrini, M.: On the benefits of keyword spreading in sponsored search auctions: an experimental analysis, Institute for Informatics and Telematics of CNR, TR IIT-10/2009 (2009)
Cary, M., Das, A., Edelman, B., Giotis, I., Heimerl, K., Karlin, A.R., Mathieu, C., Schwarz, M.: On Best-Response Bidding in GSP Auctions National Bureau of Economic Research Working Paper No. 13788 (February 2008)
Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)
Dhillon, I.S., Mallela, S., Kumar, R.: Enhanced word clustering for hierarchical text classification. In: Proc. of 8th ACM SIGKDD, pp. 191–200 (2002)
Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the Generalized Second Price auction: Selling billions of dollars worth of keywords. American Economic Review 97(1), 242–259 (2007)
Feldman, J., Muthukrishnan, S., Pal, M., Stein, C.: Budget optimization in search-based advertising auctions. In: Proc. of the 8th ACM EC, San Diego, California, June, pp. 40–49 (2007)
Geraci, F., Pellegrini, M., Pisati, P., Sebastiani, F.: A scalable algorithm for high-quality clustering of web snippets. In: Proc. ACM SAC ’06, Dijoin, France (2006)
Gonen, R., Pavlov, E.: An Adaptive Sponsored Search Mechanism delta-Gain Truthful in Valuation, Time, and Budget. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 341–346. Springer, Heidelberg (2007)
Gonzalez, T.F.: Clustering to Minimize the Maximum Intercluster Distance. Theor. Comp. Sci. 38(2/3), 293–306 (1985)
Ghose, A., Yang, S.: An empirical analysis of sponsored search performance in search engine advertising. In: Proc. of the Intl. Conf. on Web Search and Web Data Mining WSDM ’08, New York, pp. 241–250 (2008)
Groves, T.: Efficient collective choice when compensation is possible. Review of Economic Studies 46, 227–241 (1979)
Kitts, B., LeBlanc, B.J.: A Trading Agent and Simulator for Keyword Auctions. In: Proceedigns of AAMAS 2004, pp. 228–235 (2004)
Lahaie, S.: An analysis of alternative slot auction designs for sponsored search. In: Proc. of ACM EC, pp. 218–227 (2006)
Lahaie, S., Pennock, D.M., Saberi, A., Vohra, R.V.: Sponsored search auctions. In: Algorithmic Game Theory, ch. 28, pp. 699–716. Cambridge University Press, Cambridge (2007)
Li, H., Abe, N.: Word clustering and disambiguation based on co-occurrence data. In: Proc. of the 17th Intl. Conf. on Computational Linguistics, pp. 749–755 (1998)
Mehta, A., Saberi, A., Vazirani, U.: Adwords and Generalized Online Matching, J. of ACM 54(5) (2007)
Mizuta, H., Steiglitz, K.: Agent-based simulation of dynamic online auctions. In: Proc. of the 32nd Conference on Winter Simulation, Orlando, Florida, San Diego, CA., December 10-13 (2000)
Miller, G.A., Fellbaum, C., Tengi, R., Wakefield, P., Poddar, R., Langone, H., Haskell, B.: WordNet: A Lexical Database for English. Princeton University, Princeton (2006)
Miller, G.A.: WordNet: An On-line Lexical Database. Int. J. of Lexicography (1990)
Richardson, M., Dominowska, E., Ragno, R.: Predicting clicks: estimating the click-through rate for new ads. In: Proc. WWW 2007, pp. 521–530 (2007)
Robu, V., Bohte, S., La Poutre, J.A.: The Complex Dynamics of Sponsored Search Markets. In: Cao, L., Gorodetsky, V., Liu, J., Weiss, G., Yu, P.S. (eds.) Agents and Data Mining Interaction. LNCS, vol. 5680, pp. 183–198. Springer, Heidelberg (2009)
Rusmevichientong, P., Williamson, D.P.: An adaptive algorithm for selecting profitable keywords for search-based advertising services. In: ACM EC 2006, pp. 260–269 (2006)
Varian, H.R.: Position auctions. Int. J. of Industrial Organization 25, 1163–1178 (2007)
Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. J. of Finance 16, 8–37 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budinich, M., Codenotti, B., Geraci, F., Pellegrini, M. (2010). On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis. In: Buccafurri, F., Semeraro, G. (eds) E-Commerce and Web Technologies. EC-Web 2010. Lecture Notes in Business Information Processing, vol 61. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15208-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-15208-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15207-8
Online ISBN: 978-3-642-15208-5
eBook Packages: Computer ScienceComputer Science (R0)