{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:42Z","timestamp":1725491802141},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_24","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T23:46:33Z","timestamp":1189727193000},"page":"253-264","source":"Crossref","is-referenced-by-count":114,"title":["Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue"],"prefix":"10.1007","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[]},{"given":"Kamal","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: Proceedings of the 35th STOC, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Andelman, N., Mansour, Y.: Auctions with budget constraints. In: Proc. of the 9th Scandinavian Workshop on Algorithm Theory, pp. 26\u201338 (2004)","DOI":"10.1007\/978-3-540-27810-8_4"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM\u00a044(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"24_CR4","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: Proc. of the 34th Annual Symposium on Foundations of Computer Science, pp. 32\u201340 (1993)"},{"key":"24_CR5","unstructured":"Blum, A., Hartline, J.: Near-optimal online auctions (2005)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Proc. of the 6th EC, pp. 44\u201351 (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Proc. of the 13th Annual European Symposium on Algorithms, pp. 689\u2013701 (2005)","DOI":"10.1007\/11561071_61"},{"key":"24_CR8","unstructured":"Buchbinder, N., Naor, J.: A primal-dual approach to online routing and packing. In: Proc. of the 47th Annual Symposium on Foundations of Computer Science, pp. 293\u2013204 (2006)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"D.R. Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S., Scott, S.D.: On-line analysis of the TCP acknowledgement delay problem. Journal of the ACM\u00a048, 243\u2013273 (2001)","journal-title":"Journal of the ACM"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/jcss.2001.1755","volume":"63","author":"A. Goel","year":"2001","unstructured":"Goel, A., Meyerson, A., Plotkin, S.A.: Combining fairness with throughput: Online routing with multiple objectives. J. Comput. Syst. Sci.\u00a063(1), 62\u201379 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-2","key":"24_CR11","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. Theoretical Computer Science\u00a0233(1-2), 319\u2013325 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e-1). In: Proc. of the 33rd Symposium on Theory of Computing, pp. 502\u2013509 (2001)","DOI":"10.1145\/380752.380845"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R., Vazirani, U., Vazirani, V.: An optimal algorithm for online bipartite matching. In: Proceedings of the 22nd Annual Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Saberi, A.: Multi-unit auctions with unknown supply. In: EC 2006. Proceedings of the 7th ACM conference on Electronic commerce, pp. 243\u2013249 (2006)","DOI":"10.1145\/1134707.1134734"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: Proc. of the 46th IEEE Symp. on Foundations of Computer Science, pp. 264\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"key":"24_CR16","first-page":"243","volume":"38","author":"S. Robinson","year":"2005","unstructured":"Robinson, S.: Computer scientists optimize innovative ad auction. SIAM News\u00a038, 243\u2013273 (2005)","journal-title":"SIAM News"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:22:49Z","timestamp":1619504569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":16,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-540-75520-3_24","relation":{},"subject":[]}}
