{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:19:59Z","timestamp":1737091199774,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_57","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"670-681","source":"Crossref","is-referenced-by-count":13,"title":["Cost Sharing Methods for Makespan and Completion Time Scheduling"],"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":[{"issue":"1","key":"57_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A. Archer","year":"2004","unstructured":"Archer, A., et al.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047(1), 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"57_CR2","first-page":"482","volume-title":"Proc. of the 42nd Annual Sympos. on Foundations of Computer Science","author":"A. Archer","year":"2001","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proc. of the 42nd Annual Sympos. on Foundations of Computer Science, pp. 482\u2013491. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"57_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11758471_19","volume-title":"Algorithms and Complexity","author":"Y. Bleischwitz","year":"2006","unstructured":"Bleischwitz, Y., Monien, B.: Fair cost-sharing methods for scheduling jobs on parallel machines. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 175\u2013186. Springer, Heidelberg (2006)"},{"key":"57_CR4","unstructured":"Chawla, S., Roughgarden, T., Sundararajan, M.: Optimal cost-sharing mechanisms for steiner forest problems. Submitted to WINE"},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(03)00085-9","volume":"304","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., et al.: Hardness results for multicast cost-sharing. Theoretical Computer Science\u00a0304, 215\u2013236 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"57_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. J. Comput. System Sci., Special issue on internet algorithms\u00a063(1), 21\u201341 (2001)","journal-title":"J. Comput. System Sci."},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"Graham, R., et al.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0047-2727(76)90049-9","volume":"6","author":"J. Green","year":"1976","unstructured":"Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Economics\u00a06, 375\u2013394 (1976)","journal-title":"Journal of Public Economics"},{"key":"57_CR9","unstructured":"Gupta, A., et al.: An efficient cost-sharing mechanism for the prize-collecting steiner forest problem. In: ACM-SIAM Sympos. on Discrete Algorithms, ACM Press, New York (to appear, 2007)"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., Srinivasan, A., Tardos, \u00c9.: Cost-sharing mechanisms for network design. In: Proc. of the Seventh Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (2004)","DOI":"10.1007\/978-3-540-27821-4_13"},{"key":"57_CR11","unstructured":"Heydenreich, B., M\u00fcller, R., Uetz, M.: Decentralization and mechanism design for online machine scheduling. Unpublished manuscript"},{"key":"57_CR12","volume-title":"Approximation Algorithms for NP-hard Problems","author":"D. Hochbaum","year":"1997","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"57_CR13","first-page":"602","volume-title":"Proc. of the Sixteenth Annual ACM-SIAM Sympos. on Discrete Algorithms","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost sharing schemes. In: Proc. of the Sixteenth Annual ACM-SIAM Sympos. on Discrete Algorithms, pp. 602\u2013611. ACM Press, New York (2005)"},{"key":"57_CR14","first-page":"364","volume-title":"Proc. of the 33rd Annual ACM Sympos. on the Theory of Computing (STOC)","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proc. of the 33rd Annual ACM Sympos. on the Theory of Computing (STOC), pp. 364\u2013372. ACM Press, New York (2001)"},{"key":"57_CR15","unstructured":"Kent, K., Skorin-Kapov, D.: Population monotonic cost allocations on MSTs. In: Proc. of the 6th Int. Conf. on Operational Research (Rovinj, 1996), pp. 43\u201348. Croatian Oper. Res. Soc., Zagreb (1996)"},{"key":"57_CR16","first-page":"612","volume-title":"Proc. of the Sixteenth Annual ACM-SIAM Sympos. on Discrete Algorithms","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G.: A group-strategyproof mechanism for Steiner forests. In: Proc. of the Sixteenth Annual ACM-SIAM Sympos. on Discrete Algorithms, pp. 612\u2013619. ACM Press, New York (2005)"},{"key":"57_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1007\/11523468_75","volume-title":"Automata, Languages and Programming","author":"J. K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., et al.: From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 930\u2013942. Springer, Heidelberg (2005)"},{"key":"57_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kovacs","year":"2005","unstructured":"Kovacs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, Springer, Heidelberg (2005)"},{"issue":"1-3","key":"57_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.tcs.2004.07.033","volume":"326","author":"S. Leonardi","year":"2004","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci.\u00a0326(1-3), 431\u2013442 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"57_CR20","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econom. Theory\u00a018(3), 511\u2013533 (2001)","journal-title":"Econom. Theory"},{"key":"57_CR21","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Games and Economic Behavior, pp. 166\u2013196 (2001)","DOI":"10.1006\/game.1999.0790"},{"key":"57_CR22","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proc. of the 44th Sympos. on the Foundations of Computer Science (FOCS), pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"57_CR23","volume-title":"Proc. of the ACM Conference on Electronic Commerce","author":"R. Porter","year":"2004","unstructured":"Porter, R.: Mechanism design for online real-time scheduling. In: Proc. of the ACM Conference on Electronic Commerce, ACM Press, New York (2004)"},{"key":"57_CR24","volume-title":"Aggregation and Revelation of Preferences","author":"K. Roberts","year":"1979","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences, North-Holland, Amsterdam (1979)"},{"key":"57_CR25","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: STOC (2006)","DOI":"10.1145\/1132516.1132528"},{"key":"57_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: Approximately efficient cost-sharing mechanisms. arXiv report (June 2006), http:\/\/www.arxiv.org\/pdf\/cs.GT\/0606127","DOI":"10.1145\/1132516.1132528"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T15:49:25Z","timestamp":1737042565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_57","relation":{},"subject":[]}}