{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:01:38Z","timestamp":1773522098470,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161698","type":"print"},{"value":"9783642161704","type":"electronic"}],"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_18","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"198-209","source":"Crossref","is-referenced-by-count":17,"title":["The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","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":"36","key":"18_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0165-1765(91)90179-O","volume":"2","author":"K. Basu","year":"1991","unstructured":"Basu, K., Weibull, J.W.: Strategy subsets closed under rational behavior. Economics Letters\u00a02(36), 141\u2013146 (1991)","journal-title":"Economics Letters"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S. Basu","year":"1996","unstructured":"Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM\u00a043(6), 1002\u20131045 (1996)","journal-title":"Journal of the ACM"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Benisch, M., Davis, G.B., Sandholm, T.: Algorithms for closed under rational behavior (CURB) sets. Journal of Artificial Intelligence Research (Forthcoming 2010)","DOI":"10.1613\/jair.3070"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2938241","volume":"59","author":"L. Blume","year":"1991","unstructured":"Blume, L., Brandenburger, A., Dekel, E.: Lexicographic probabilities and equilibrium refinements. Econometrica\u00a059, 81\u201398 (1991)","journal-title":"Econometrica"},{"key":"18_CR5","first-page":"365","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"C. Borgs","year":"2008","unstructured":"Borgs, C., Chayes, J.T., Immorlica, N., Kalai, A.T., Mirrokni, V.S., Papadimitriou, C.H.: The myth of the folk theorem. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 365\u2013372. ACM, New York (2008)"},{"key":"18_CR6","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"},{"issue":"1-2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0747-7171(88)80008-7","volume":"5","author":"M. Coste","year":"1988","unstructured":"Coste, M., Roy, M.: Thom\u2019s lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets. Journal of Symbolic Computation\u00a05(1-2), 121\u2013129 (1988)","journal-title":"Journal of Symbolic Computation"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01769861","volume":"13","author":"E. Damme van","year":"1984","unstructured":"van Damme, E.: A relation between perfect equilibria in extensive form games and proper equilibria in normal form games. International Journal of Game Theory\u00a013, 1\u201313 (1984)","journal-title":"International Journal of Game Theory"},{"key":"18_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58242-4","volume-title":"Stability and Perfection of Nash Equlibria","author":"E. Damme van","year":"1991","unstructured":"van Damme, E.: Stability and Perfection of Nash Equlibria, 2nd edn. Springer, Heidelberg (1991)","edition":"2"},{"key":"18_CR10","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":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00182-007-0095-0","volume":"31","author":"K. Etessami","year":"2008","unstructured":"Etessami, K., Lochbihler, A.: The computational complexity of evolutionarily stable strategies. International Journal of Game Theory\u00a031(1), 93\u2013113 (2008)","journal-title":"International Journal of Game Theory"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/11523468_72","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 891\u2013903. Springer, Heidelberg (2005)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points (extended abstract). In: Proc. 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 113\u2013123 (2007)","DOI":"10.1109\/FOCS.2007.39"},{"key":"18_CR14","first-page":"10","volume-title":"Proceedings of the 8th Annual ACM Symposium on Theory of Computing, STOC 1976","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, STOC 1976, Hershey, PA, May 3-5, pp. 10\u201322. ACM Press, New York (1976)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s001820200113","volume":"31","author":"S. Govindan","year":"2003","unstructured":"Govindan, S., Klumpp, T.: Perfect equilibrium and lexicographic beliefs. International Journal of Game Theory\u00a031(2), 229\u2013243 (2003)","journal-title":"International Journal of Game Theory"},{"key":"18_CR16","unstructured":"Graham, R.L.: 10 - Problems and Solutions. In: P73: Euclidian Minimum Spanning Trees. Bulletin of the EATCS, vol.\u00a024, pp. 205\u2013206. EATCS (October 1984)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-540-92185-1_74","volume-title":"Internet and Network Economics","author":"K.A. Hansen","year":"2008","unstructured":"Hansen, K.A., Hansen, T.D., Miltersen, P.B., S\u00f8rensen, T.B.: Approximability and parameterized complexity of minmax values. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 684\u2013695. Springer, Heidelberg (2008)"},{"key":"18_CR18","first-page":"1597","volume-title":"Handbook of Game Theory, ch. 42","author":"J. Hillas","year":"2002","unstructured":"Hillas, J., Kohlberg, E.: Foundations of strategic equilibria. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory, ch. 42, vol.\u00a03, pp. 1597\u20131663. Elsevier Science, Amsterdam (2002)"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jeth.1997.2295","volume":"75","author":"E. Kohlberg","year":"1997","unstructured":"Kohlberg, E., Reny, P.J.: Independence on relative probability spaces and consistent assessments in game trees. Journal of Economic Theory\u00a075(2), 280\u2013313 (1997)","journal-title":"Journal of Economic Theory"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/game.1996.0051","volume":"14","author":"D. Koller","year":"1996","unstructured":"Koller, D., Megiddo, N., von Stengel, B.: Efficient computation of equilibria for extensive form games. Games and Economic Behavior\u00a014, 247\u2013259 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"D.M. Kreps","year":"1982","unstructured":"Kreps, D.M., Wilson, R.: Sequential equilibria. Econometrica\u00a050(4), 863\u2013894 (1982)","journal-title":"Econometrica"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/S0899-8256(05)80007-7","volume":"8","author":"J.F. Mertens","year":"1995","unstructured":"Mertens, J.F.: Two examples of strategic equilibrium. Games and Economic Behavior\u00a08, 378\u2013388 (1995)","journal-title":"Games and Economic Behavior"},{"key":"18_CR23","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4040-2","volume-title":"Field and Galois Theory","author":"P. Morandi","year":"1996","unstructured":"Morandi, P.: Field and Galois Theory. Graduate Texts in Mathematics, vol.\u00a0167. Springer, Heidelberg (1996)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01769254","volume":"15","author":"R.B. Myerson","year":"1978","unstructured":"Myerson, R.B.: Refinements of the Nash equilibrium concept. International Journal of Game Theory\u00a015, 133\u2013154 (1978)","journal-title":"International Journal of Game Theory"},{"key":"18_CR25","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"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:40:03Z","timestamp":1553172003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}