{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:36:02Z","timestamp":1743024962419,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_29","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"335-346","source":"Crossref","is-referenced-by-count":8,"title":["On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games"],"prefix":"10.1007","author":[{"given":"Bart","family":"de Keijzer","sequence":"first","affiliation":[]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[]},{"given":"Orestis A.","family":"Telelis","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","first-page":"189","volume-title":"Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"N. Andelman","year":"2007","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 189\u2013198. ACM Press, New York (2007)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"R.J. Aumann","year":"1960","unstructured":"Aumann, R.J.: Acceptable points in games of perfect information. Pacific Journal of Mathematics\u00a010, 381\u2013417 (1960)","journal-title":"Pacific Journal of Mathematics"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: Large the price of routing unsplittable flow. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"2-3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B. Awerbuch","year":"2006","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in worst-case equilibria. Theoretical Computer Science\u00a0361(2-3), 200\u2013209 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R. Banner","year":"2007","unstructured":"Banner, R., Orda, A.: Bottleneck Routing Games in Communication Networks. IEEE Journal on Selected Areas in Communication\u00a025(6), 1173\u20131179 (2007)","journal-title":"IEEE Journal on Selected Areas in Communication"},{"issue":"36","key":"29_CR7","doi-asserted-by":"publisher","first-page":"3337","DOI":"10.1016\/j.tcs.2009.04.015","volume":"410","author":"C. Busch","year":"2009","unstructured":"Busch, C., Magdon-Ismail, M.: Atomic Routing Games on Maximum Congestion. Theoretical Computer Science\u00a0410(36), 3337\u20133347 (2009)","journal-title":"Theoretical Computer Science"},{"key":"29_CR8","first-page":"67","volume-title":"Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pp. 67\u201373. ACM Press, New York (2005)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms\u00a03(1) (2007)","DOI":"10.1145\/1186810.1186814"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-540-73420-8_51","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong Price of Anarchy for Machine Load Balancing. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 583\u2013594. Springer, Heidelberg (2007)"},{"issue":"1","key":"29_CR11","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\u2013132 (2006)","journal-title":"Parallel Processing Letters"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-10841-9_43","volume-title":"Internet and Network Economics","author":"T. Harks","year":"2009","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.: Strong nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 463\u2013470. Springer, Heidelberg (2009)"},{"issue":"17","key":"29_CR13","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N. Immorlica","year":"2009","unstructured":"Immorlica, N., Li, E., Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. Theoretical Computer Science\u00a0410(17), 1589\u20131598 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"29_CR14","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.G.: Approximate Equilibria and Ball Fusion. Theory of Computing Systems\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"29_CR15","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)"},{"issue":"2","key":"29_CR16","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.H.: Worst-case equilibria. Computer Science Review\u00a03(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"key":"29_CR17","first-page":"749","volume-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC)","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC), pp. 749\u2013753. ACM Press, New York (2001)"},{"issue":"1","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(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"}],"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-16170-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:24:22Z","timestamp":1553171062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}