{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T01:17:18Z","timestamp":1791076638137,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,5]],"date-time":"2005-04-05T00:00:00Z","timestamp":1112659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1007\/s00446-005-0122-y","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T06:53:35Z","timestamp":1113029615000},"page":"61-72","source":"Crossref","is-referenced-by-count":96,"title":["A BGP-based mechanism for lowest-cost routing"],"prefix":"10.1007","volume":"18","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahul","family":"Sami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,4,5]]},"reference":[{"key":"122_CR1","doi-asserted-by":"crossref","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 Econ. Behav. 47, 36-71 (2004)","journal-title":"Games Econ. Behav"},{"key":"122_CR2","first-page":"991","volume-title":"Proceedings of 13th symposium on discrete algorithms","author":"A Archer","year":"2002","unstructured":"Archer, A., Tardos, E.: Frugal path mechanisms. In: Proceedings of 13th symposium on discrete algorithms, pp. 991-999. ACM Press\/SIAM, New York\/Philadelphia (2002)"},{"key":"122_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E Clarke","year":"1971","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice 11, 17-33 (1971)","journal-title":"Public Choice"},{"key":"122_CR4","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 304, 215-236 (2003)","journal-title":"Theoret. Comput. Sci"},{"key":"122_CR5","first-page":"173","volume-title":"Proceedings of the 21st symposium on principles of distributed computing","author":"J Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: Proceedings of the 21st symposium on principles of distributed computing, pp. 173-182. ACM Press, New York (2002)"},{"key":"122_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. J. Comput. Syst. Sci. 63, 21-41 (2001)","journal-title":"J. Comput. Syst. Sci"},{"key":"122_CR7","first-page":"11","volume-title":"Proceedings of the 23rd symposium on principles of distributed computing","author":"J Feigenbaum","year":"2004","unstructured":"Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: Proceedings of the 23rd symposium on principles of distributed computing, pp. 11-20. ACM Press, New York (2004)"},{"key":"122_CR8","first-page":"72","volume-title":"Proceedings of the 34th symposium on theory of computing","author":"A Fiat","year":"2002","unstructured":"Fiat, A., Goldberg, A., Hartline, J., Karlin, A.: Competitive generalized auctions. In: Proceedings of the 34th symposium on theory of computing, pp. 72-81. ACM Press, New York (2002)"},{"key":"122_CR9","first-page":"65","volume-title":"studies in public economics, vol. 1","author":"J Green","year":"1979","unstructured":"Green, J., Laffont, J.: Incentives in public decision making. In: studies in public economics, vol. 1, pp. 65-78. North Holland, Amsterdam (1979)"},{"key":"122_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/316188.316231","volume-title":"Proceedings of SIGCOMM'99","author":"T.G. Griffin","year":"1999","unstructured":"Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: Proceedings of SIGCOMM'99, pp. 277-288. ACM Press, New York (1999)"},{"key":"122_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica 41, 617-663 (1973)","journal-title":"Econometrica"},{"key":"122_CR12","first-page":"129","volume-title":"Proceedings of the 42nd symposium on the foundations of computer science","author":"J Hershberger","year":"2001","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: What is an edge worth? In: Proceedings of the 42nd symposium on the foundations of computer science, pp. 129-140. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"122_CR13","volume-title":"Microeconomic theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M., Green, J.: Microeconomic theory. Oxford university press, New York (1995)"},{"key":"122_CR14","unstructured":"Mitchell, J., Sami, R., Talwar, K., Teague, V.: Private communication, (Dec. 2001)"},{"key":"122_CR15","unstructured":"Monderer, D., Tennenholtz, M.: Distributed games: from mechanisms to protocols. In: Proceedings of the 16th national conference on artificial intelligence, pp. 32-37 (1999)"},{"key":"122_CR16","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166-196 (2001)","journal-title":"Games Econ. Behav."},{"key":"122_CR17","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/336992.337032","volume-title":"proceedings of the 1st ACM conference on electronic commerce","author":"D Parkes","year":"1999","unstructured":"Parkes, D.: iBundle: An efficient ascending price bundle auction. In: proceedings of the 1st ACM conference on electronic commerce, pp. 148-157. ACM Press, New York (1999)"},{"key":"122_CR18","unstructured":"Parkes, D., Ungar, L.: Iterative combinatorial auctions: theory and practice. In: Proceedings of the 17th national conference on artificial intelligence, pp. 71-81. (2000)"},{"key":"122_CR19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49, 236-259 (2002)","journal-title":"J. ACM"},{"key":"122_CR20","unstructured":"Route Views: University of Oregon Route Views Project. http:\/\/www.routeviews.org"},{"key":"122_CR21","first-page":"201","volume-title":"Multiagent Systems: a Modern Introduction to Distributed Artificial Intelligence","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T.: Distributed rational decision making. In: Weiss, G. (ed.) Multiagent Systems: a Modern Introduction to Distributed Artificial Intelligence, pp. 201-258. MIT Press, Cambridge, MA (1999)"},{"key":"122_CR22","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1145\/779928.779997","volume-title":"Proceedings of the 4th ACM conference on electronic commerce","author":"J Shneidman","year":"2003","unstructured":"Shneidman, J., Parkes, D.: Using redundancy to improve robustness of distributed mechanism implementations. In: Proceedings of the 4th ACM conference on electronic commerce, pp. 276-277. ACM Press, New York (2003)"},{"key":"122_CR23","first-page":"88","volume-title":"Proceedings of the 23rd symposium on principles of distributed computing","author":"J Shneidman","year":"2004","unstructured":"Shneidman, J., Parkes, D.: Specification faithfulness in networks with rational nodes. In: Proceedings of the 23rd symposium on principles of distributed computing, pp. 88-97. ACM Press, New York (2004)"},{"key":"122_CR24","first-page":"19","volume-title":"Proceeding of SPIE ITCom 2001","author":"H Tangmunarunkit","year":"2001","unstructured":"Tangmunarunkit, H., Govindan, R., Shenker, S.: Internet path inflation due to policy routing. In: Proceeding of SPIE ITCom 2001, pp. 19-24. SPIE Press, Bellingham (2001)"},{"key":"122_CR25","doi-asserted-by":"crossref","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. J. Finance 16, 8-37 (1961)","journal-title":"J. Finance"},{"key":"122_CR26","first-page":"1","volume":"1","author":"M Wellman","year":"1993","unstructured":"Wellman, M.: A market-oriented programming environment and its applications to distributed multicommodity flow problems. J. AI Res. 1, 1-23 (1993)","journal-title":"J. AI Res"},{"key":"122_CR27","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1006\/game.2000.0822","volume":"35","author":"M Wellman","year":"2001","unstructured":"Wellman, M., Walsh, W., Wurman, P., Mackie-Mason, J.: Auctions for decentralized scheduling. Games Econ. Behav. 35, 271-303 (2001)","journal-title":"Games Econ. Behav"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0122-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0122-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0122-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:35Z","timestamp":1559136395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0122-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,5]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0122-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,5]]}}}