{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T20:43:45Z","timestamp":1747082625440},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_11","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"119-130","source":"Crossref","is-referenced-by-count":8,"title":["Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]},{"given":"Evangelia","family":"Pyrga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"11_CR1","doi-asserted-by":"publisher","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.\u00a0369(1-3), 157\u2013168 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","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. Scheduling\u00a012(5), 437\u2013445 (2009)","journal-title":"J. Scheduling"},{"key":"11_CR3","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":"11_CR4","doi-asserted-by":"publisher","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. Transportation Science\u00a028(3), 221\u2013235 (1994)","journal-title":"Transportation Science"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bonifaci, V., Salek, M., Sch\u00e4fer, G.: On the efficiency of restricted tolls in network routing games. In: SAGT (2011) (to appear)","DOI":"10.1007\/978-3-642-24829-0_27"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machines scheduling. In: SODA, pp. 815\u2013824 (2009)","DOI":"10.1137\/1.9781611973068.89"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73545-8_20","volume-title":"Computing and Combinatorics","author":"G. Christodoulou","year":"2007","unstructured":"Christodoulou, G., Gourv\u00e8s, L., Pascual, F.: Scheduling selfish tasks: About the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 187\u2013197. Springer, Heidelberg (2007)"},{"issue":"36","key":"11_CR8","doi-asserted-by":"publisher","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.\u00a0410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: STOC (2011)","DOI":"10.1145\/1993636.1993708"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","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.\u00a072(3), 444\u2013467 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR12","doi-asserted-by":"publisher","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 and Economic Behavior\u00a064, 457\u2013469 (2008)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"11_CR13","first-page":"91","volume":"73B","author":"S.C. Dafermos","year":"1969","unstructured":"Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, Series B\u00a073B(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards, Series B"},{"key":"11_CR14","doi-asserted-by":"publisher","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. Transportation Science\u00a05, 366\u2013389 (1971)","journal-title":"Transportation Science"},{"key":"11_CR15","first-page":"12","volume-title":"CORE Discussion Paper 9861","author":"A. Palma de","year":"1998","unstructured":"de Palma, A., Nesterov, Y.: Optimization formulations and static equilibrium in congested transportation networks. In: CORE Discussion Paper 9861, pp. 12\u201317. Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve (1998)"},{"issue":"2-3","key":"11_CR16","doi-asserted-by":"publisher","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.\u00a0348(2-3), 217\u2013225 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"crossref","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)","DOI":"10.1109\/FOCS.2004.69"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination mechanisms for selfish scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: FOCS 2004, pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11527954_2","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"G. Karakostas","year":"2005","unstructured":"Karakostas, G., Kolliopoulos, S.G.: The efficiency of optimal taxes. In: L\u00f3pez-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol.\u00a03405, pp. 3\u201312. Springer, Heidelberg (2005)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-69355-0_17","volume-title":"Structural Information and Communication Complexity","author":"K. Kollias","year":"2008","unstructured":"Kollias, K.: Non-preemptive coordination mechanisms for identical machine scheduling games. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol.\u00a05058, pp. 197\u2013208. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","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. Computer Science Review\u00a03(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"11_CR23","series-title":"ch.10","first-page":"623","volume-title":"Transportation, Handbooks in Operations Research and Management Science","author":"P. Marcotte","year":"2007","unstructured":"Marcotte, P., Patriksson, M.: Traffic equilibrium. In: Transportation, Handbooks in Operations Research and Management Science. ch.10, vol.\u00a014, pp. 623\u2013713. North-Holland, Amsterdam (2007)"},{"key":"11_CR24","doi-asserted-by":"publisher","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":"11_CR25","unstructured":"Patriksson, M.: The Traffic Assignment Problem: Models and Methods. V.S.P. Intl. Science (1994)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"11_CR27","doi-asserted-by":"publisher","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\u00a049, 236\u2013259 (2002)","journal-title":"J.ACM"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Part II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:51Z","timestamp":1560514131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}