{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:01:36Z","timestamp":1759838496404},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","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\/11944874_29","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"319-330","source":"Crossref","is-referenced-by-count":12,"title":["Price of Anarchy for Polynomial Wardrop Games"],"prefix":"10.1007","author":[{"given":"Dominic","family":"Dumrauf","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gairing","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact Price of Anarchy for Polynomial Congestion Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Heidelberg (2006)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"29_CR3","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"29_CR4","first-page":"109","volume":"21","author":"M.J. Beckmann","year":"1967","unstructured":"Beckmann, M.J.: On the Theory of Traffic Flow in Networks. Traffic Quarterly\u00a021, 109\u2013116 (1967)","journal-title":"Traffic Quarterly"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11496915_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: On the Inefficiency of Equilibria in Nonatomic Congestion Games. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 167\u2013181. Springer, Heidelberg (2005)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11786986_46","volume-title":"Automata, Languages and Programming","author":"R. Cominetti","year":"2006","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.E.: Network Games With Atomic Players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 525\u2013536. Springer, Heidelberg (2006)"},{"key":"29_CR8","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-Case Equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413\u2013420 (2002); Journal of Algorithms as Special Issue of SODA 2002 (accepted)"},{"key":"29_CR9","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)"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129626406002514","volume":"16","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The Price of Anarchy for Restricted Parallel Links. Parallel Processing Letters\u00a016(1), 117\u2013131 (2006)","journal-title":"Parallel Processing Letters"},{"key":"29_CR11","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":"29_CR12","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005), pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11786986_44","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 501\u2013512. Springer, Heidelberg (2006)"},{"key":"29_CR14","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":"29_CR15","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"2","key":"29_CR16","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":"29_CR17","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan and Company, Basingstoke (1920)"},{"key":"29_CR18","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. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"29_CR19","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. Journal of Computer and System Sciences\u00a067(2), 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR20","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":"29_CR21","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":"29_CR22","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:08:33Z","timestamp":1558285713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11944874_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}