{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:56:19Z","timestamp":1760522179944},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Games and Economic Behavior"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0899-8256(03)00176-3","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:42Z","timestamp":1063378182000},"page":"36-71","source":"Crossref","is-referenced-by-count":47,"title":["Approximation and collusion in multicast cost sharing"],"prefix":"10.1016","volume":"47","author":[{"given":"Aaron","family":"Archer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Feigenbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind","family":"Krishnamurthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Sami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0899-8256(03)00176-3_BIB001","first-page":"981","article-title":"Pricing multicast in more practical network models","author":"Adler","year":"2002"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB002","first-page":"991","article-title":"Frugal path mechanisms","author":"Archer","year":"2002"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB003","first-page":"85","article-title":"Core based trees (CBT)","author":"Ballardie","year":"1993"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB004","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","article-title":"Multipart pricing of public goods","volume":"1971","author":"Clarke","year":"1971","journal-title":"Public Choice"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB005","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","article-title":"Multicast routing in datagram internetworks and extended LANs","volume":"8","author":"Deering","year":"1990","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/S0899-8256(03)00176-3_BIB006","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/90.490743","article-title":"The PIM architecture for wide-area multicast routing","volume":"4","author":"Deering","year":"1996","journal-title":"ACM\/IEEE Trans. Networking"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB007","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(03)00085-9","article-title":"Hardness results for multicast cost sharing","volume":"304","author":"Feigenbaum","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0899-8256(03)00176-3_BIB008","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jcss.2001.1754","article-title":"Sharing the cost of multicast transmissions","volume":"63","author":"Feigenbaum","year":"2001","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0899-8256(03)00176-3_BIB009","first-page":"1","article-title":"Distributed algorithmic mechanism design: recent results and future directions","author":"Feigenbaum","year":"2002"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB010","first-page":"72","article-title":"Generalized competitive auctions","author":"Fiat","year":"2002"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB011","first-page":"735","article-title":"Competitive auctions and digital goods","author":"Goldberg","year":"2001"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB012","series-title":"Incentives in Public Decision Making","author":"Green","year":"1979"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB013","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","article-title":"Incentives in teams","volume":"41","author":"Groves","year":"1973","journal-title":"Econometrica"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB014","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S., 2001. Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of the 42nd Symposium on the Foundations of Computer Science. IEEE, Los Alamitos, pp. 129\u2013140","DOI":"10.1109\/SFCS.2001.959899"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB015","first-page":"65","article-title":"IP multicast channels: EXPRESS support for large-scale single-source applications","author":"Holbrook","year":"1999"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB016","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1109\/90.650144","article-title":"Sharing the \u2018cost\u2019 of multicast trees: An axiomatic analysis","volume":"5","author":"Herzog","year":"1997","journal-title":"ACM\/IEEE Trans. Networking"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB017","first-page":"364","article-title":"Applications of approximation to cooperative games","author":"Jain","year":"2001"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB018","first-page":"233","article-title":"Competitive analysis of incentive compatible on-line auctions","author":"Lavi","year":"2000"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB019","series-title":"Microeconomic Theory","author":"Mas-Colell","year":"1995"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB020","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","article-title":"Computational complexity of the game theory approach to cost allocation for a tree","volume":"3","author":"Megiddo","year":"1978","journal-title":"Math. Operations Res."},{"key":"10.1016\/S0899-8256(03)00176-3_BIB021","doi-asserted-by":"crossref","unstructured":"Mitchell, J., Teague, V., 2002. Private communication","DOI":"10.1201\/9781439833223.ch8"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB022","first-page":"32","article-title":"Distributed games: from mechanisms to protocols","author":"Monderer","year":"1999"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB023","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s003550050145","article-title":"Incremental cost sharing: characterization by strategyproofness","volume":"16","author":"Moulin","year":"1999","journal-title":"Soc. Choice Welfare"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB024","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/PL00004200","article-title":"Strategyproof sharing of submodular costs: budget balance versus efficiency","volume":"18","author":"Moulin","year":"2001","journal-title":"Econ. Theory"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB025","first-page":"242","article-title":"Computationally feasible VCG mechanisms","author":"Nisan","year":"2000"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB026","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","article-title":"Algorithmic mechanism design","volume":"35","author":"Nisan","year":"2001","journal-title":"Games Econ. Behav."},{"key":"10.1016\/S0899-8256(03)00176-3_BIB027","first-page":"148","article-title":"iBundle: An efficient ascending price bundle auction","author":"Parkes","year":"1999"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB028","first-page":"74","article-title":"Iterative combinatorial auctions: theory and practice","author":"Parkes","year":"2000"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB029","unstructured":"Perlman, R., Lee, C.-Y., Ballardie, A., Crowcroft., J., Wang, Z., Maufer, T., Diot, C., Green, M., 1999. Simple multicast: a design for simple low-overhead multicast. IETF internet draft. In preparation"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB030","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, E., 2002. How bad is selfish routing? J. ACM 49, 236\u2013259","DOI":"10.1145\/506147.506153"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB031","series-title":"Multiagent systems: A Modern Introduction to Distributed Artificial Intelligence","first-page":"201","article-title":"Distributed rational decision making","author":"Sandholm","year":"1999"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB032","doi-asserted-by":"crossref","first-page":"8","DOI":"10.2307\/2977633","article-title":"Counterspeculation, auctions and competitive sealed tenders","volume":"1961","author":"Vickrey","year":"1961","journal-title":"J. Finance"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB033","first-page":"1","article-title":"A market-oriented programming environment and its applications to distributed multicommodity flow problems","volume":"1","author":"Wellman","year":"1993","journal-title":"J. AI Res"},{"key":"10.1016\/S0899-8256(03)00176-3_BIB034","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1006\/game.2000.0822","article-title":"Auction protocols for decentralized scheduling","volume":"35","author":"Wellman","year":"2001","journal-title":"Games Econ. Behav."}],"container-title":["Games and Economic Behavior"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0899825603001763?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0899825603001763?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T14:59:11Z","timestamp":1585148351000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0899825603001763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0899825603001763"],"URL":"https:\/\/doi.org\/10.1016\/s0899-8256(03)00176-3","relation":{},"ISSN":["0899-8256"],"issn-type":[{"value":"0899-8256","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}