Online Ad Assignment with an Ad Exchange

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8952)

Abstract

Ad exchanges are becoming an increasingly popular way to sell advertisement slots on the internet. An ad exchange is basically a spot market for ad impressions. A publisher who has already signed contracts reserving advertisement impressions on his pages can choose between assigning a new ad impression for a new page view to a contracted advertiser or to sell it at an ad exchange. This leads to an online revenue maximization problem for the publisher. Given a new impression to sell decide whether (a) to assign it to a contracted advertiser and if so to which one or (b) to sell it at the ad exchange and if so at which reserve price. We make no assumptions about the distribution of the advertiser valuations that participate in the ad exchange and show that there exists a simple primal-dual based online algorithm, whose lower bound for the revenue converges to \(R_{ADX} + R_A (1 - 1/e)\), where \(R_{ADX}\) is the revenue that the optimum algorithm achieves from the ad exchange and \(R_A\) is the revenue that the optimum algorithm achieves from the contracted advertisers.

References

  1. 1.
    Alaei, S., Arcaute, E., Khuller, S., Ma, W., Malekian, A., Tomlin, J.: Online allocation of display advertisements subject to advanced sales contracts. In: ADKDD 2009, pp. 69–77. ACM, New York (2009)Google Scholar
  2. 2.
    Balseiro, S., Feldman, J., Mirrokni, V., Muthukrishnan, S.: Yield optimization of display advertising with Ad exchange. In: EC 2011, pp. 27–28. ACM (2011)Google Scholar
  3. 3.
    Devanur, N.R., Huang, Z., Korula, N., Mirrokni, V.S., Yan Q.: Whole-page optimization and submodular welfare maximization with online bidders. In: EC 2013, pp. 305–322. ACM (2013)Google Scholar
  4. 4.
    Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., Pál, M.: Online Ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 374–385. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  5. 5.
    Ghosh, A., McAfee, P., Papineni, K., Vassilvitskii, S.: Bidding for representative allocations for display advertising. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 208–219. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  6. 6.
    Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1180, pp. 193–199. Springer, Berlin (1996) CrossRefGoogle Scholar
  7. 7.
    Mehta, A., Saberi, A., Vazirani, U.M., Vazirani, V.V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Muthukrishnan, S.: Ad exchanges: research issues. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 1–12. Springer, Heidelberg (2009) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Faculty of Computer ScienceUniversity of ViennaViennaAustria

Personalised recommendations