{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:25:11Z","timestamp":1777339511080,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T00:00:00Z","timestamp":1360886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00453-013-9753-8","type":"journal-article","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T16:24:55Z","timestamp":1360859095000},"page":"619-640","source":"Crossref","is-referenced-by-count":21,"title":["Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms"],"prefix":"10.1007","volume":"69","author":[{"given":"Giorgos","family":"Christodoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelia","family":"Pyrga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,15]]},"reference":[{"issue":"1\u20133","key":"9753_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E. Angel","year":"2006","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci. 369(1\u20133), 157\u2013168 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9753_CR2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10951-009-0118-8","volume":"12","author":"E. Angel","year":"2009","unstructured":"Angel, E., Bampis, E., Pascual, F., Tchetgnia, A.-A.: On truthfulness and approximation for scheduling selfish tasks. J. Sched. 12(5), 437\u2013445 (2009)","journal-title":"J. Sched."},{"key":"9753_CR3","first-page":"323","volume-title":"SODA","author":"Y. Azar","year":"2008","unstructured":"Azar, Y., Jain, K., Mirrokni, V.S.: (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: SODA, pp. 323\u2013332 (2008)"},{"issue":"3","key":"9753_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/trsc.28.3.221","volume":"28","author":"D. Bernstein","year":"1994","unstructured":"Bernstein, D., Smith, T.E.: Equilibria for networks with lower semicontinuous costs: with an application to congestion pricing. Transp. Sci. 28(3), 221\u2013235 (1994)","journal-title":"Transp. Sci."},{"key":"9753_CR5","first-page":"302","volume-title":"SAGT","author":"V. Bonifaci","year":"2011","unstructured":"Bonifaci, V., Salek, M., Sch\u00e4fer, G.: On the efficiency of restricted tolls in network routing games. In: SAGT, pp. 302\u2013313 (2011)"},{"key":"9753_CR6","first-page":"815","volume-title":"SODA","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. In: SODA, pp. 815\u2013824 (2009)"},{"key":"9753_CR7","first-page":"187","volume-title":"COCOON","author":"G. Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: COCOON, pp. 187\u2013197 (2007)"},{"issue":"36","key":"9753_CR8","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G. Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9753_CR9","first-page":"119","volume-title":"ESA","author":"G. Christodoulou","year":"2011","unstructured":"Christodoulou, G., Mehlhorn, K., Pyrga, E.: Improving the price of anarchy for selfish routing via coordination mechanisms. In: ESA, pp. 119\u2013130 (2011)"},{"key":"9753_CR10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/780542.780618","volume-title":"STOC","author":"R. Cole","year":"2003","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC, pp. 521\u2013530 (2003)"},{"issue":"3","key":"9753_CR11","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","volume":"72","author":"R. Cole","year":"2006","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3), 444\u2013467 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9753_CR12","volume-title":"STOC","author":"R. Cole","year":"2011","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for MinSum coordination mechanisms. In: STOC (2011)"},{"key":"9753_CR13","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.geb.2008.01.001","volume":"64","author":"J.R. Correa","year":"2008","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ. Behav. 64, 457\u2013469 (2008)","journal-title":"Games Econ. Behav."},{"key":"9753_CR14","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.5.4.366","volume":"5","author":"S. Dafermos","year":"1971","unstructured":"Dafermos, S.: An extended traffic assignment model with applications to two-way traffic. Transp. Sci. 5, 366\u2013389 (1971)","journal-title":"Transp. Sci."},{"issue":"2","key":"9753_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. J. Res. Natl. Bur. Stand. B, Math. Sci. 73B(2), 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bur. Stand. B, Math. Sci."},{"key":"9753_CR16","unstructured":"de Palma, A., Nesterov, Y.: Optimization formulations and static equilibrium in congested transportation networks. CORE Discussion Paper 9861, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, 12\u201317, 1998"},{"issue":"2\u20133","key":"9753_CR17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"L. Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear tolls suffice: new bounds and algorithms for tolls in single source networks. Theor. Comput. Sci. 348(2\u20133), 217\u2013225 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9753_CR18","first-page":"277","volume-title":"FOCS","author":"L. Fleischer","year":"2004","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS, pp. 277\u2013285 (2004)"},{"key":"9753_CR19","first-page":"55","volume-title":"WINE","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination mechanisms for selfish scheduling. In: WINE, pp. 55\u201369 (2005)"},{"key":"9753_CR20","first-page":"268","volume-title":"FOCS","author":"G. Karakostas","year":"2004","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: FOCS, pp. 268\u2013276 (2004)"},{"key":"9753_CR21","first-page":"3","volume-title":"CAAN","author":"G. Karakostas","year":"2004","unstructured":"Karakostas, G., Kolliopoulos, S.G.: The efficiency of optimal taxes. In: CAAN, pp. 3\u201312 (2004)"},{"key":"9753_CR22","first-page":"197","volume-title":"SIROCCO","author":"K. Kollias","year":"2008","unstructured":"Kollias, K.: Non-preemptive coordination mechanisms for identical machine scheduling games. In: SIROCCO, pp. 197\u2013208 (2008)"},{"issue":"2","key":"9753_CR23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9753_CR24","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0927-0507(06)14010-4","volume-title":"Transportation","author":"P. Marcotte","year":"2007","unstructured":"Marcotte, P., Patriksson, M.: Traffic equilibrium. In: Transportation. Handbooks in Operations Research and Management Science, vol. 14, pp. 623\u2013713. North-Holland, Amsterdam (2007). Chap.\u00a010"},{"key":"9753_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"9753_CR26","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M. Patriksson","year":"1994","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. V.S.P. Intl Science, Leiden (1994)"},{"key":"9753_CR27","volume-title":"FOCS","author":"T. Roughgarden","year":"2001","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: FOCS (2001)"},{"key":"9753_CR28","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM 49, 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9753_CR29","first-page":"325","volume-title":"Proceedings of the Institute of Civil Engineers, Part II","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, vol. 1, pp. 325\u2013378 (1952)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9753-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9753-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9753-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T14:49:59Z","timestamp":1688050199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9753-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,15]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9753"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9753-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,15]]}}}