{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:29:43Z","timestamp":1758270583249,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_16","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"170-181","source":"Crossref","is-referenced-by-count":14,"title":["Prompt Mechanisms for Online Auctions"],"prefix":"10.1007","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Dobzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Fleischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","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., Sgall, J., Tich\u00fd, T.: 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)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica\u00a037(3), 149\u2013164 (2003)","journal-title":"Algorithmica"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-540-30140-0_20","volume-title":"Algorithms \u2013 ESA 2004","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Jawor, W., Sgall, J., Tich\u00fd, T.: Improved online algorithms for buffer management in QoS switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 204\u2013215. Springer, Heidelberg (2004)"},{"key":"16_CR4","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management. In: SODA 2007 (2007)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Friedman, E.J., Parkes, D.C.: Pricing wifi at starbucks: issues in online mechanism design. In: EC 2003 (2003)","DOI":"10.1145\/779928.779978"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. In: Games and Economic Behavior (2006)","DOI":"10.1016\/j.geb.2006.02.003"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Mahdian, M., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2005 (2005)","DOI":"10.1145\/988772.988784"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: STOC, pp. 520\u2013529 (2001)","DOI":"10.1145\/380752.380847"},{"key":"16_CR9","unstructured":"Lavi, R., Nisan, N.: Online ascending auctions for gradually expiring items. In: SODA 2005 (2005)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: ACM Conference on Electronic Commerce, pp. 233\u2013241 (2000)","DOI":"10.1145\/352871.352897"},{"key":"16_CR11","unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: SODA 2007 (2007)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Saberi, A.: Multi-unit auctions with unknown supply. In: EC 2006 (2006)","DOI":"10.1145\/1134707.1134734"},{"key":"16_CR13","unstructured":"Mu\u2019alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: AAAI 2002 (2002)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC (1999)","DOI":"10.1145\/301250.301287"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:50:09Z","timestamp":1657561809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}