乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:06Z","timestamp":1725507006109},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_30","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"339-349","source":"Crossref","is-referenced-by-count":1,"title":["Competitive Cost Sharing with Economies of Scale"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M.: Hardness of buy-at-bulk network design. In: Proc. 45th FOCS, pp. 115\u2013124 (2004)","DOI":"10.1109\/FOCS.2004.32"},{"key":"30_CR2","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":"30_CR3","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":"30_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proc. 38th FOCS, pp. 542\u2013547 (1997)","DOI":"10.1109\/SFCS.1997.646143"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11944874_17","volume-title":"Internet and Network Economics","author":"J. Cardinal","year":"2006","unstructured":"Cardinal, J., Hoefer, M.: Selfish Service Installation in Networks. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 174\u2013185. Springer, Heidelberg (2006)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Hajiaghayi, M.T., Kortarz, G., Salavatipour, M.: Approximation algorithms for non-uniform buy-at-bulk network design. In: Proc. 47th FOCS, pp. 677\u2013686 (2006)","DOI":"10.1109\/FOCS.2006.15"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Hajiaghayi, M.T., Kortsarz, G., Salavatipour, M.: Approximation algorithms for node-weighted buy-at-bulk networks. In: Proc. 18th SODA (2007)","DOI":"10.1109\/FOCS.2006.15"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: Proc. 18th SPAA, pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"30_CR9","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Combinatorial optimization games. In: Proc 8th SODA, pp. 720\u2013729 (1997)"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","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. Decision Support Systems\u00a039(1), 11\u201322 (2005)","journal-title":"Decision Support Systems"},{"issue":"2","key":"30_CR11","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":"3","key":"30_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1236457.1236458","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 ACM\u00a054(3), 11 (2007)","journal-title":"J ACM"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M.T. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi, M.T., Mahdian, M., Mirrokni, V.: The facility location problem with general cost functions. Networks\u00a042(1), 42\u201347 (2003)","journal-title":"Networks"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11940128_38","volume-title":"Algorithms and Computation","author":"M. Hoefer","year":"2006","unstructured":"Hoefer, M.: Non-cooperative facility location and covering games. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 369\u2013378. Springer, Heidelberg (2006)"},{"key":"30_CR15","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":"30_CR16","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of cross-monotonic cost sharing schemes. In: Proc. 16th SODA, pp. 602\u2013611 (2005)"},{"key":"30_CR17","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":"30_CR18","series-title":"Lecture Notes in Computer Science","first-page":"218","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":"30_CR19","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proc. 44th FOCS, pp. 584\u2013593 (2003)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/11496199_39","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, pp. 360\u2013369. Springer, Heidelberg (2005)"},{"key":"30_CR21","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2000","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:36Z","timestamp":1619522496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_30","relation":{},"subject":[]}}