{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:35:02Z","timestamp":1777559702437,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T00:00:00Z","timestamp":1138147200000},"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":[[2006,3]]},"DOI":"10.1007\/s00446-005-0134-7","type":"journal-article","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T13:13:41Z","timestamp":1137762821000},"page":"293-305","source":"Crossref","is-referenced-by-count":13,"title":["Mechanism design for policy routing"],"prefix":"10.1007","volume":"18","author":[{"given":"Joan","family":"Feigenbaum","sequence":"first","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":"297","published-online":{"date-parts":[[2006,1,25]]},"reference":[{"key":"134_CR1","unstructured":"Archer, A., Tardos, \u00c9: Frugal path mechanisms. In: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201902), pp. 991\u2013999. ACM Press\/SIAM, New York (2002)."},{"key":"134_CR2","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\u201333 (1971)","journal-title":"Public Choice"},{"key":"134_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"B71","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimal Branchings. Journal of Research of the National Bureau of Standards B71, 233\u2013240 (1967)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"134_CR4","unstructured":"Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201904), pp. 701\u2013709. ACM Press\/SIAM, New York (2004)"},{"key":"134_CR5","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distrib. Comput. 18(1), 61\u201372 (2005). A preliminary version appeared in the 2002 ACM Symposium on Principles of Distributed Computing (PODC\u201902)","DOI":"10.1007\/s00446-005-0122-y"},{"key":"134_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. Journal of Computer and System Sciences 63, 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"134_CR7","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Sami, R., Shenker, S.: Mechanism Design for Policy Routing. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC \u201904), pp. 11\u201320. ACM Press, New York (2004)","DOI":"10.1145\/1011767.1011770"},{"key":"134_CR8","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM \u201902), pp. 1\u201313. ACM Press, New York (2002)","DOI":"10.1145\/570810.570812"},{"key":"134_CR9","unstructured":"Green, J., Laffont, J.: Incentives in public decision making. In: Studies in Public Economics, vol. 1, pp. 65\u201378. North Holland, Amsterdam (1979)"},{"key":"134_CR10","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\u2013663, (1973)","journal-title":"Econometrica"},{"key":"134_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n1\u2212\u220a. Acta Mathematica 182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"134_CR12","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: What is an edge worth? In: Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science (FOCS \u201901), pp. 129\u2013140. IEEE Computer Society Press, Los Alamitos (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"6","key":"134_CR13","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","volume":"COM-31","author":"P. Humblet","year":"1983","unstructured":"Humblet, P.: A distributed algorithm for minimum weight directed spanning trees. IEEE Transactions on Communications COM-31(6), 756\u2013762 (1983)","journal-title":"IEEE Transactions on Communications"},{"key":"134_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W.: editors, Complexity of Computer Computations (Proceedings of a Symposium on the Complexity of Computer Computations), pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"134_CR15","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 and Economic Behavior 35, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"134_CR16","unstructured":"Sami, R.: Distributed Algorithmic Mechanism Design. PhD thesis, Yale University (2003)"},{"key":"134_CR17","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D. Spielman","year":"2004","unstructured":"Spielman, D., Teng, S.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51, 385\u2013463 (2004)","journal-title":"J. ACM"},{"key":"134_CR18","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. Journal of Finance 16, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0134-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-005-0134-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-005-0134-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T06:27:57Z","timestamp":1586672877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-005-0134-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,25]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["134"],"URL":"https:\/\/doi.org\/10.1007\/s00446-005-0134-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1,25]]}}}