Externalities among Advertisers in Sponsored Search

  • Dimitris Fotakis
  • Piotr Krysta
  • Orestis Telelis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)


We introduce a novel computational model for single-keyword auctions in sponsored search, which models explicitly externalities among advertisers, an aspect that has not been fully reflected in the existing models, and is known to affect the behavior of real advertisers. Our model takes into account both positive and negative correlations between any pair of advertisers, so that the click-through rate of an ad depends on the identity, relative order and distance of other ads appearing in the advertisements list. In the proposed model we present several computational results concerning the Winner Determination problem for Social Welfare maximization. These include hardness of approximation and polynomial time exact and approximation algorithms. We conclude with an evaluation of the Generalized Second Price mechanism in presence of externalities.


Cascade Model Price Auction Pure Nash Equilibrium Winner Determination Winner Determination Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aggarwal, G., Feldman, J., Muthukrishnan, S., Pal, M.: Sponsored Search Auctions with Markovian Users. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 621–628. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proceedings of 7th ACM Conference on Electronic Commerce (EC), pp. 1–7. ACM, New York (2006)Google Scholar
  3. 3.
    Alon, N., Yuster, R., Zwick, U.: Color Coding. Journal of the ACM 42, 844–856 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal on Computing 38(4), 1602–1623 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Ashlagi, I., Krysta, P., Tennenholtz, M.: Social Context Games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 675–683. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Athey, S., Ellison, G.: Position Auctions with Consumer Search. Quartetly Journal of Economis (to appear, 2011)Google Scholar
  7. 7.
    Berman, P.: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 214–219. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  8. 8.
    Berman, P., Krysta, P.: Optimizing misdirection. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 192–201. ACM, New York (2003)Google Scholar
  9. 9.
    Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On the Efficiency of Equilibria in Generalized Second Price Auctions. In: Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 81–90. ACM, New York (2011)Google Scholar
  10. 10.
    Chen, P., Kempe, D.: Bayesian Auctions with Friends and Foes. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 335–346. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)zbMATHGoogle Scholar
  12. 12.
    Craswell, N., Zoeter, O., Taylor, M., Ramsey, B.: An experimental comparison of click position-bias models. In: WSDM 2008: Proceedings of the International Conference on Web Search and Web Data Mining, pp. 87–94. ACM, New York (2008)Google Scholar
  13. 13.
    Das, A., Giotis, I., Karlin, A., Mathieu, C.: On the Effects of Competing Advertisements in Keyword Auctions (2008) (unpublished manuscript)Google Scholar
  14. 14.
    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
  15. 15.
    Ghosh, A., Mahdian, M.: Externalities in Online Advertising. In: Proceedings of the 17th International World Wide Web Conference (WWW), pp. 161–168. ACM, New York (2008)Google Scholar
  16. 16.
    Giotis, I., Karlin, A.R.: On the equilibria and efficiency of the GSP mechanism in keyword auctions with externalities. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 629–638. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  17. 17.
    Gomes, R., Immorlica, N., Markakis, E.: Externalities in Keyword Auctions: an empirical and theoretical assessment. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 172–183. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Jeziorski, P., Segal, I.: What makes them click: Empirical analysis of consumer demand for search advertising. Working paper (Department of Economics, Stanford University (2009)Google Scholar
  19. 19.
    Kempe, D., Mahdian, M.: A Cascade Model for Externalities in Sponsored Search. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 585–596. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  20. 20.
    Kuminov, D., Tennenholtz, M.: User Modeling in Position Auctions: Re-Considering the GSP and VCG Mechanisms. In: Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 273–280. ACM, New York (2009)Google Scholar
  21. 21.
    Leme, R.P., Tardos, E.: Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction. In: Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 735–744. IEEE, Los Alamitos (2010)Google Scholar
  22. 22.
    Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)CrossRefzbMATHGoogle Scholar
  23. 23.
    Papadimitriou, C., Yannakakis, M.: The Travelling Salesman Problem with Distances One and Two. Mathematics of Operations Research 18(1), 1–11 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Varian, H.R.: Position auctions. International Journal of Industrial Organization 25(6), 1163–1178 (2007)CrossRefGoogle Scholar
  25. 25.
    Vickrey, W.: Counterspeculation, Auctions and Competitive Sealed Tenders. Journal of Finance, 8–37 (1961)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dimitris Fotakis
    • 1
  • Piotr Krysta
    • 2
  • Orestis Telelis
    • 2
  1. 1.School of Electrical and Computer EngineeringNational Technical University of AthensAthensGreece
  2. 2.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK

Personalised recommendations