{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:59:23Z","timestamp":1743080363679,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_13","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"147-158","source":"Crossref","is-referenced-by-count":3,"title":["Frequency Capping in Online Advertising"],"prefix":"10.1007","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moran","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-77105-0_57","volume-title":"3rd International Workshop on Internet and Network Economics","author":"Z. Abrams","year":"2007","unstructured":"Abrams, Z., Vee, E.: Personalized ad delivery when ads fatigue: An approximation algorithm. In: 3rd International Workshop on Internet and Network Economics, pp. 535\u2013540. Springer, Heidelberg (2007)"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Transactions on Algorithms\u00a02(4), 640\u2013660 (2006)","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/060661946","volume":"39","author":"N. Alon","year":"2009","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput.\u00a039(2), 361\u2013370 (2009)","journal-title":"SIAM J. Comput."},{"key":"13_CR4","first-page":"507","volume-title":"48th Annual IEEE Symposium on Foundations of Computer Science","author":"N. Bansal","year":"2007","unstructured":"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\u2013517. IEEE Computer Society, Washington, DC (2007)"},{"key":"13_CR5","first-page":"235","volume-title":"40th ACM Symposium on Theory of Computer Science","author":"N. Bansal","year":"2008","unstructured":"Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. In: 40th ACM Symposium on Theory of Computer Science, pp. 235\u2013244. ACM, New York (2008)"},{"key":"13_CR6","first-page":"726","volume-title":"18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"N. Bansal","year":"2007","unstructured":"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\u2013735. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"13_CR7","first-page":"1156","volume-title":"16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A. Blum","year":"2005","unstructured":"Blum, A., Hartline, J.: Near-optimal online auctions. In: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1156\u20131163. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"issue":"2-3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2004.05.012","volume":"324","author":"A. Blum","year":"2004","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. Theor. Comput. Sci.\u00a0324(2-3), 137\u2013146 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res.\u00a034(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"key":"13_CR10","first-page":"293","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science","author":"N. Buchbinder","year":"2006","unstructured":"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\u2013304. IEEE Computer Society, Washington, DC (2006)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"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.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J. Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 374\u2013385. Springer, Heidelberg (2009)"},{"key":"13_CR13","first-page":"117","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science","author":"J. Feldman","year":"2009","unstructured":"Feldman, J., Mehta, A., Mirrokni, V.S., Muthukrishnan, S.: Online stochastic matching: Beating 1\u2009\u2212\u20091\/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126. IEEE Computer Society, Washington, DC (2009)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-77105-0_35","volume-title":"Internet and Network Economics","author":"G. Goel","year":"2007","unstructured":"Goel, G., Mehta, A.: Adwords auctions with decreasing valuation bids. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 335\u2013340. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci.\u00a0233(1-2), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","first-page":"352","volume-title":"22nd Annual ACM Symposium on Theory of Computing","author":"R.M. Karp","year":"1990","unstructured":"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\u2013358. ACM, New York (1990)"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/1134707.1134734","volume-title":"7th ACM Conference on Electronic Commerce","author":"M. Mahdian","year":"2006","unstructured":"Mahdian, M., Saberi, A.: Multi-unit auctions with unknown supply. In: 7th ACM Conference on Electronic Commerce, pp. 243\u2013249. ACM, New York (2006)"},{"issue":"5","key":"13_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A. Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM\u00a054(5), 22 (2007)","journal-title":"J. ACM"},{"key":"13_CR19","unstructured":"Marketing Terms.com, http:\/\/www.marketingterms.com\/dictionary\/frequency_cap"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T01:38:17Z","timestamp":1638236297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_13"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}