{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:40:26Z","timestamp":1739922026380,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_18","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"218-230","source":"Crossref","is-referenced-by-count":13,"title":["Cost Sharing and Strategyproof Mechanisms for Set Cover Games"],"prefix":"10.1007","author":[{"given":"Xiang-Yang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operation Research\u00a04, 233\u2013235 (1979)","journal-title":"Mathematics of Operation Research"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of for approximating set cover. JACM\u00a045, 634\u2013652 (1998)","journal-title":"JACM"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: Improved performance of the greedy algorithm for partial cover. Information Processing Letters\u00a064, 251\u2013254 (1997)","journal-title":"Information Processing Letters"},{"unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. In: ACM SODA 2005 (2005) (to appear)","key":"18_CR4"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TNET.2003.818196","volume":"11","author":"P. Marbach","year":"2003","unstructured":"Marbach, P.: Priority service and max-min fairness. IEEE\/ACM Transactions on Networking\u00a011, 733\u2013746 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"unstructured":"Radunovi\u0107, B., Boudec, J.Y.L.: A unified framework for max-min and min-max fairness with applications. In: Proceedings of 40th Annual Allerton Conference on Communication, Control, and Computing (2002)","key":"18_CR6"},{"key":"18_CR7","volume-title":"A course in game theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. The MIT Press, Cambridge (1994)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs:budget balance versus efficiency. Economic Theory\u00a018, 511\u2013533 (2001)","journal-title":"Economic Theory"},{"doi-asserted-by":"crossref","unstructured":"Devanur, N., Mihail, M., Vazirani, V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. In: ACM EC, pp. 108\u2013114 (2003)","key":"18_CR9","DOI":"10.1145\/779928.779942"},{"doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, E.: Group strategyproof mechanisms via primal-dual algorithms. In: IEEE FOCS, pp. 584\u2013593 (2003)","key":"18_CR10","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences\u00a063, 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L. Libman","year":"2001","unstructured":"Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommunication Systems\u00a017, 385\u2013409 (2001)","journal-title":"Telecommunication Systems"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/231699.231703","volume":"26","author":"S. Shenker","year":"1996","unstructured":"Shenker, S., Clark, D., Estrin, D., Herzog, S.: Pricing in computer networks: Reshaping the research agenda. ACM Computer Comm. Review\u00a026, 19\u201343 (1996)","journal-title":"ACM Computer Comm. Review"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(03)00085-9","volume":"304","author":"J. Feigenbaum","year":"2003","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoretical Computer Science\u00a0304, 215\u2013236 (2003)","journal-title":"Theoretical Computer Science"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0899-8256(03)00176-3","volume":"47","author":"A. Archer","year":"2004","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games and Economic Behavior\u00a047, 36\u201371 (2004)","journal-title":"Games and Economic Behavior"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/90.650144","volume":"5","author":"S. Herzog","year":"1997","unstructured":"Herzog, S., Shenker, S., Estrin, D.: Sharing the cost of multicast trees: An axiomatic analysis. IEEE\/ACM Transactions on Networking\u00a05, 847\u2013860 (1997)","journal-title":"IEEE\/ACM Transactions on Networking"},{"doi-asserted-by":"crossref","unstructured":"Li, X.Y., Sun, Z., Wang, W.: Cost sharing and strategyproof mechanisms for set cover games (2004), http:\/\/www.cs.iit.edu\/~xli\/publications-select.htm","key":"18_CR17","DOI":"10.1007\/978-3-540-31856-9_18"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D.J. Lehmann","year":"2002","unstructured":"Lehmann, D.J., O\u0107allaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. JACM\u00a049, 577\u2013602 (2002)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:43Z","timestamp":1739920183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}