{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:09:55Z","timestamp":1764936595593},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248283"},{"type":"electronic","value":"9783642248290"}],"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-24829-0_27","type":"book-chapter","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T09:11:38Z","timestamp":1317633098000},"page":"302-313","source":"Crossref","is-referenced-by-count":28,"title":["Efficiency of Restricted Tolls in Non-atomic Network Routing Games"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Bonifaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahyar","family":"Salek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th ACM Symp. on Theory of Computing, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"27_CR2","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, B., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.1100.0442","volume":"35","author":"V. Bonifaci","year":"2010","unstructured":"Bonifaci, V., Harks, T., Sch\u00e4fer, G.: Stackelberg routing in arbitrary networks. Mathematics of Operations Research\u00a035(2), 1\u201317 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th ACM Symp. on Theory of Computing (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. In: Proc. 17th European Symp. on Algorithms, pp. 251\u2013262 (2009)","DOI":"10.1007\/978-3-642-04128-0_22"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proc. 35th Symp. on Theory of Computing, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"issue":"3","key":"27_CR7","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? Journal of Computer and System Sciences\u00a072(3), 444\u2013467 (2006)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2-3","key":"27_CR8","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. Theoretical Computer Science\u00a0348(2-3), 217\u2013225 (2005)","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proc. 45th Symp. on Foundations of Computer Science, pp. 277\u2013285 (2004)","DOI":"10.1109\/FOCS.2004.69"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-93980-1_11","volume-title":"Approximation and Online Algorithms","author":"T. Harks","year":"2009","unstructured":"Harks, T.: Stackelberg strategies and collusion in network games with splittable flow. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 133\u2013146. Springer, Heidelberg (2009)"},{"key":"27_CR11","unstructured":"Harks, T., Sch\u00e4fer, G., Sieg, M.: Computing flow-inducing network tolls. Technical Report 36-2008, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Germany (2008)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-92185-1_35","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2008","unstructured":"Hoefer, M., Olbrich, L., Skopalik, A.: Taxing subnetworks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 286\u2013294. Springer, Heidelberg (2008)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: Proc. 45th Symp. on Foundations of Computer Science, pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proc. 16th Symp. on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"5","key":"27_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0041-5553(80)90098-1","volume":"20","author":"M.K. Kozlov","year":"1980","unstructured":"Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: The polynomial solvability of convex quadratic programming. USSR Computational Mathematics and Mathematical Physics\u00a020(5), 223\u2013228 (1980)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. J.\u00a0Comput. Syst. Sci.\u00a067(2), 341\u2013364 (2003)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"5","key":"27_CR17","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the severity of Braess\u2019s paradox: Designing networks for selfish users is hard. J. Comput. Syst. Sci.\u00a072(5), 922\u2013953 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc. 41st ACM Symp. on Theory of Computing, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"issue":"2","key":"27_CR19","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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"27_CR20","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proc. 18th Symp. on Discrete Algorithms (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24829-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:57:15Z","timestamp":1560715035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24829-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248283","9783642248290"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24829-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}