Value of Learning in Sponsored Search Auctions

  • Sai-Ming Li
  • Mohammad Mahdian
  • R. Preston McAfee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)

Abstract

The standard business model in the sponsored search marketplace is to sell click-throughs to the advertisers. This involves running an auction that allocates advertisement opportunities based on the value the advertiser is willing to pay per click, times the click-through rate of the advertiser. The click-through rate of an advertiser is the probability that if their ad is shown, it would be clicked on by the user. This quantity is unknown in advance, and is learned using historical click data about the advertiser. In this paper, we first show that in an auction that does not explore enough to discover the click-through rate of the ads, an advertiser has an incentive to increase their bid by an amount that we call value of learning. This means that in sponsored search auctions, exploration is necessary not only to improve the efficiency (a subject which has been studied in the machine learning literature), but also to improve the incentive properties of the mechanism. Secondly, we show through an intuitive theoretical argument as well as extensive simulations that a mechanism that sorts ads based on their expected value per impression plus their value of learning, increases the revenue even in the short term.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, D., Chen, B., Elango, P.: Explore/exploit schemes for web content optimization. In: ICDM (2009)Google Scholar
  2. 2.
    Aggarwal, G., Feldman, J., Muthukrishnan, S., Pal, M.: Sponsored Search Auctions with Markovian Users. In: Workshop on Ad Auctions (2008)Google Scholar
  3. 3.
    Audibert, J.Y., Munos, R., Szepesvári, C.: Exploration–Exploitation Tradeoff Using Variance Estimates in Multi-armed Bandits. Theoretical Computer Science 410(19), 1876–1902 (2009)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning 47(2-3), 235–256 (2002)MATHCrossRefGoogle Scholar
  5. 5.
    Ayres, I., Cramton, P.: Deficit reduction through diversity: How affirmative action at the fcc increased auction competition. Stanford Law Review 48(4), 761–815 (1996)CrossRefGoogle Scholar
  6. 6.
    Babaioff, M., Sharma, Y., Slivkins, A.: Characterizing Truthful Multi-Armed Bandit Mechanisms. In: EC, pp. 79–88 (2009)Google Scholar
  7. 7.
    Devanur, N.R., Kakade, S.M.: The Price of Truthfulness for Pay-Per-Click Auctions. In: EC, pp. 99–106 (2009)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Ghosh, A., Mahdian, M.: Externalities in Online Advertising. In: WWW, pp. 161–168 (2008)Google Scholar
  10. 10.
    Goel, A., Munagala, K.: Hybrid keyword search auctions. In: Proceedings of the 18th World Wide Web Conference (2009)Google Scholar
  11. 11.
    Kale, S., Mahdian, M., Punera, K., Sarlos, T., Sharma, A.: Position-aware multi-armed bandits. Working Paper (2010)Google Scholar
  12. 12.
    Kempe, D., Mahdian, M.: A Cascade Model for Externalities in Sponsored Search. In: Workshop on Internet Ad Auctions (2008)Google Scholar
  13. 13.
    Krishna, V.: Auction Theory. Academic Press, London (2002)Google Scholar
  14. 14.
    Langford, J., Li, L., Vorobeychik, Y., Wortman, J.: Maintaining Equilibria during Exploration in Sponsored Search Auctions. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, p. 119. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Pandey, S., Olston, C.: Handling Advertisements of Unknown Quality in Search Advertising. NIPS 19, 1065 (2007)Google Scholar
  16. 16.
    Das Sarma, A., Gujar, S., Narahari, Y.: Multi-Armed Bandit Mechanisms for Multi-Slot Sponsored Search Auctions. Arxiv preprint arXiv:1001.1414 (2010)Google Scholar
  17. 17.
    Varian, H.R.: Position Auctions. International Journal of Industrial Organization 25(6), 1163–1178 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sai-Ming Li
    • 1
  • Mohammad Mahdian
    • 1
  • R. Preston McAfee
    • 1
  1. 1.Yahoo! Inc.Santa ClaraUSA

Personalised recommendations