{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:42:14Z","timestamp":1770140534971,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540496946","type":"print"},{"value":"9783540496960","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_38","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"369-378","source":"Crossref","is-referenced-by-count":13,"title":["Non-cooperative Facility Location and Covering Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, \u00c9., Wexler, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th FOCS, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. 35th STOC, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_17","volume-title":"Internet and Network Economics","author":"J. Cardinal","year":"2006","unstructured":"Cardinal, J., Hoefer, M.: Selfish serive installation in networks. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, Springer, Heidelberg (2006)"},{"key":"38_CR4","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Combinatorial optimization games. In: Proc. 8th SODA, pp. 720\u2013729 (1997)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1007\/11600930_105","volume-title":"Internet and Network Economics","author":"N. Devanur","year":"2005","unstructured":"Devanur, N., Garg, N., Khandekar, R., Pandit, V., Saberi, A., Vazirani, V.: Price of anarchy, locality gap, and a network service provider game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 1046\u20131055. Springer, Heidelberg (2005)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Devanur, N., Mihail, M., Vazirani, V.: Strategyproof cost-sharing mechanisms for set cover and facility location problems. In: Proc. 4th EC, pp. 108\u2013114 (2003)","DOI":"10.1145\/779928.779942"},{"key":"38_CR7","doi-asserted-by":"publisher","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 framework and bibliography. Transport. Sci.\u00a027, 44\u201354 (1993)","journal-title":"Transport. Sci."},{"key":"38_CR8","unstructured":"Goemans, M., Skutella, M.: Cooperative facility location games. In: Proc. 11th SODA, pp. 76\u201385 (2000)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms\u00a031, 228\u2013248 (1999)","journal-title":"J. Algorithms"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/11821069_45","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative tree creation. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 517\u2013527. Springer, Heidelberg (2006)"},{"key":"38_CR11","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proc. 16th SODA, pp. 602\u2013611 (2005)"},{"issue":"6","key":"38_CR12","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","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. ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"J. ACM"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proc. 33rd STOC, pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-31856-9_18","volume-title":"STACS 2005","author":"X. Li","year":"2005","unstructured":"Li, X., Sun, Z., Wang, W.: Cost sharing and strategyproof mechanisms for set cover games. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 218\u2013230. Springer, Heidelberg (2005)"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"issue":"3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"R. Mettu","year":"2003","unstructured":"Mettu, R., Plaxton, G.: The online median problem. SIAM J. Comp.\u00a032(3), 816\u2013832 (2003)","journal-title":"SIAM J. Comp."},{"key":"38_CR18","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, Heidelberg (1996)"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proc. 44th FOCS, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Applications in Management","author":"Z. Sun","year":"2005","unstructured":"Sun, Z., Li, X., Wang, W., Chu, X.: Mechanism design for set cover games when elements are agents. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol.\u00a03521, Springer, Heidelberg (2005)"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies with application to facility location, traffic routing and auctions. In: Proc. 43rd FOCS, p. 416 (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:29:56Z","timestamp":1736659796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11940128_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}