{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:26:49Z","timestamp":1742920009558,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_2","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:08:07Z","timestamp":1286957287000},"page":"15-17","source":"Crossref","is-referenced-by-count":0,"title":["How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-12107-4","volume-title":"SAGT 2010","author":"F. Brandt","year":"2010","unstructured":"Brandt, F., Fischer, F., Harrenstein, P.: On the Rate of Convergence of Fictitious Play. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 103\u2013114. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Conitzer, V.: Approximation Guarantees for Fictitious Play. In: Proceedings of the 47th Annual Allerton Conference on Communication, Control and Computing (Allerton 2009), pp. 636\u2013643 (2009)","key":"2_CR2","DOI":"10.1109\/ALLERTON.2009.5394918"},{"unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. In: 18th International Joint Conference on Artificial Intelligence, IJCAI (2003)","key":"2_CR3"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C. Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. SIAM Journal on Computing\u00a039(1), 195\u2013259 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR5","volume-title":"The Theory of Learning in Games","author":"D. Fudenberg","year":"1998","unstructured":"Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I. Gilboa","year":"1989","unstructured":"Gilboa, I., Zemel, E.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior\u00a01, 80\u201393 (1989)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Papadimitriou, C.H., Savani, R.: The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions, Arxiv technical report 1006.5352 (2010)","key":"2_CR7","DOI":"10.1109\/FOCS.2011.26"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00199-009-0441-5","volume":"42","author":"P.J.-J. Herings","year":"2010","unstructured":"Herings, P.J.-J., Peeters, R.: Homotopy methods to compute equilibria in game theory. Economic Theory\u00a042(1), 119\u2013156 (2010)","journal-title":"Economic Theory"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","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.: Hard-to-Solve Bimatrix Games. Econometrica\u00a074(2), 397\u2013429 (2006)","journal-title":"Econometrica"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:21:47Z","timestamp":1559722907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}