{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:26Z","timestamp":1759638326552},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309000"},{"type":"electronic","value":"9783540322931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11600930_16","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T14:48:12Z","timestamp":1132843692000},"page":"151-160","source":"Crossref","is-referenced-by-count":4,"title":["On the Structure and Complexity of Worst-Case Equilibria"],"prefix":"10.1007","author":[{"given":"Simon","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Baltz, A., Srivastav, A.: On the asymptotic inefficiency of the fully mixed Nash equilibrium (2005) (preprint)"},{"key":"16_CR2","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th Ann. ACM\u2013SIAM Symp. on Discrete Algorithms (SODA), pp. 413\u2013420 (2002)"},{"key":"16_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":"16_CR4","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.G.: Extreme Nash equilibria. In: Proc. 8th Italian Conference on Theoretical Computer Science, pp. 1\u201320 (2003)","DOI":"10.1007\/978-3-540-45208-9_1"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.G.: Structure and complexity of extreme Nash equilibria. Theoretical Computer Science (2005) (to appear)","DOI":"10.1016\/j.tcs.2005.05.011"},{"issue":"2","key":"16_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/322248.322254","volume":"28","author":"G. Gonnet","year":"1981","unstructured":"Gonnet, G.: Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery\u00a028(2), 289\u2013304 (1981)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of Chernoff bounds. Information Processing Letters\u00a0(33), 305\u2013308 (1990)","DOI":"10.1016\/0020-0190(90)90214-I"},{"issue":"6","key":"16_CR9","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 Comput. Syst.\u00a036(6), 683\u2013693 (2003)","journal-title":"Theory Comput. Syst."},{"key":"16_CR10","first-page":"404","volume-title":"Proc. 16th Int. Symp. on Theoret. Aspects of Comput. Sci. (STACS)","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc. 16th Int. Symp. on Theoret. Aspects of Comput. Sci (STACS), pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proc. 33rd Ann. ACM. Symp. on Theory of Comput. (STOC), pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11600930_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:09Z","timestamp":1619506869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11600930_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309000","9783540322931"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11600930_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}