{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:06Z","timestamp":1725555306241},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_23","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"252-263","source":"Crossref","is-referenced-by-count":3,"title":["Online Cooperative Cost Sharing"],"prefix":"10.1007","author":[{"given":"Janina","family":"Brenner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-79309-0_31","volume-title":"Algorithmic Game Theory","author":"Y. Bleischwitz","year":"2008","unstructured":"Bleischwitz, Y., Schoppmann, F.: Group-strategyproof cost sharing for metric fault tolerant facility location. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 350\u2013361. Springer, Heidelberg (2008)"},{"key":"23_CR2","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-79309-0_28","volume-title":"Algorithmic Game Theory","author":"J. Brenner","year":"2008","unstructured":"Brenner, J., Sch\u00e4fer, G.: Singleton acyclic mechanisms and their applications to scheduling problems. In: Monien, B., Schroeder, U.-P. (eds.) SAGT 2008. LNCS, vol.\u00a04997, pp. 315\u2013326. Springer, Heidelberg (2008)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dss.2004.08.004","volume":"39","author":"N. Devanur","year":"2005","unstructured":"Devanur, N., Mihail, M., Vazirani, V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support. Syst.\u00a039(1), 11\u201322 (2005)","journal-title":"Decision Support. Syst."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","volume":"75","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoretical Computer Sci.\u00a075(3), 347\u2013355 (1990)","journal-title":"Theoretical Computer Sci."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hajiaghayi, M., R\u00e4cke, H.: Oblivious network design. In: Proc.\u00a0of the 17th ACM-SIAM Sympos.\u00a0on Discrete Algorithms, pp. 970\u2013979 (2006)","DOI":"10.1145\/1109557.1109665"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Harks, T., Heinz, S., Pfetsch, M.: Competitive online multicommodity routing. Theory of Computing Systems (2008)","DOI":"10.1007\/11970125_19"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: Dynamic Steiner tree problems. SIAM J.\u00a0Disc.\u00a0Math.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J.\u00a0Disc.\u00a0Math."},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1361192.1361201","volume":"4","author":"N. Immorlica","year":"2008","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms\u00a04(2), 1\u201325 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"23_CR10","unstructured":"Juarez, R.: Group strategyproof cost sharing (2008) (unpublished)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond Moulin mechanisms. In: Proc. \u00a0of the ACM Conference on Electronic Commerce (2007)","DOI":"10.1145\/1250910.1250912"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Soc.\u00a0Choice Welfare\u00a016, 279\u2013320 (1999)","journal-title":"Soc.\u00a0Choice Welfare"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L. Schrage","year":"1968","unstructured":"Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Operations Res.\u00a016, 687\u2013690 (1968)","journal-title":"Operations Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:46:23Z","timestamp":1559083583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}