skip to main content
research-article

Ranking and Tradeoffs in Sponsored Search Auctions

Published:15 June 2016Publication History
Skip Abstract Section

Abstract

In a sponsored search auction, decisions about how to rank ads impose tradeoffs between objectives, such as revenue and welfare. In this article, we examine how these tradeoffs should be made. We begin by arguing that the most natural solution concept to evaluate these tradeoffs is the lowest symmetric Nash equilibrium (SNE). As part of this argument, we generalise the well-known connection between the lowest SNE and the VCG outcome. We then propose a new ranking algorithm, loosely based on the revenue-optimal auction, that uses a reserve price to order the ads (not just to filter them) and give conditions under which it raises more revenue than simply applying that reserve price. Finally, we conduct extensive simulations examining the tradeoffs enabled by different ranking algorithms and show that our proposed algorithm enables superior operating points by a variety of metrics.

References

  1. Zoë Abrams and Arpita Ghosh. 2007. Auctions with revenue guarantees for sponsored search. In Proceedings of the 3rd International Conference on Internet and Network Economics (WINE'07). San Diego, CA, 143--154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Gagan Aggarwal, Ashish Goel, and Rajeev Motwani. 2006. Truthful auctions for pricing search keywords. In ACM Conference on Electronic Commerce. 1--7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Itai Ashlagi, Dov Monderer, and Moshe Tennenholtz. 2009. Mediators in position auctions. Games and Economic Behavior 67, 1, 2--21. DOI:http://dx.doi.org/10.1016/j.geb.2008.11.005Google ScholarGoogle ScholarCross RefCross Ref
  4. Susan Athey and Glenn Ellison. 2011. Position auctions with consumer search. The Quarterly Journal of Economics 126, 3, 1213--1270. DOI:http://dx.doi.org/10.1093/qje/qjr028Google ScholarGoogle ScholarCross RefCross Ref
  5. S. Athey and D. Nekipelov. 2012. A Structural Model of Sponsored Search Advertising Auctions. Working paper.Google ScholarGoogle Scholar
  6. Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter Key, and David Kurokawa. 2014. Optimising trade-offs among stakeholders in ad auctions. In 15th ACM Conference on Economics and Computation (EC'14). 75--92. DOI:http://dx.doi.org/10.1145/2600057.2602879 Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Mark Bagnoli and Ted Bergstrom. 2005. Log-concave probability and its applications. Economic Theory 26, 445--469. Issue 2. DOI:http://dx.doi.org/10.1007/s00199-004-0514-4Google ScholarGoogle ScholarCross RefCross Ref
  8. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, and Maria Kyropoulou. 2011. On the efficiency of equilibria in generalized second price auctions. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC'11). San Jose, CA, 81--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos, Maria Kyropoulou, Brendan Lucier, Renato Paes Leme, and Éva Tardos. 2012. On the efficiency of equilibria in generalized second price auctions. CoRR abs/1201.6429 (2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. Edelman, M. Ostrovsky, and M. Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review 97, 1, 242--259.Google ScholarGoogle ScholarCross RefCross Ref
  11. B. Edelman and M. Schwarz. 2010. Optimal auction design and equilibrium selection in sponsored search auctions. American Economic Review 100, 2.Google ScholarGoogle ScholarCross RefCross Ref
  12. R. Gomes and K. Sweeney. 2009. Bayes--Nash equilibria of the generalized second-price auction. In Proceedings of the 10th ACM Conference on Electronic Commerce (EC'09). Stanford, CA, 107--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Sébastien Lahaie and R. Preston McAfee. 2011. Efficient ranking in sponsored search. In Proceedings of the 7th International Conference on Internet and Network Economics (WINE'11). Singapore, 254--265. DOI:http://dx.doi.org/10.1007/978-3-642-25510-6_22 Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Lahaie and D. M. Pennock. 2007. Revenue analysis of a family of ranking rules for keyword auctions. In Proceedings of the 8th ACM Conference on Electronic Commerce (EC'07). San Diego, CA, 50--56. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. De Liu and Jianqing Chen. 2006. Designing online auctions with past performance information. Decision Support Systems 42, 3, 1307--1320. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. De Liu, Jianqing Chen, and Andrew B. Whinston. 2010. Ex ante information and the design of keyword auctions. Information Systems Research 21, 1, 133--153. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Brendan Lucier, Renato Paes Leme, and Éva Tardos. 2012. On revenue in the generalized second price auction. In WWW. 361--370. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Myerson. 1981. Optimal auction design. Mathematics of Operations Research 6, 1l, 58--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Ostrovsky and M. Schwarz. 2011. Reserve prices in Internet advertising auctions: A field experiment. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC'11). San Jose, CA, 59--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Renato Paes Leme and Éva Tardos. 2010. Pure and Bayes--Nash price of anarchy for generalized second price auction. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10). Las Vegas, NV, 735--744. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. F. Pin and P. Key. 2011. Stochastic variability in sponsored search auctions. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC'11). San Jose, CA, 61--70. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. David R. M. Thompson and Kevin Leyton-Brown. 2013. Revenue optimization in the generalized second-price auction. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC'13). ACM, New York, NY, 837--852. DOI:http://dx.doi.org/10.1145/2482540.2482612 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Hal R. Varian. 2007. Position auctions. International Journal of Industrial Organization 25, 6, 1163--1178. DOI:http://dx.doi.org/10.1016/j.ijindorg.2006.10.002Google ScholarGoogle ScholarCross RefCross Ref
  24. Y. Vorobeychik. 2009. Simulation-based game theoretic analysis of keyword auctions with low-dimensional bidding strategies. In Proceedings of the 25th Annual Conference on Uncertainty in Artificial Intelligence (UAI'09). Corvallis, OR, 583--590. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. M. B. Yenmez. 2010. Pricing in Position Auctions and Online Advertising. (2010). Working paper.Google ScholarGoogle Scholar

Index Terms

  1. Ranking and Tradeoffs in Sponsored Search Auctions

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Economics and Computation
      ACM Transactions on Economics and Computation  Volume 4, Issue 3
      Special Issue on EC'13
      June 2016
      162 pages
      ISSN:2167-8375
      EISSN:2167-8383
      DOI:10.1145/2905047
      Issue’s Table of Contents

      Copyright © 2016 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 15 June 2016
      • Accepted: 1 March 2016
      • Revised: 1 December 2015
      • Received: 1 November 2013
      Published in teac Volume 4, Issue 3

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader