{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:01:49Z","timestamp":1648530109429},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,8,5]],"date-time":"2010-08-05T00:00:00Z","timestamp":1280966400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00287-010-0462-2","type":"journal-article","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T08:56:39Z","timestamp":1280912199000},"page":"462-467","source":"Crossref","is-referenced-by-count":0,"title":["Berechnung von Nash-Gleichgewichten"],"prefix":"10.1007","volume":"33","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,5]]},"reference":[{"key":"462_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann H, R\u00f6glin H, V\u00f6cking B (2008) On the impact of combinatorial structure on congestion games. J ACM 55(6)","DOI":"10.1145\/1455248.1455249"},{"key":"462_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R Aumann","year":"1974","unstructured":"Aumann R (1974) Subjectivity and correlation in randomized strategies. J Math Econ 1:67\u201396","journal-title":"J Math Econ"},{"key":"462_CR3","doi-asserted-by":"crossref","unstructured":"Blum A, Mansour Y (2007) Learning, regret minimization, and equilibria. In: Nisan N, Tardos \u00c9, Roughgarden T, Vazirani V (eds) Algorithmic Game Theory, Chapter 4. Cambridge University Press","DOI":"10.1017\/CBO9780511800481.006"},{"key":"462_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Deng X, Teng S-H (2009) Settling the complexity of computing two-player Nash equilibria. J ACM 56(3)","DOI":"10.1145\/1516512.1516516"},{"key":"462_CR5","unstructured":"Chien S, Sinclair A (2007) Convergence to approximate Nash equilibria in congestion games. In: Proc. 18th Symp. Discrete Algorithms (SODA), pp 169\u2013178"},{"key":"462_CR6","doi-asserted-by":"crossref","unstructured":"Daskalakis C, Goldberg P, Papadimitriou C (2006) The complexity of computing a Nash equilibrium. In: Proc. 38th Symp. Theory of Computing (STOC), pp 71\u201378","DOI":"10.1145\/1132516.1132527"},{"key":"462_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis C, Papadimitriou C (2009) On oblivious PTAS\u2019s for Nash equilibrium. In: Proc. 41st Symp. Theory of Computing (STOC), pp 75\u201384","DOI":"10.1145\/1536414.1536427"},{"key":"462_CR8","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp 604\u2013612","DOI":"10.1145\/1007352.1007445"},{"key":"462_CR9","unstructured":"Ieong S, McGrew R, Nudelman E, Shoham Y, Sun Q (2005) Fast and compact: A simple class of congestion games. In: Proc. 20th Conf. Artificial Intelligence (AAAI), pp 489\u2013494"},{"key":"462_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D Johnson","year":"1988","unstructured":"Johnson D, Papadimitriou C, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79\u2013100","journal-title":"J Comput Syst Sci"},{"key":"462_CR11","first-page":"1093","volume":"244","author":"L Khachian","year":"1979","unstructured":"Khachian L (1979) A polynomial algorithm in linear programming (in Russian). Dokl Akad Nauk SSSR 244:1093\u20131096","journal-title":"Dokl Akad Nauk SSSR"},{"key":"462_CR12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C Lemke","year":"1964","unstructured":"Lemke C, Howson J (1964) Equilibrium points of bimatrix games. SIAM J Appl Math 12:413\u2013423","journal-title":"SIAM J Appl Math"},{"key":"462_CR13","doi-asserted-by":"crossref","unstructured":"Lipton R, Markakis V, Mehta A (2003) Playing large games using simple strategies. In: Proc. 3rd Conf. Electronic Commerce (EC), pp 36\u201341","DOI":"10.1145\/779928.779933"},{"issue":"2","key":"462_CR14","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash J (1951) Non-cooperative games. Ann Math 54(2):286\u2013295","journal-title":"Ann Math"},{"key":"462_CR15","volume-title":"Theory of Games and Economic Behavior","author":"J Neumann von","year":"1944","unstructured":"von Neumann J, Morgenstern O (1944) Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ"},{"issue":"3","key":"462_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48(3):498\u2013532","journal-title":"J Comput Syst Sci"},{"key":"462_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou C, Roughgarden T (2008) Computing correlated equilibria in multiplayer games. J ACM 55(3)","DOI":"10.1145\/1379759.1379762"},{"key":"462_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R Rosenthal","year":"1973","unstructured":"Rosenthal R (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2:65\u201367","journal-title":"Int J Game Theory"},{"issue":"2","key":"462_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1111\/j.1468-0262.2006.00667.x","volume":"74","author":"R Savani","year":"2006","unstructured":"Savani R, von Stengel B (2006) Hard-to-solve bimatrix games. Econometrica 74(2):397\u2013429","journal-title":"Econometrica"},{"key":"462_CR20","doi-asserted-by":"crossref","unstructured":"Skopalik A, V\u00f6cking B (2008) Inapproximability of pure Nash equilibria. In: Proc. 40th Symp. Theory of Computing (STOC), pp 355\u2013364","DOI":"10.1145\/1374376.1374428"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0462-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-010-0462-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-010-0462-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:38:58Z","timestamp":1559374738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-010-0462-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s00287-010-0462-2","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,5]]}}}