{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:38:58Z","timestamp":1760297938908,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79309-0_29","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"327-336","source":"Crossref","is-referenced-by-count":13,"title":["Is Shapley Cost Sharing Optimal?"],"prefix":"10.1007","author":[{"given":"Shahar","family":"Dobzinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Roughgarden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mukund","family":"Sundararajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Blumrosen, L., Nisan, N.: Combinatorial auctions. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_57","volume-title":"STACS 2007","author":"J. Brenner","year":"2007","unstructured":"Brenner, J., Sch\u00e4fer, G.: Cost sharing methods for makespan and completion time scheduling. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, Springer, Heidelberg (2007)"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"V11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice\u00a0V11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1006\/jeth.1999.2603","volume":"88","author":"R. Deb","year":"1999","unstructured":"Deb, R., Razzolini, L.: Auction-like mechanisms for pricing excludable public goods. Journal of Economic Theory\u00a088(2), 340\u2013368 (1999), \n                      http:\/\/ideas.repec.org\/a\/eee\/jetheo\/v88y1999i2p340-368.html","journal-title":"Journal of Economic Theory"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0165-4896(98)00026-2","volume":"37","author":"R. Deb","year":"1999","unstructured":"Deb, R., Razzolini, L.: Voluntary cost sharing for an excludable public project. Mathematical Social Sciences\u00a037, 123\u2013138 (1999)","journal-title":"Mathematical Social Sciences"},{"key":"29_CR6","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":"29_CR7","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0047-2727(76)90049-9","volume":"6","author":"J. Green","year":"1976","unstructured":"Green, J., Kohlberg, E., Laffont, J.J.: Partial equilibrium approach to the free rider problem. Journal of Public Economics\u00a06, 375\u2013394 (1976)","journal-title":"Journal of Public Economics"},{"issue":"4","key":"29_CR8","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(4), 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"29_CR9","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 602\u2013611 (2005)"},{"key":"29_CR10","unstructured":"Lavi, R.: Computationally efficient approximation mechanisms. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Mehta, A., Roughgarden, T., Sundararajan, M.: Beyond Moulin mechanisms. In: EC 2007: Proceedings of the 8th ACM conference on Electronic commerce, pp. 1\u201310 (2007)","DOI":"10.1145\/1250910.1250912"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Mehta, A., Vazirani, V.V.: Randomized truthful auctions of digital goods are randomizations over truthful auctions. In: ACM Conference on Electronic Commerce, pp. 120\u2013124 (2004)","DOI":"10.1145\/988772.988791"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H.: Incremental cost sharing: Characterization by coalition strategy-proofness. Social Choice and Welfare\u00a016, 279\u2013320 (1999)","journal-title":"Social Choice and Welfare"},{"key":"29_CR14","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"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC 1999 (1999)","DOI":"10.1145\/301250.301287"},{"key":"29_CR16","volume-title":"Aggregation and Revelation of Preferences","author":"K. Roberts","year":"1979","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences, North-Holland, Amsterdam (1979)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Sundararajan, M.: New trade-offs in cost-sharing mechanisms. In: Proceedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC), pp. 79\u201388 (2006)","DOI":"10.1145\/1132516.1132528"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance\u00a016(1), 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:51:19Z","timestamp":1657561879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}