Skip to main content

Online Ad Assignment with an Ad Exchange

  • Conference paper
  • First Online:
Approximation and Online Algorithms (WAOA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8952))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The reserve price is the minimum required price at which an impression is sold at an ad auction. If no offer is at or above the reserve price, the impression is not sold.

  2. 2.

    It is straightforward to extend the algorithm and its analysis to multiple ad exchanges.

  3. 3.

    In [7] the authors study the Adwords problem but in [4] it is argued that the given example can be also be interpreted as Online Ad Assignment problem.

References

  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. 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. 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. 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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  7. Mehta, A., Saberi, A., Vazirani, U.M., Vazirani, V.V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)

    Article  MathSciNet  Google Scholar 

  8. Muthukrishnan, S.: Ad exchanges: research issues. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 1–12. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Acknowledgments

The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement no. 340506 and from the Vienna Science and Technology Fund (WWTF) through project ICT10-002. The authors are grateful to Claire Kenyon and Moses Charikar for useful discussions on formulating the model.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wolfgang Dvořák .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dvořák, W., Henzinger, M. (2015). Online Ad Assignment with an Ad Exchange. In: Bampis, E., Svensson, O. (eds) Approximation and Online Algorithms. WAOA 2014. Lecture Notes in Computer Science(), vol 8952. Springer, Cham. https://doi.org/10.1007/978-3-319-18263-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18263-6_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18262-9

  • Online ISBN: 978-3-319-18263-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics