{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:49:25Z","timestamp":1649018965020},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T00:00:00Z","timestamp":1435276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00224-015-9637-1","type":"journal-article","created":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T05:25:42Z","timestamp":1435209942000},"page":"52-75","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Complexity of Iterated Elimination of Dominated Strategies"],"prefix":"10.1007","volume":"59","author":[{"given":"Arno","family":"Pauly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,26]]},"reference":[{"key":"9637_CR1","unstructured":"Apt, K.R.: Order independence and rationalizability. In: Theoretical Aspects of Rationality and Knowledge (TARK X) (2005). arXiv: cs\/0509063"},{"key":"9637_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1998.1575","volume":"57","author":"P Beame","year":"1998","unstructured":"Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. Syst. Sci. 57, 3\u201319 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"9637_CR3","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.2307\/1911196","volume":"52","author":"BD Bernheim","year":"1984","unstructured":"Bernheim, B.D.: Rationalizable strategic behavior. Econometrica 52, 1007\u20131028 (1984)","journal-title":"Econometrica"},{"issue":"1","key":"9637_CR4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s00224-010-9282-7","volume":"49","author":"F Brandt","year":"2011","unstructured":"Brandt, F., Brill, M., Fischer, F., Harrenstein, P.: On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems 49 (1), 162\u2013181 (2011). doi: 10.1007\/s00224-010-9282-7","journal-title":"Theory of Computing Systems"},{"key":"9637_CR5","unstructured":"de Callata\u00ff, A.: Natural and Artificial Intelligence, 2nd edn. North-Holland (1992)"},{"key":"9637_CR6","unstructured":"Chen, X., Deng, X.: Settling the complexity of 2-player Nash-equilibrium. Tech. Rep. 134, Electronic Colloquium on Computational Complexity (2005)"},{"key":"9637_CR7","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Complexity of (iterated) dominance. In: EC \u201905: Proceedings of the 6th ACM Conference on Electronic Commerce, pp 88\u201397. ACM, New York (2005), doi: 10.1145\/1064009.1064019","DOI":"10.1145\/1064009.1064019"},{"issue":"1","key":"9637_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"9637_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"3","key":"9637_CR10","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/moor.18.3.553","volume":"18","author":"I Gilboa","year":"1993","unstructured":"Gilboa, I., Kalai, E., Zemel, E.: The complexity of eliminating dominated strategies. Math. Oper. Res. 18(3), 553\u2013565 (1993) [ http:\/\/www.jstor.org\/stable\/ 3690089 ]","journal-title":"Math. Oper. Res."},{"key":"9637_CR11","unstructured":"Gilli, M.: Iterated admissibility as solution concept in game theory. Department of Economics Working Paper 47, University of Milan-Bicocca (2002)"},{"key":"9637_CR12","unstructured":"Kalai, E., Zemel, E.: On the order of eliminating dominated strategies. Discussion Papers 789, Northwestern University, Center for Mathematical Studies in Economics and Management Science (1988)"},{"issue":"3","key":"9637_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0167-6377(88)90075-2","volume":"7","author":"D Knuth","year":"1988","unstructured":"Knuth, D., Papadimitriou, C., Tsitsiklis, J.: A note on strategy elimination in bimatrix games. Oper. Res. Lett. 7(3), 103\u2013107 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9637_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1006\/game.1997.0525","volume":"18","author":"LM Marx","year":"1997","unstructured":"Marx, L.M., Swinkels, J.M.: Order independence for iterated weak dominance. Games and Economic Behavior 18(2), 219\u2013245 (1997)","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"9637_CR15","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1006\/game.2000.0798","volume":"31","author":"LM Marx","year":"2000","unstructured":"Marx, L.M., Swinkels, J.M.: Order independence for iterated weak dominance. Games and Economic Behavior 31(2), 324\u2013329 (2000). Corrigendum","journal-title":"Games and Economic Behavior"},{"key":"9637_CR16","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press (1994)"},{"key":"9637_CR17","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)"},{"key":"9637_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: The complexity of finding Nash equilibria. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory, pp 29\u201352, Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.004"},{"key":"9637_CR19","unstructured":"Pauly, A.: Computable Metamathematics and its Application to Game Theory. PhD Thesis, University of Cambridge (2012)"},{"issue":"18","key":"9637_CR20","first-page":"2686","volume":"16","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: How incomputable is finding Nash equilibria?. Journal of Universal Computer Science 16(18), 2686\u20132710 (2010). doi: 10.3217\/jucs-016-18-2686","journal-title":"Journal of Universal Computer Science"},{"key":"9637_CR21","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.2307\/1911197","volume":"52","author":"D Pearce","year":"1984","unstructured":"Pearce, D.: Rationalizable strategic behavior and the problem of perfection. Econometrica 52, 1029\u20131050 (1984)","journal-title":"Econometrica"},{"key":"9637_CR22","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Modeling Bounded Rationality. Zeuthen Lecture Book. Massachusetts Institut of Technology (1998)","DOI":"10.7551\/mitpress\/4702.001.0001"},{"key":"9637_CR23","unstructured":"Trost, M.: An epistemic rationale for order-independence. In: 10th Conference on Logic and the Foundations of Game and Decision Theory (2012)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9637-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9637-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9637-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T03:07:27Z","timestamp":1599188847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9637-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,26]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9637"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9637-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,26]]}}}