{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:56:35Z","timestamp":1760298995263,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448021"},{"type":"electronic","value":"9783662448038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44803-8_20","type":"book-chapter","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T13:45:22Z","timestamp":1409924722000},"page":"231-243","source":"Crossref","is-referenced-by-count":6,"title":["The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","first-page":"229","volume":"296","author":"R.M. Anderson","year":"1986","unstructured":"Anderson, R.M.: \u201cAlmost\u201d Implies \u201cNear\u201d. Transactions of the American Mathematical Society\u00a0296(1), 229\u2013237 (1986)","journal-title":"Transactions of the American Mathematical Society"},{"key":"20_CR2","unstructured":"Basu, S., Pollack, R., Roy, M.: Algorithms in Real Algebraic Geometry, 2nd edn. Springer (2008)"},{"key":"20_CR3","unstructured":"Basu, S., Pollack, R., Roy, M.: Algorithms in Real Algebraic Geometry, online edition (2011), http:\/\/perso.univ-rennes1.fr\/marie-francoise.roy\/bpr-ed2-posted2.html"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Procedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC 2006), pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"issue":"6","key":"20_CR6","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput.\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1287\/moor.18.3.548","volume":"18","author":"F. Gul","year":"1993","unstructured":"Gul, F., Pearce, D., Stacchetti, E.: A bound on the proportion of pure strategy equilibria in generic games. Math. of Oper. Res.\u00a018, 548\u2013552 (1993)","journal-title":"Math. of Oper. Res."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-16170-4_18","volume-title":"Algorithmic Game Theory","author":"K.A. Hansen","year":"2010","unstructured":"Hansen, K.A., Miltersen, P.B., S\u00f8rensen, T.B.: The computational complexity of trembling hand perfection and other equilibrium refinements. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 198\u2013209. Springer, Heidelberg (2010)"},{"key":"20_CR9","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a0III. Addison-Wesley (1973)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"Lemke, C.E.: Bimatrix equilibrium points and mathematical programming. Management Science\u00a011, 681\u2013689 (1965)","journal-title":"Management Science"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00199-009-0440-6","volume":"42","author":"P.B. Miltersen","year":"2010","unstructured":"Miltersen, P.B., S\u00f8rensen, T.B.: Computing a quasi-perfect equilibrium of a two-player game. Economic Theory\u00a042(1), 175\u2013192 (2010)","journal-title":"Economic Theory"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics\u00a054, 289\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On graph-theoretic lemmata and complexity classes. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, St. Louis, MS, pp. 794\u2013801. IEEE Computer Society Press (October 1990)","DOI":"10.1109\/FSCS.1990.89602"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1137\/0115116","volume":"15","author":"H.E. Scarf","year":"1967","unstructured":"Scarf, H.E.: The approximation of fixed points of a continuous mapping. SIAM Journal of Applied Mathematics\u00a015, 1328\u20131343 (1967)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01766400","volume":"4","author":"R. Selten","year":"1975","unstructured":"Selten, R.: A reexamination of the perfectness concept for equilibrium points in extensive games. International Journal of Game Theory\u00a04, 25\u201355 (1975)","journal-title":"International Journal of Game Theory"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"S\u00f8rensen, T.B.: Computing a proper equilibrium of a bimatrix game. In: ACM Conference on Electronic Commerce, EC 2012, pp. 916\u2013928 (2012)","DOI":"10.1145\/2229012.2229081"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"van Damme, E.: Stability and Perfection of Nash Equlibria, 2nd edn. Springer (1991)","DOI":"10.1007\/978-3-642-58242-4"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1111\/1468-0262.00300","volume":"70","author":"B. Stengel von","year":"2002","unstructured":"von Stengel, B., van den Elzen, A., Talman, D.: Computing normal form perfect equilibria for extensive two-person games. Econometrica\u00a070(2), 693\u2013715 (2002)","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-662-44803-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T13:44:26Z","timestamp":1746366266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44803-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448021","9783662448038"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44803-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}