{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T01:18:40Z","timestamp":1771377520891,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T00:00:00Z","timestamp":1256601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s00453-009-9367-3","type":"journal-article","created":{"date-parts":[[2009,10,26]],"date-time":"2009-10-26T15:08:16Z","timestamp":1256569696000},"page":"743-765","source":"Crossref","is-referenced-by-count":15,"title":["Competitive Cost Sharing with Economies of Scale"],"prefix":"10.1007","volume":"60","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,27]]},"reference":[{"issue":"6","key":"9367_CR1","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S. Albers","year":"2009","unstructured":"Albers, S.: On the value of coordination in network design. SIAM J. Comput. 38(6), 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"key":"9367_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M.: Hardness of buy-at-bulk network design. In: Proc. of the 45th Symp. on Foundations of Computer Science (FOCS), pp.\u00a0115\u2013124 (2004)","DOI":"10.1109\/FOCS.2004.32"},{"key":"9367_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Caskurlu, B.: Exact and approximate equilibria for optimal groupnetwork formation. In: Proc. of the 17th European Symposium on Algorithms (ESA), pp.\u00a0239\u2013250 (2009)","DOI":"10.1007\/978-3-642-04128-0_21"},{"key":"9367_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Caskurlu, B.: Price of stability in survivable network design. In: Proc. of the 2nd Intl. Symp. on Algorithmic Game Theory (SAGT), pp.\u00a0208\u2013219 (2009)","DOI":"10.1007\/978-3-642-04645-2_19"},{"issue":"4","key":"9367_CR5","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.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9367_CR6","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.: Near-optimal network design with selfish agents. Theory Comput. 4, 77\u2013109 (2008)","journal-title":"Theory Comput."},{"key":"9367_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proc. of the 38th Symp. on Foundations of Computer Science (FOCS), pp.\u00a0542\u2013547 (1997)","DOI":"10.1109\/SFCS.1997.646143"},{"key":"9367_CR8","doi-asserted-by":"crossref","unstructured":"Bil\u00f3, V., Fanelli, A., Flammini, M., Moscardelli, L.: When ignorance helps: Graphical multicast cost sharing games. In: Proc. of the 33rd Intl. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.\u00a0108\u2013119 (2008)","DOI":"10.1007\/978-3-540-85238-4_8"},{"key":"9367_CR9","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Hoefer, M.: Selfish service installation in networks. In: Proc. of the 2nd Intl. Workshop on Internet & Network Economics (WINE), pp.\u00a0174\u2013185 (2006)","DOI":"10.1007\/11944874_17"},{"key":"9367_CR10","doi-asserted-by":"crossref","unstructured":"Charikar, M., Karloff, H., Mathieu, C., Naor, J., Saks, M.: Online multicast with egalitarian cost sharing. In: Proc. of the 20th Symp. on Parallelism in Algorithms and Architectures (SPAA), pp.\u00a070\u201376 (2008)","DOI":"10.1145\/1378533.1378544"},{"key":"9367_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Taghi Hajiaghayi, M., Kortarz, G., Salavatipour, M.: Approximation algorithms for non-uniform buy-at-bulk network design. In: Proc. of the 47th Symp. on Foundations of Computer Science (FOCS), pp.\u00a0677\u2013686 (2006)","DOI":"10.1109\/FOCS.2006.15"},{"issue":"6","key":"9367_CR12","doi-asserted-by":"crossref","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. Areas Commun. 25(6), 1193\u20131206 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9367_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Taghi Hajiaghayi, M., Kortsarz, G., Salavatipour, M.: Approximation algorithms for node-weighted buy-at-bulk networks. In: Proc. of the 18th Symp. on Discrete Algorithms (SODA) (2007)","DOI":"10.1109\/FOCS.2006.15"},{"issue":"2","key":"9367_CR14","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H.-L. Chen","year":"2009","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"9367_CR15","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing networks with good equilibria. In: Proc. of the 19th Symp. on Discrete Algorithms (SODA), pp.\u00a0854\u2013863 (2008)"},{"issue":"3","key":"9367_CR16","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X. Deng","year":"2000","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H., Zhang, W.: Totally balanced combinatorial optimization games. Math. Program. 87(3), 441\u2013452 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"9367_CR17","doi-asserted-by":"crossref","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 problems. Decis. Support Syst. 39(1), 11\u201322 (2005)","journal-title":"Decis. Support Syst."},{"key":"9367_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"H. Eiselt","year":"1993","unstructured":"Eiselt, H., Laporte, G., Thisse, J.-F.: Competitive location models: a\u00a0framework and bibliography. Transp. Sci. 27, 44\u201354 (1993)","journal-title":"Transp. Sci."},{"issue":"1","key":"9367_CR19","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.: Strong equilibrium in cost sharing connection games. Games Econ. Behav. 67(1), 51\u201368 (2009)","journal-title":"Games Econ. Behav."},{"key":"9367_CR20","doi-asserted-by":"crossref","unstructured":"Fanelli, A., Flammini, M., Melideo, G., Moscardelli, L.: Multicast transmissions in non-cooperative networks with a limited number of selfish moves. In: Proc. of the 31st Intl. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.\u00a0363\u2013374 (2006)","DOI":"10.1007\/11821069_32"},{"issue":"2","key":"9367_CR21","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.: Cooperative facility location games. J.\u00a0Algorithms 50(2), 194\u2013214 (2004)","journal-title":"J.\u00a0Algorithms"},{"issue":"3","key":"9367_CR22","first-page":"11","volume":"54","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J.\u00a0ACM 54(3), 11 (2007)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9367_CR23","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M. Taghi Hajiaghayi","year":"2003","unstructured":"Taghi Hajiaghayi, M., Mahdian, M., Mirrokni, V.: The facility location problem with general cost functions. Networks 42(1), 42\u201347 (2003)","journal-title":"Networks"},{"key":"9367_CR24","doi-asserted-by":"crossref","unstructured":"Hoefer, M.: Non-cooperative facility location and covering games. In: Proc. of the 17th Intl. Symp. on Algorithms and Computation (ISAAC), pp.\u00a0369\u2013378 (2006)","DOI":"10.1007\/11940128_38"},{"key":"9367_CR25","unstructured":"Hoefer, M.: Cost Sharing and Clustering under Distributed Competition. Ph.D. thesis, Lehrstuhl Algorithmik, Universit\u00e4t Konstanz (2007)"},{"key":"9367_CR26","doi-asserted-by":"crossref","unstructured":"Hoefer, M.: Competitive cost sharing with economies of scale. In: Proc. of the 8th Latin American Theoretical Informatics Conference (LATIN), pp.\u00a0339\u2013349 (2008)","DOI":"10.1007\/978-3-540-78773-0_30"},{"issue":"1","key":"9367_CR27","doi-asserted-by":"crossref","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 53(1), 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"9367_CR28","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. ACM Trans. Algorithms 4(2) (2008). Special Issue SODA 2005","DOI":"10.1145\/1361192.1361201"},{"issue":"6","key":"9367_CR29","first-page":"795","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J.\u00a0ACM 50(6), 795\u2013824 (2003)","journal-title":"J.\u00a0ACM"},{"key":"9367_CR30","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. of the 16th Symp. on Theoretical Aspects of Computer Science (STACS), pp.\u00a0404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9367_CR31","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sankowsi, P.: Network formation games with local coalitions. In: Proc. of the 26th Symp. on Principles of Distributed Computing (PODC), pp.\u00a0299\u2013305 (2007)","DOI":"10.1145\/1281100.1281143"},{"key":"9367_CR32","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Sun, Z., Wang, W.: Cost sharing and strategyproof mechanisms for set cover games. In: Proc. of the 22nd Symp. on Theoretical Aspects of Computer Science (STACS), pp.\u00a0218\u2013230 (2005)","DOI":"10.1007\/978-3-540-31856-9_18"},{"key":"9367_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03280-0","volume-title":"Equilibrium Facility Location in Networks","author":"T. Miller","year":"1996","unstructured":"Miller, T., Friesz, T., Tobin, R.: Equilibrium Facility Location in Networks. Springer, Berlin (1996)"},{"key":"9367_CR34","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proc. of the 44th Symp. on Foundations of Computer Science (FOCS), pp.\u00a0584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"9367_CR35","doi-asserted-by":"crossref","unstructured":"Sun, Z., Li, X.-Y., Wang, W., Chu, X.: Mechanism design for set cover games when elements are agents. In: Proc. of the 1st Intl. Conf. on Algorithmic Applications in Management (AAIM), pp.\u00a0360\u2013369 (2005)","DOI":"10.1007\/11496199_39"},{"key":"9367_CR36","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2000","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2000)"},{"key":"9367_CR37","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In: Proc. of the 43th Symp. on Foundations of Computer Science (FOCS), pp.\u00a0416 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9367-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9367-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9367-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T22:44:35Z","timestamp":1739400275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9367-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,27]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9367"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9367-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,27]]}}}