{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:18:40Z","timestamp":1773656320793,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406716","type":"print"},{"value":"9783540451389","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_49","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"551-561","source":"Crossref","is-referenced-by-count":31,"title":["Which Is the Worst-Case Nash Equilibrium?"],"prefix":"10.1007","author":[{"given":"Thomas","family":"L\u00fccking","sequence":"first","affiliation":[]},{"given":"Marios","family":"Mavronicolas","sequence":"additional","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Rode","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds forWorst-Case Equilibria. In: Proceedings of the 13th Annual ACM Symposium on Discrete Algorithms, pp. 413\u2013420 (2002)"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the Coordination Ratio for a Selfish Routing Game. In: 30th International Colloquium on Automata, Languages and Programming (2003)","DOI":"10.1007\/3-540-45061-0_42"},{"key":"49_CR3","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":"49_CR4","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Extreme Nash Equilibria, March 2003, submitted for publication. Also available as Technical Report FLAGS-TR-02-5, Computer Technology Institute, Patras, Greece (November 2002)","DOI":"10.1007\/978-3-540-45208-9_1"},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM Journal on Computing\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM Journal on Applied Mathematics\u00a017, 416\u2013426 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"49_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and aproximate algorithms for scheduling nonidentical processors. Journal of the Association of Computing Machinery\u00a023(2), 317\u2013327 (1976)","journal-title":"Journal of the Association of Computing Machinery"},{"key":"49_CR8","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (2002); accepted to Theory of Computing Systems"},{"key":"49_CR9","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":"49_CR10","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, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"3\/4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01769190","volume":"7","author":"H. Moulin","year":"1978","unstructured":"Moulin, H., Vial, L.: Strategically Zero-Sum Games: The Class of Games whose Completely Mixed Equilibria Cannot be Improved Upon. International Journal of Game Theory\u00a07(3\/4), 201\u2013221 (1978)","journal-title":"International Journal of Game Theory"},{"key":"49_CR12","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. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"49_CR13","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":"49_CR14","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"2","key":"49_CR16","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1112\/jlms\/2.Part_4.709","volume":"2","author":"T.E.S. Raghavan","year":"1970","unstructured":"Raghavan, T.E.S.: Completely Mixed Strategies in Bimatrix Games. Journal of London Mathematical Society\u00a02(2), 709\u2013712 (1970)","journal-title":"Journal of London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:53:56Z","timestamp":1559210036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}