{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:38Z","timestamp":1725489158932},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_13","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"133-144","source":"Crossref","is-referenced-by-count":3,"title":["Hardness Results for Multicast Cost Sharing"],"prefix":"10.1007","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","affiliation":[]},{"given":"Arvind","family":"Krishnamurthy","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Sami","sequence":"additional","affiliation":[]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"13_CR1","unstructured":"Adler, M. and Rubenstein, D. (2002). \u201cPricing Multicast in More Practical Network Models,\u201d in Proceedings of the 13th Symposium on Discrete Algorithms, pp. 981\u2013990, ACM Press\/SIAM, New York\/Philadelphia."},{"key":"13_CR2","unstructured":"Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., and Shenker, S. (2002). \u201cApproximation and Collusion in Multicast Cost Sharing,\u201d submitted. http:\/\/www.cs.yale.edu\/homes\/jf\/AFKSS.ps"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"615","DOI":"10.2307\/1911055","volume":"57","author":"B. Dutta","year":"1989","unstructured":"Dutta, B. and Ray, D. (1989). \u201cA concept of egalitarianism under participation constraints,\u201d Econometrica 57, pp. 615\u2013635.","journal-title":"Econometrica"},{"key":"13_CR4","unstructured":"Feigenbaum, J., Krishnamurthy, A., Sami, R., and Shenker, S. (2002). \u201cHardness Results for Multicast Cost Sharing,\u201d submitted. http:\/\/www.cs.yale.edu\/homes\/jf\/FKSS2.ps ."},{"key":"13_CR5","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., and Shenker, S. (2001). \u201cSharing the cost of multicast transmissions,\u201d Journal of Computer and System Sciences 63, pp. 21\u201341.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J. and Shenker, S. (2002). \u201cDistributed Algorithmic Mechanism Design: Recent Results and Future Directions,\u201d in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1\u201313, ACM Press, New York.","DOI":"10.1145\/570810.570812"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fiat, A., Goldberg, A., Hartline, J., and Karlin, A. (2002). \u201cCompetitive Generalized Auctions,\u201d in Proceedings of the 34th Symposium on the Theory of Computing, pp. 72\u201381, ACM Press, New York.","DOI":"10.1145\/509907.509921"},{"key":"13_CR8","unstructured":"Green, J. and Laffont, J-J. (1979). Incentives in Public Decision Making, North Holland, Amsterdam."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/90.650144","volume":"5","author":"S. Herzog","year":"1997","unstructured":"Herzog, S., Shenker, S., and Estrin, D. (1997). \u201cSharing the \u2018cost\u2019 of multicast trees: An axiomatic analysis,\u201d IEEE\/ACM Transactions on Networking 5, pp. 847\u2013860.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s003550100152","volume":"18","author":"M. Jackson","year":"2001","unstructured":"Jackson, M. (2001). \u201cA Crash Course in Implementation Theory,\u201d Social Choice and Welfare 18, pp. 655\u2013708.","journal-title":"Social Choice and Welfare"},{"key":"13_CR11","unstructured":"Jain, K. and Vazirani, V. (2001). \u201cApplications of approximation to cooperative games,\u201d in Proceedings of the 33rd Symposium on the Theory of Computing, pp. 364\u2013372, ACM Press, New York."},{"key":"13_CR12","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E. and Nisan, N. (1997). Communication Complexity, Cambridge University Press, Cambridge."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s003550050145","volume":"16","author":"H. Moulin","year":"1999","unstructured":"Moulin, H. (1999). \u201cIncremental cost sharing: characterization by strategyproofness,\u201d Social Choice and Welfare 16, pp. 279\u2013320.","journal-title":"Social Choice and Welfare"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H. and Shenker, S. (2001). \u201cStrategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency,\u201d Economic Theory 18, pp. 511\u2013533.","journal-title":"Economic Theory"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Mitchell, J. and Teague, V. (2002). Private communication.","DOI":"10.1533\/9781855736689.1.155"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N. and Ronen, A. (2000). \u201cComputationally feasible VCG mechanisms,\u201d in Proceedings of the 2nd Conference on Electronic Commerce (EC-00), pp. 242\u2013252, ACM Press, New York.","DOI":"10.1145\/352871.352898"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N. and Ronen, A. (2001). \u201cAlgorithmic mechanism design,\u201d Games and Economic Behavior 35, pp. 166\u2013196.","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:18:50Z","timestamp":1684009130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}