{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:10:33Z","timestamp":1725617433519},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","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-24829-0_4","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T13:11:38Z","timestamp":1317647498000},"page":"19-30","source":"Crossref","is-referenced-by-count":8,"title":["Prompt Mechanism for Ad Placement over Time"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ety","family":"Khaitsin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Hartline, J.D.: Knapsack auctions. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2006)","DOI":"10.1145\/1109557.1109677"},{"key":"4_CR2","first-page":"761","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003","author":"N. Andelman","year":"2003","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for qos switches. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 761\u2013770. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/978-3-540-70575-8_68","volume-title":"Automata, Languages and Programming","author":"Y. Azar","year":"2008","unstructured":"Azar, Y., Gamzu, I.: Truthful unification framework for packing integer programs with choices. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 833\u2013844. Springer, Heidelberg (2008)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Blumrosen, L., Roth, A.L.: Auctions with online supply. In: Fifth Workshop on Ad Auctions (2009)","DOI":"10.1145\/1807342.1807345"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-24749-4_17","volume-title":"STACS 2004","author":"Y. Bartal","year":"2004","unstructured":"Bartal, Y., Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Lavi, R.: Online competitive algorithms for maximizing weighted throughput of unit jobs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Borgs, C., Immorlica, N., Chayes, J., Jain, K.: Dynamics of bid optimization in online advertisement auctions. In: Proceedings of the 16th International World Wide Web Conference, pp. 13\u2013723 (2007)","DOI":"10.1145\/1242572.1242644"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Gamzu, I.: Truthful mechanisms via greedy iterative packing. In: Proceedings 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 56\u201369 (2009)","DOI":"10.1007\/978-3-642-03685-9_5"},{"key":"4_CR8","first-page":"713","volume-title":"A polynomial time approximation scheme for the multiple knapsack problem","author":"C. Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem, vol.\u00a035, pp. 713\u2013728. Society for Industrial and Applied Mathematics, Philadelphia (2005)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tich, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. \u00a04, 255\u2013276 (2006)","DOI":"10.1016\/j.jda.2005.03.005"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: Does timesharing or randomization help? \u00a037, 149\u2013164 (2003)","DOI":"10.1007\/s00453-003-1025-6"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-79309-0_16","volume-title":"Algorithmic Game Theory","author":"R. Cole","year":"2008","unstructured":"Cole, R., Dobzinski, S., Fleischer, L.: Prompt mechanisms for online auctions. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 170\u2013181. Springer, Heidelberg (2008)"},{"key":"4_CR12","first-page":"209","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"M. Englert","year":"2007","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in qos switches. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 209\u2013218. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"4_CR13","unstructured":"Fidanova, S.: Heuristics for multiple knapsack problem. In: IADIS AC, pp. 255\u2013260 (2005)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-48413-4_6","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H.: A polynomial time approximation scheme for the multiple knapsack problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 51\u201362. Springer, Heidelberg (1999)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in qos switches. SIAM Journal on Computing, 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"4_CR16","first-page":"206","volume-title":"Proceedings of the 18th Annual Symposium on Foundations of Computer Science","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp. 206\u2013213. IEEE Computer Society, Washington, DC (1977)"},{"key":"4_CR17","first-page":"199","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"F. Li","year":"2007","unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 199\u2013208. Society for Industrial and Applied Mathematics, Philadelphia (2007)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume-title":"Internet and Network Economics","author":"Y. Zhou","year":"2008","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 566\u2013576. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:57:10Z","timestamp":1560729430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}