{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:04:57Z","timestamp":1648663497949},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T00:00:00Z","timestamp":1419292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00224-014-9598-9","type":"journal-article","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T01:03:54Z","timestamp":1419210234000},"page":"377-396","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Strong Price of Anarchy of Linear Bottleneck Congestion Games"],"prefix":"10.1007","volume":"57","author":[{"given":"Bart de","family":"Keijzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis","family":"Telelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"key":"9598_CR1","doi-asserted-by":"crossref","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, vol. 3884 of LNCS, pp. 218\u2013229. Springer (2006)","DOI":"10.1007\/11672142_17"},{"key":"9598_CR2","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong Price of Anarchy. In: Bansal, N., Pruhs, K., Stein, C. (eds.): Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 189\u2013198. SIAM (2007)"},{"key":"9598_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"RJ Aumann","year":"1960","unstructured":"Aumann, R.J.: Acceptable points in games of perfect information. Pac. J. Math. 10, 381\u2013417 (1960)","journal-title":"Pac. J. Math."},{"key":"9598_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: Large the Price of Routing Unsplittable Flow. In: Gabow, H.N., Fagin, R. (eds.): Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC\u201905), pp. 57\u201366. ACM (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"2\u20133","key":"9598_CR5","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 361(2\u20133), 200\u2013209 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9598_CR6","doi-asserted-by":"crossref","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 25(6), 1173\u20131179 (2007)","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"9598_CR7","doi-asserted-by":"crossref","unstructured":"Busch, C., Kannan, R.: Stretch in Bottleneck Games. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.): COCOON, vol. 7434 of LNCS, pp. 592\u2013603. Springer (2012)","DOI":"10.1007\/978-3-642-32241-9_50"},{"issue":"36","key":"9598_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 410(36), 3337\u20133347 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9598_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Galdi, C., Kaklamanis, C.: Network Load Games. In: Deng, X., Du, D.-Z. (eds.): ISAAC,vol. 3827 of LNCS, pp. 809\u2013818. Springer (2005)","DOI":"10.1007\/11602613_81"},{"key":"9598_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Gabow, H.N., Fagin, R. (eds.): Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 67\u201373. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9598_CR11","doi-asserted-by":"crossref","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-Case Equilibria. ACM Transactions on Algorithms 3 (1) (2007)","DOI":"10.1145\/1186810.1186814"},{"key":"9598_CR12","doi-asserted-by":"crossref","unstructured":"de Keijzer, B., Sch\u00e4fer, G., Telelis, O.: On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. In: Kontogiannis, S.C., Koutsoupias, E., Spirakis, P.G. (eds.): SAGT, vol. 6386 of LNCS, pp. 335\u2013346. Springer (2010)","DOI":"10.1007\/978-3-642-16170-4_29"},{"key":"9598_CR13","doi-asserted-by":"crossref","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong Price of Anarchy for Machine Load Balancing. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.): ICALP, vol. 4596 of LNCS, pp. 583\u2013594. Springer (2007)","DOI":"10.1007\/978-3-540-73420-8_51"},{"key":"9598_CR14","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT 19, 312\u2013320 (1979)","journal-title":"BIT"},{"issue":"1","key":"9598_CR15","doi-asserted-by":"crossref","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 16(1), 117\u2013132 (2006)","journal-title":"Parallel Processing Letters"},{"key":"9598_CR16","doi-asserted-by":"crossref","unstructured":"Harks, T., Hoefer, M., Klimm, M., Skopalik, A.: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games. In: de Berg, M., Meyer, U. (eds.): ESA (2), vol. 6347 of LNCS, pp. 29\u201338. Springer (2010)","DOI":"10.1007\/978-3-642-15781-3_3"},{"key":"9598_CR17","doi-asserted-by":"crossref","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong Nash Equilibria in Games with the Lexicographical Improvement Property. In: Leonardi, S. (ed.): WINE, vol. 5929 of LNCS, pp. 463\u2013470. Sprigner (2009)","DOI":"10.1007\/978-3-642-10841-9_43"},{"issue":"17","key":"9598_CR18","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 410(17), 1589\u20131598 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9598_CR19","doi-asserted-by":"crossref","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 36(6), 683\u2013693 (2003)","journal-title":"Theory of Computing Systems"},{"key":"9598_CR20","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.): STACS, vol. 1563 of LNCS, pp. 404\u2013413. Springer (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"2","key":"9598_CR21","doi-asserted-by":"crossref","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. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"9598_CR22","doi-asserted-by":"crossref","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 14, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"9598_CR23","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"1","key":"9598_CR24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"1","key":"9598_CR25","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"19","author":"P Schuurman","year":"2007","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. INFORMS J. Comput. 19(1), 52\u201363 (2007)","journal-title":"INFORMS J. Comput."},{"key":"9598_CR26","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Selfish Load Balancing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.): Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.022"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9598-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9598-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9598-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:27Z","timestamp":1558698867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9598-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,23]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9598"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9598-9","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,23]]}}}