Modern commercial Internet search engines display advertisements along side the search results in response to user queries. Such sponsored search relies on market mechanisms to elicit prices for these advertisements, making use of an auction among advertisers who bid in order to have their ads shown for specific keywords. We present an overview of the current systems for such auctions and also describe the underlying game-theoretic aspects. The game involves three parties—advertisers, the search engine, and search users—and we present example research directions that emphasize the role of each. The algorithms for bidding and pricing in these games use techniques from three mathematical areas: mechanism design, optimization, and statistical estimation. Finally, we present some challenges in sponsored search advertising.
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
Z. Abrams and A. Ghosh. Auctions with revenue guarantees for sponsored search. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
Z. Abrams, O. Mendelevitch, and J. Tomlin. Optimal delivery of sponsored search advertisements subject to budget constraints. In ACM Conference on Electronic Commerce, 2007.
G. Aggarwal, J. Feldman, and S. Muthukrishnan. Bidding to the top: VCG and equilibria of position-based auctions. In Proc. Workshop on Approximation and Online Algorithms (WAOA), 2006.
G. Aggarwal, J. Feldman, S. Muthukrishnan, and M. Pá Sponsored search auctions with Markovian users, 2008. Submitted.
G. Aggarwal, A. Goel, and R. Motwani. Truthful auctions for pricing search keywords. In ACM Conference on Electronic Commerce (EC), 2006.
K. Arrow and G. Debreu. Existence of an equilibrium for a competitive economy. Econometrica, 22:265–290, 1954.
C. Borgs, J. Chayes, O. Etesami, N. Immorlica, K. Jain, and M. Mahdian. Dynamics of bid optimization in online advertisement auctions. In Proc. WWW, 2007.
C. Borgs, J. T. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. Multi-unit auctions with budget-constrained bidders. In ACM Conference on Electronic Commerce (EC), 2005.
M. Cary, A. Das, B. Edelman, I. Giotis, K. Heimerl, A. R. Karlin, C. Mathieu, and M. Schwarz. Greedy bidding strategies for keyword auctions. In ACM Conference on Electronic Commerce, 2007.
E. Clarke. Multipart pricing of public goods. Public Choice, 11:17–33, 1971.
X. Deng, C. Papadimitriou, and S. Safra. On the complexity of equilibria. In Proceedings of ACM Symposium on Theory of Computing., 2002.
N. Devanur, C. Papadimitriou, A. Saberi, and V. Vazirani. Market equilibrium via a primal-dual-type algorithm, 2002.
B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. In Second workshop on sponsored search auctions, 2006.
E. Eisenberg and D. Gale. Consensus of subjective probabilities: The pari-mutuel method. Annals Of Mathematical Statistics, 30:165–168, 1959.
E. Even-Dar, J. Feldman, Y. Mansour, and S. Muthukrishnan. Position auctions with bidder-specific minimum prices, 2008. Submitted.
E. Even-Dar, S. Mannor, and Y. Mansour. Pac bounds for multi-armed bandit and markov decision processes. In COLT '02: Proceedings of the 15th Annual Conference on Computational Learning Theory, pages 255-270, London, UK, 2002. Springer-Verlag.
J. Feldman, S. Muthukrishnan, M. Pá and C. Stein. Budget optimization in search-based advertising auctions. In ACM Conference on Electronic Commerce, 2007.
J. Feldman, E. Nikolova, S. Muthukrishnan, and M. Pá A truthful mechanism for offline ad slot scheduling. In Proc. Symposium on Algorithmic Game Theory (SAGT), 2008. To appear.
G. Goel and A. Mehta. Adwords auctions with decreasing valuation bids. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
G. Goel and A. Mehta. Online budgeted matching in random input models with applications to adwords. In Proc. Symposium on Discrete Algorithms (SODA), 2008.
Rica Gonen and Elan Pavlov. An adaptive sponsored search mechanism delta-gain truthful in valuation, time, and budget. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
T. Gonzalez and S. Sahni. Preemptive scheduling of uniform processing systems. Journal of the ACM, 25:92–101, January 1978.
T. Groves. Incentives in teams. Econometrica, 41(4):617–631, 1973.
E. C. Horvath, S. Lam, and R. Sethi. A level algorithm for preemptive scheduling. J. ACM, 24(1):32–43, 1977.
R. Johari and J.N. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29(3):407–435, 2004.
F. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33–37, January 1997.
W. Labio, M. Rose, and S. Ramaswamy, May 2004. Internal Document, Google, Inc.
S. Lahaie. An analysis of alternative slot auction designs for sponsored search. In ACM Conference on Electronic Commerce (EC), 2006.
S. Lahaie, D. Pennock, A. Saberi, and R. Vohra. Sponsored Search Auctions, chapter 28. Algorithmic Game Theory. Cambridge University Press, 2007.
L. Liang and Q. Qi. Cooperative or vindictive: Bidding strategies in sponsored search auction. In WINE, pages 167–178, 2007.
E. Dominowska M. Richardson and R. Ragno. Predicting clicks: Estimating the click-through rates for new ads. In WWW 2007, Track: Search, 2007.
M. Mahdian, H. Nazerzadeh, and A. Saberi. Allocating online advertisement space with unreliable estimates. In ACM Conference on Electronic Commerce, 2007.
M. Mahdian and A. Saberi. Multi-unit auctions with unknown supply. In ACM conference on Electronic commerce (EC), 2006.
A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. AdWords and generalized online matching. In FOCS, 2005.
S. Muthukrishnan, M. P? and Z. Svitkina. Stochastic models for budget optimization in search-based advertising. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
M. Mahdian N. Immorlica, K. Jain and K. Talwar. Click fraud resistant methods for learning click-through rates. In Workshop on Internet and Network Economics (WINE), 2005.
T. Nguyen and E. Tardos. Approximately maximizing efficiency and revenue in polyhedral environments. In ACM Conference on Electronic Commerce (EC), 2007.
Nielsen//NetRatings. Interactive advertising bureau (IAB) search branding study, August 2004. Commissioned by the IAB Search Engine Committee. Available at http://www.iab.net/resources/iab searchbrand.asp.
P. Rusmevichientong and D. Williamson. An adaptive algorithm for selecting profitable keywords for search-based advertising services. In Proc. 7th ACM conference on Electronic commerce (EC), 2006.
B. K. Szymanski and J.-S. Lee. Impact of roi on bidding and revenue in sponsored search advertisement auctions. In 2nd Workshop on Sponsored Search Auctions in ACM Conference on Electronic Commerce (EC), 2006.
H. Varian. Position auctions. International Journal of Industrial Organization, 25(6):1163–1178, December 2007.
W. Vickrey. Counterspeculation, auctions and competitive-sealed tenders. Finance, 16(1):8–37, 1961.
Y. Vorobeychik and D. M. Reeves. Equilibrium analysis of dynamic bidding in sponsored search auctions. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
J. Wortman, Y. Vorobeychik, L. Li, and J. Langford. Maintaining equilibria during exploration in sponsored search auctions. In Proc. Workshop on Internet and Network Economics (WINE), 2007.
Y. Zhou and R. Lukose. Vindictive bidding in keyword auctions. In ICEC '07: Proceedings of the ninth international conference on Electronic commerce, pages 141–146, New York, NY, USA, 2007. ACM.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Feldman, J., Muthukrishnan, S. (2008). Algorithmic Methods for Sponsored Search Advertising. In: Liu, Z., Xia, C.H. (eds) Performance Modeling and Engineering. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-79361-0_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-79361-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-79360-3
Online ISBN: 978-0-387-79361-0
eBook Packages: Computer ScienceComputer Science (R0)