{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:18Z","timestamp":1766311398641},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T00:00:00Z","timestamp":1322611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00182-011-0312-8","type":"journal-article","created":{"date-parts":[[2011,11,29]],"date-time":"2011-11-29T21:59:44Z","timestamp":1322603984000},"page":"29-53","source":"Crossref","is-referenced-by-count":16,"title":["Strategic cooperation in cost sharing games"],"prefix":"10.1007","volume":"42","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,30]]},"reference":[{"issue":"6","key":"312_CR1","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S Albers","year":"2009","unstructured":"Albers S (2009) On the value of coordination in network design. SIAM J Comput 38(6): 2273\u20132302","journal-title":"SIAM J Comput"},{"issue":"2","key":"312_CR2","doi-asserted-by":"crossref","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 (2009) Strong price of anarchy. Games Econ Behav 65(2): 289\u2013317","journal-title":"Games Econ Behav"},{"issue":"1","key":"312_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/s00224-011-9317-8","volume":"49","author":"E Anshelevich","year":"2011","unstructured":"Anshelevich E, Caskurlu B (2011a) Price of stability in survivable network design. Theory Comput Syst 49(1): 98\u2013138","journal-title":"Theory Comput Syst"},{"issue":"39","key":"312_CR4","doi-asserted-by":"crossref","first-page":"5298","DOI":"10.1016\/j.tcs.2011.05.049","volume":"412","author":"E Anshelevich","year":"2011","unstructured":"Anshelevich E, Caskurlu B (2011b) Exact and approximate equilibria for optimal group network formation. Theor Comput Sci 412(39): 5298\u20135314","journal-title":"Theor Comput Sci"},{"issue":"3","key":"312_CR5","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/090752699","volume":"40","author":"E Anshelevich","year":"2011","unstructured":"Anshelevich E, Karagiozova A (2011) Terminal backup, 3D matching, and covering cubic graphs. SIAM J Comput 40(3): 678\u2013708","journal-title":"SIAM J Comput"},{"issue":"4","key":"312_CR6","doi-asserted-by":"crossref","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 (2008a) The price of stability for network design with fair cost allocation. SIAM J Comput 38(4): 1602\u20131623","journal-title":"SIAM J Comput"},{"key":"312_CR7","doi-asserted-by":"crossref","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 (2008b) Near-optimal network design with selfish agents. Theory Comput 4: 77\u2013109","journal-title":"Theory Comput"},{"key":"312_CR8","unstructured":"Anshelevich E, Caskurlu B, Hate A (2010) Strategic multiway cut and multicut games. In: Proc. 8th intl. workshop approximation and online algorithms (WAOA), pp 1\u201312"},{"key":"312_CR9","first-page":"287","volume-title":"Acceptable points in general cooperative n-person games. In: Contributions to the theory of games IV, vol 40 of annals of mathematics study","author":"R Aumann","year":"1959","unstructured":"Aumann R (1959) Acceptable points in general cooperative n-person games. In: Contributions to the theory of games IV, vol 40 of annals of mathematics study. Princeton University Press, Princeton, pp 287\u2013324"},{"key":"312_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"C Bird","year":"1976","unstructured":"Bird C (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6: 335\u2013350","journal-title":"Networks"},{"issue":"3","key":"312_CR11","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1006\/jcss.1999.1687","volume":"60","author":"G Calinescu","year":"2000","unstructured":"Calinescu G, Karloff H, Rabani Y (2000) An improved approximation algorithm for multiway cut. J Comput Syst Sci 60(3): 564\u2013574","journal-title":"J Comput Syst Sci"},{"issue":"16\u201318","key":"312_CR12","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.tcs.2010.02.005","volume":"411","author":"J Cardinal","year":"2010","unstructured":"Cardinal J, Hoefer M (2010) Non-cooperative facility location and covering games. Theor Comput Sci 411(16\u201318): 1855\u20131876","journal-title":"Theor Comput Sci"},{"issue":"5","key":"312_CR13","doi-asserted-by":"crossref","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H-L Chen","year":"2010","unstructured":"Chen H-L, Roughgarden T, Valiant G (2010) Designing network protocols for good equilibria. SIAM J Comput 39(5): 1799\u20131832","journal-title":"SIAM J Comput"},{"issue":"3","key":"312_CR14","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24(3): 751\u2013766","journal-title":"Math Oper Res"},{"issue":"1","key":"312_CR15","doi-asserted-by":"crossref","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 (2009) Strong equilibrium in cost sharing connection games. Games Econ Behav 67(1): 51\u201368","journal-title":"Games Econ Behav"},{"issue":"1","key":"312_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01545526","volume":"20","author":"U Faigle","year":"1998","unstructured":"Faigle U, Fekete S, Hochst\u00e4ttler W, Kern W (1998) On approximately fair cost allocation in Euclidean TSP games. OR Spektrum 20(1): 29\u201337","journal-title":"OR Spektrum"},{"issue":"2","key":"312_CR17","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"M Goemans","year":"2004","unstructured":"Goemans M, Skutella M (2004) Cooperative facility location games. J Algorithms 50(2): 194\u2013214","journal-title":"J Algorithms"},{"issue":"2","key":"312_CR18","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M Goemans","year":"1995","unstructured":"Goemans M, Williamson D (1995) A general approximation technique for constrained forest problems. SIAM J Comput 24(2): 296\u2013317","journal-title":"SIAM J Comput"},{"key":"312_CR19","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01580585","volume":"34","author":"D Granot","year":"1986","unstructured":"Granot D (1986) A generalized linear production model: a unifying model. Math Prog 34: 212\u2013222","journal-title":"Math Prog"},{"key":"312_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584227","volume":"21","author":"D Granot","year":"1981","unstructured":"Granot D, Huberman G (1981) On minimum cost spanning tree games. Math Prog 21: 1\u201318","journal-title":"Math Prog"},{"key":"312_CR21","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s001820050085","volume":"27","author":"D Granot","year":"1998","unstructured":"Granot D, Maschler M (1998) Spanning network games. Int J Game Theory 27: 467\u2013500","journal-title":"Int J Game Theory"},{"issue":"1","key":"312_CR22","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s00453-007-9014-9","volume":"53","author":"M Hoefer","year":"2009","unstructured":"Hoefer M (2009) Non-cooperative tree creation. Algorithmica 53(1): 104\u2013131","journal-title":"Algorithmica"},{"key":"312_CR23","doi-asserted-by":"crossref","unstructured":"Hoefer M (2010) Strategic cooperation in cost sharing games. In: Proc. 6th intl workshop Internet and network economics (WINE), pp 258\u2013269","DOI":"10.1007\/978-3-642-17572-5_21"},{"issue":"4","key":"312_CR24","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s00453-009-9367-3","volume":"60","author":"M Hoefer","year":"2011","unstructured":"Hoefer M (2011) Competitive cost sharing with economies of scale. Algorithmica 60(4): 743\u2013765","journal-title":"Algorithmica"},{"key":"312_CR25","doi-asserted-by":"crossref","unstructured":"Hoefer M, Krysta P (2005) Geometric network design with selfish agents. In: Proc. 11th conf. computing and combinatorics (COCOON), pp 167\u2013178","DOI":"10.1007\/11533719_19"},{"key":"312_CR26","doi-asserted-by":"crossref","unstructured":"Immorlica N, Mahdian M, Mirrokni V (2008) Limitations of cross-monotonic cost sharing schemes. ACM Trans Algorithms 4(2). doi: 10.1145\/1361192.1361201","DOI":"10.1145\/1361192.1361201"},{"key":"312_CR27","volume-title":"Algorithmic game theory, chapter 15","author":"K Jain","year":"2007","unstructured":"Jain K, Mahdian M (2007) Cost sharing. In: Nisan N, Tardos \u00c9, Roughgarden T, Vazirani V (eds) Algorithmic game theory, chapter 15. Cambridge University Press, Cambridge"},{"key":"312_CR28","doi-asserted-by":"crossref","unstructured":"Jain K, Vazirani V (2001) Applications of approximation algorithms to cooperative games. In: Proc. 33rd symp. theory of computing (STOC), pp 364\u2013372","DOI":"10.1145\/380752.380825"},{"issue":"5","key":"312_CR29","doi-asserted-by":"crossref","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 (2008) A group-strategyproof cost sharing mechanism for the Steiner forest game. SIAM J Comput 37(5): 1319\u20131341","journal-title":"SIAM J Comput"},{"key":"312_CR30","doi-asserted-by":"crossref","unstructured":"Leonardi S, Sankowski P (2007) Network formation games with local coalitions. In Proc. 26th symp. principles of distributed computing (PODC), pp 299\u2013305","DOI":"10.1145\/1281100.1281143"},{"issue":"1","key":"312_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230080104","volume":"8","author":"N Megiddo","year":"1978","unstructured":"Megiddo N (1978) Cost allocation for Steiner trees. Networks 8(1): 1\u20136","journal-title":"Networks"},{"key":"312_CR32","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BF01681356","volume":"9","author":"G Owen","year":"1975","unstructured":"Owen G (1975) On the core of linear production games. Math Prog 9: 358\u2013370","journal-title":"Math Prog"},{"key":"312_CR33","unstructured":"P\u00e1l M, Tardos \u00c9 (2003) Group strategyproof mechanisms via primal-dual algorithms. In: Proc. 44th symp. foundations of computer science (FOCS), pp 584\u2013593"},{"key":"312_CR34","unstructured":"Prodon A, Libeling TM, Gr\u00f6flin H (1985) Steiner\u2019s problem on two-trees. Technical report, D\u00e9partment de Mathem\u00e1tiques, EPF Lausanne. Working paper RO 850315"},{"key":"312_CR35","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02099700","volume":"57","author":"D Skorin-Karpov","year":"1995","unstructured":"Skorin-Karpov D (1995) On the core of the minimum cost Steiner tree game in networks. Ann Oper Res 57: 233\u2013249","journal-title":"Ann Oper Res"},{"key":"312_CR36","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01594930","volume":"50","author":"A Tamir","year":"1991","unstructured":"Tamir A (1991) On the core of network synthesis games. Math Prog 50: 123\u2013135","journal-title":"Math Prog"},{"key":"312_CR37","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/trsc.27.1.81","volume":"27","author":"A Tamir","year":"1993","unstructured":"Tamir A (1993) On the core of cost allocation games defined on location problems. Transp Sci 27: 81\u201386","journal-title":"Transp Sci"},{"issue":"3","key":"312_CR38","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R Wong","year":"1984","unstructured":"Wong R (1984) A dual ascent approach for Steiner tree problems on a directed graph. Math Prog 28(3): 271\u2013287","journal-title":"Math Prog"},{"key":"312_CR39","first-page":"1194","volume-title":"Handbook of game theory with economic applications vol 2, Chap 34","author":"HP Young","year":"1994","unstructured":"Young HP (1994) Cost allocation. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications vol 2, Chap 34. North-Holland Science Publishers, Amsterdam, pp 1194\u20131235"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-011-0312-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-011-0312-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-011-0312-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T23:48:46Z","timestamp":1560988126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-011-0312-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,30]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["312"],"URL":"https:\/\/doi.org\/10.1007\/s00182-011-0312-8","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,30]]}}}