Abstract
We study the following online problem. Each advertiser a i has a value v i , demand d i , and frequency cap f i . Supply units arrive online, each one associated with a user. Each advertiser can be assigned at most d i units in all, and at most f i units from the same user. The goal is to design an online allocation algorithm maximizing total value.
We first show a deterministic upper bound of 3/4-competitiveness, even when all frequency caps are 1, and all advertisers share identical values and demands. A competitive ratio approaching 1 − 1/e can be achieved via a reduction to a model with arbitrary decreasing valuations [GM07]. Our main contribution is analyzing two 3/4-competitive greedy algorithms for the cases of equal values, and arbitrary valuations with equal demands. Finally, we give a primal-dual algorithm which may serve as a good starting point for improving upon the 1 − 1/e ratio.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrams, Z., Vee, E.: Personalized ad delivery when ads fatigue: An approximation algorithm. In: 3rd International Workshop on Internet and Network Economics, pp. 535–540. Springer, Heidelberg (2007)
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Transactions on Algorithms 2(4), 640–660 (2006)
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)
Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 507–517. IEEE Computer Society, Washington, DC (2007)
Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. In: 40th ACM Symposium on Theory of Computer Science, pp. 235–244. ACM, New York (2008)
Bansal, N., Chen, N., Cherniavsky, N., Rudra, A., Schieber, B., Sviridenko, M.: Dynamic pricing for impatient bidders. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 726–735. Society for Industrial and Applied Mathematics, Philadelphia (2007)
Blum, A., Hartline, J.: Near-optimal online auctions. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1156–1163. Society for Industrial and Applied Mathematics, Philadelphia (2005)
Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. Theor. Comput. Sci. 324(2-3), 137–146 (2004)
Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270–286 (2009)
Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 293–304. IEEE Computer Society, Washington, DC (2006)
Buchbinder, N., Jain, K., Naor, J(S.): Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253–264. Springer, Heidelberg (2007)
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)
Feldman, J., Mehta, A., Mirrokni, V.S., Muthukrishnan, S.: Online stochastic matching: Beating 1 − 1/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117–126. IEEE Computer Society, Washington, DC (2009)
Goel, G., Mehta, A.: Adwords auctions with decreasing valuation bids. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 335–340. Springer, Heidelberg (2007)
Kalyanasundaram, B., Pruhs, K.R.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1-2), 319–325 (2000)
Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 352–358. ACM, New York (1990)
Mahdian, M., Saberi, A.: Multi-unit auctions with unknown supply. In: 7th ACM Conference on Electronic Commerce, pp. 243–249. ACM, New York (2006)
Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)
Marketing Terms.com, http://www.marketingterms.com/dictionary/frequency_cap
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchbinder, N., Feldman, M., Ghosh, A., Naor, J.(. (2011). Frequency Capping in Online Advertising. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-22300-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22299-3
Online ISBN: 978-3-642-22300-6
eBook Packages: Computer ScienceComputer Science (R0)