{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:29:52Z","timestamp":1787506192675,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540323013","type":"print"},{"value":"9783540322887","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_17","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"218-229","source":"Crossref","is-referenced-by-count":56,"title":["Exact Price of Anarchy for Polynomial Congestion Games"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Aland","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominic","family":"Dumrauf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gairing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Schoppmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-24592-6_4","volume-title":"Approximation and Online Algorithms","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in Worst-Case Equilibria. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 41\u201352. Springer, Heidelberg (2004)"},{"key":"17_CR3","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On The Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish Traffic Allocation for Server Farms. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"#cr-split#-17_CR7.1","unstructured":"Czumaj, A., V??cking, B.: Tight Bounds for Worst-Case Equilibria. In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413???420 (2002);"},{"key":"#cr-split#-17_CR7.2","unstructured":"Also accepted to Journal of Algorithms as Special Issue of SODA 2002"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11671411_13","volume-title":"Approximation and Online Algorithms","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 161\u2013175. Springer, Heidelberg (2006)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-28629-5_44","volume-title":"Mathematical Foundations of Computer Science 2004","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The Price of Anarchy for Polynomial Social Cost. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 574\u2013585. Springer, Heidelberg (2004)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11523468_5","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Monien, B., Tiemann, K.: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. In: Proc. of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005), pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"issue":"6","key":"17_CR15","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-24749-4_48","volume-title":"STACS 2004","author":"T. L\u00fccking","year":"2004","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A New Model for Selfish Routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 547\u2013558. Springer, Heidelberg (2004)"},{"key":"17_CR18","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"McKelvey, R.D., McLennan, A.: Computation of Equilibria in Finite Games. Handbook of Computational Economics (1996)","DOI":"10.1016\/S1574-0021(96)01004-0"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior\u00a014(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash","year":"1950","unstructured":"Nash, J.F.: Equilibrium Points in n-Person Games. Proc. of the National Academy of Sciences of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proc. of the National Academy of Sciences of the United States of America"},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. Int. Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Int. Journal of Game Theory"},{"key":"17_CR26","unstructured":"Roughgarden, T.: How Unfair is Optimal Routing. In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 203\u2013204 (2002)"},{"key":"17_CR27","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"issue":"2","key":"17_CR28","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":"17_CR29","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proc. of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:31:25Z","timestamp":1555457485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11672142_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}