{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:38:02Z","timestamp":1761597482057},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T00:00:00Z","timestamp":1390435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10951-014-0367-z","type":"journal-article","created":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T06:06:50Z","timestamp":1390370810000},"page":"385-398","source":"Crossref","is-referenced-by-count":17,"title":["Frequency capping in online advertising"],"prefix":"10.1007","volume":"17","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[]},{"given":"Moran","family":"Feldman","sequence":"additional","affiliation":[]},{"given":"Arpita","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,23]]},"reference":[{"key":"367_CR1","unstructured":"Abrams, Z., & Vee, E. (2007). Personalized ad delivery when ads fatigue: An approximation algorithm. In WINE \u201907: Workshop on Internet and Network, Economics (pp. 535\u2013540)."},{"issue":"4","key":"367_CR2","doi-asserted-by":"crossref","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. (2006). A general approach to online network optimization problems. ACM Transactions on Algorithms, 2(4), 640\u2013660.","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"367_CR3","doi-asserted-by":"crossref","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. (2009). The online set cover problem. SIAM Journal on Computing, 39(2), 361\u2013370.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"367_CR4","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1145\/1721837.1721851","volume":"6","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Chen, N., Cherniavsky, N., Rudra, A., Schieber, B., & Sviridenko, M. (2010). Dynamic pricing for impatient bidders. ACM Transactions on Algorithms, 6(2), 726\u2013735.","journal-title":"ACM Transactions on Algorithms"},{"issue":"4","key":"367_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2339123.2339126","volume":"59","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Buchbinder, N., & Naor, J. (2012a). A primal-dual randomized algorithm for weighted paging. Journal of the ACM, 59(4), 19.","journal-title":"Journal of the ACM"},{"issue":"2","key":"367_CR6","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/090779000","volume":"41","author":"Nl Bansal","year":"2012","unstructured":"Bansal, Nl, Buchbinder, N., & Naor, J. (2012b). Randomized competitive algorithms for generalized caching. SIAM Journal of Computing, 41(2), 391\u2013414.","journal-title":"SIAM Journal of Computing"},{"key":"367_CR7","unstructured":"Blum, A., & Hartline, J. (2005). Near-optimal online auctions. In SODA \u201905: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1156\u20131163)."},{"issue":"2\u20133","key":"367_CR8","doi-asserted-by":"crossref","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. (2004). Online learning in online auctions. Theoretical Computer Sciences, 324(2\u20133), 137\u2013146.","journal-title":"Theoretical Computer Sciences"},{"key":"367_CR9","unstructured":"Buchbinder, N., & Naor, J. (2006). Improved bounds for online routing and packing via a primal-dual approach. In FOCS \u201906: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer, Science (pp. 293\u2013304)."},{"issue":"2","key":"367_CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., & Naor, J. (2009). Online primal-dual algorithms for covering and packing problems. Mathematics of Operations Research, 34(2), 270\u2013286.","journal-title":"Mathematics of Operations Research"},{"key":"367_CR11","unstructured":"Buchbinder, N., Jain, K., & Naor, J. (2007). Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA \u201907: Proceedings of the 15th Annual European Symposium (pp. 253\u2013264)."},{"key":"367_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., & P\u00e1l, M. (2009a). Online ad assignment with free disposal. In WINE \u201909: Proceedings of the 5th International Workshop on Internet and Network, Economics (pp. 374\u2013385).","DOI":"10.1007\/978-3-642-10841-9_34"},{"key":"367_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V. S., & Muthukrishnan, S. (2009b). Online stochastic matching: Beating 1\u20131\/e. In 50th Annual IEEE Symposium on Foundations of Computer Science.","DOI":"10.1109\/FOCS.2009.72"},{"key":"367_CR14","unstructured":"Goel, G., & Mehta, A. (2007). Adwords auctions with decreasing valuation bids. In WINE \u201907: Workshop on Internet and Network, Economics (pp. 335\u2013340)."},{"issue":"1\u20132","key":"367_CR15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., & Pruhs, K. R. (2000). An optimal deterministic algorithm for online b-matching. Theoretical Computer Science, 233(1\u20132), 319\u2013325.","journal-title":"Theoretical Computer Science"},{"key":"367_CR16","unstructured":"Karp, R. M., Vazirani, U. V., & Vazirani, V. V. (1990). An optimal algorithm for on-line bipartite matching. In STOC \u201990: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (pp. 352\u2013358)."},{"key":"367_CR17","unstructured":"Mahdian, M., & Saberi, A. (2006). Multi-unit auctions with unknown supply. In EC \u201906: Proceedings of the 7th ACM Conference on Electronic Commerce (pp. 243\u2013249)."},{"issue":"5","key":"367_CR18","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1284320.1284321","volume":"54","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., & Vazirani, V. (2007). Adwords and generalized online matching. Journal of the ACM, 54(5), 22.","journal-title":"Journal of the ACM"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0367-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0367-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0367-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:49Z","timestamp":1559453989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0367-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,23]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["367"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0367-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,23]]}}}