{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:13:16Z","timestamp":1725570796550},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"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-17572-5_21","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"258-269","source":"Crossref","is-referenced-by-count":4,"title":["Strategic Cooperation in Cost Sharing Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econom. Behav.\u00a065(2), 289\u2013317 (2009)","journal-title":"Games Econom. Behav."},{"key":"21_CR2","unstructured":"Anshelevich, E., Cascurlu, B., Hate, A.: Strategic multiway cut and multicut games. In: Proc. 8th Intl. Workshop Approximation and Online Algorithms, WAOA (to appear, 2010)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-04128-0_21","volume-title":"Algorithms - ESA 2009","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and approximate equilibria for optimal group network formation. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 239\u2013250. Springer, Heidelberg (2009)"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, \u00c9., Wexler, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput.\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. Theory of Computing\u00a04, 77\u2013109 (2008)","journal-title":"Theory of Computing"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Karagiozova, A.: Terminal backup, 3D matching, and covering cubic graphs. In: Proc. 39th Symp. Theory of Computing (STOC), pp. 391\u2013400 (2007)","DOI":"10.1145\/1250790.1250849"},{"key":"21_CR7","series-title":"Annals of Mathematics Study","first-page":"287","volume-title":"Contributions to the Theory of Games IV","author":"R. Aumann","year":"1959","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV. Annals of Mathematics Study, vol.\u00a040, pp. 287\u2013324. Princeton University Press, Princeton (1959)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C. Bird","year":"1976","unstructured":"Bird, C.: On cost allocation for a spanning tree: A game theoretic approach. Networks\u00a06, 335\u2013350 (1976)","journal-title":"Networks"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G. Calinescu","year":"2000","unstructured":"Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. Syst. Sci.\u00a060(3), 564\u2013574 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"16\u201318","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J. Cardinal","year":"2010","unstructured":"Cardinal, J., Hoefer, M.: Non-cooperative facility location and covering games. Theoret. Comput. Sci.\u00a0411(16\u201318), 1855\u20131876 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/JSAC.2007.070813","volume":"25","author":"C. Chekuri","year":"2007","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE J. Sel. Area Comm.\u00a025(6), 1193\u20131206 (2007)","journal-title":"IEEE J. Sel. Area Comm."},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H.-L. Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput.\u00a039(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X. Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res.\u00a024(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.geb.2008.07.002","volume":"67","author":"A. Epstein","year":"2009","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. Games Econom. Behav.\u00a067(1), 51\u201368 (2009)","journal-title":"Games Econom. Behav."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"M. Goemans","year":"2004","unstructured":"Goemans, M., Skutella, M.: Cooperative facility location games. J. Algorithms\u00a050(2), 194\u2013214 (2004)","journal-title":"J. Algorithms"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput.\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF01580585","volume":"34","author":"D. Granot","year":"1986","unstructured":"Granot, D.: A generalized linear production model: A unifying model. Math. Prog.\u00a034, 212\u2013222 (1986)","journal-title":"Math. Prog."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D. Granot","year":"1981","unstructured":"Granot, D., Huberman, G.: On minimum cost spanning tree games. Math. Prog.\u00a021, 1\u201318 (1981)","journal-title":"Math. Prog."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s001820050085","volume":"27","author":"D. Granot","year":"1998","unstructured":"Granot, D., Maschler, M.: Spanning network games. Intl. J. Game Theory\u00a027, 467\u2013500 (1998)","journal-title":"Intl. J. Game Theory"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-007-9014-9","volume":"53","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M.: Non-cooperative tree creation. Algorithmica\u00a053(1), 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Hoefer, M.: Strategic cooperation in cost sharing games. arXiv 1003.3131 (March 2010)","DOI":"10.1007\/978-3-642-17572-5_21"},{"key":"#cr-split#-21_CR22.1","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. ACM Trans. Algorithms??4(2) (2008);","DOI":"10.1145\/1361192.1361201"},{"key":"#cr-split#-21_CR22.2","unstructured":"Special Issue SODA 2005"},{"issue":"5","key":"21_CR23","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/050646408","volume":"37","author":"J. K\u00f6nemann","year":"2008","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G., van Zwam, S.: A group-strategyproof cost sharing mechanism for the Steiner forest game. SIAM J. Comput.\u00a037(5), 1319\u20131341 (2008)","journal-title":"SIAM J. Comput."},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G. Owen","year":"1975","unstructured":"Owen, G.: On the core of linear production games. Math. Prog.\u00a09, 358\u2013370 (1975)","journal-title":"Math. Prog."},{"key":"#cr-split#-21_CR25.1","unstructured":"Prodon, A., Libeling, T., Gr??flin, H.: Steiner???s problem on two-trees. Technical report, D??partment de Mathem??tiques, EPF Lausanne (1985);"},{"key":"#cr-split#-21_CR25.2","unstructured":"Working paper RO 850315"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01594930","volume":"50","author":"A. Tamir","year":"1991","unstructured":"Tamir, A.: On the core of network synthesis games. Math. Prog.\u00a050, 123\u2013135 (1991)","journal-title":"Math. Prog."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:54:38Z","timestamp":1559840078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}