{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:15Z","timestamp":1725551895476},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_5","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"61-62","source":"Crossref","is-referenced-by-count":0,"title":["Selfish Routing in Networks"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings of the 37th\u00a0Annual ACM Symposium on Theory of Computing, STOC 2005 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"5_CR2","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 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"5_CR3","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)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th\u00a0Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the Coordination Ratio for a Selfish Routing Game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"5_CR8","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-540-45138-9_49","volume-title":"Mathematical Foundations of Computer Science 2003","author":"T. L\u00fccking","year":"2003","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the Worst-Case Nash Equilibrium? In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 551\u2013561. Springer, Heidelberg (2003)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The Price of Selfish Routing. In: Proceedings of the 33rd\u00a0Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"2","key":"5_CR11","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":"5_CR12","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":"5_CR13","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":"5_CR14","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the Institute of Civil Engineers, Pt.\u00a0II, vol.\u00a01, pp. 325\u2013378 (1956)","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:41Z","timestamp":1619507381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11611257_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}