{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T10:31:11Z","timestamp":1672482671189},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T00:00:00Z","timestamp":1289347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00224-010-9298-z","type":"journal-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T07:48:55Z","timestamp":1289288935000},"page":"139-161","source":"Crossref","is-referenced-by-count":2,"title":["The Computational Complexity of Weak Saddles"],"prefix":"10.1007","volume":"49","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Brill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,10]]},"reference":[{"key":"9298_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0165-1765(91)90179-O","volume":"36","author":"K. Basu","year":"1991","unstructured":"Basu, K., Weibull, J.: Strategy subsets closed under rational behavior. Econ. Lett. 36, 141\u2013146 (1991)","journal-title":"Econ. Lett."},{"key":"9298_CR2","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-642-13073-1_27","volume-title":"Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC)","author":"D. Baumeister","year":"2010","unstructured":"Baumeister, D., Brandt, F., Fischer, F., Hoffmann, J., Rothe, J.: The complexity of computing minimal unidirectional covering sets. In: Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC). Lecture Notes in Computer Science (LNCS), vol. 6078, pp. 299\u2013310. Springer, Berlin (2010)"},{"issue":"4","key":"9298_CR3","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.2307\/1911196","volume":"52","author":"B. Bernheim","year":"1984","unstructured":"Bernheim, B.: Rationalizable strategic behavior. Econometrica 52(4), 1007\u20131028 (1984)","journal-title":"Econometrica"},{"issue":"2","key":"9298_CR4","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.mathsocsci.2008.04.001","volume":"56","author":"F. Brandt","year":"2008","unstructured":"Brandt, F., Fischer, F.: Computing the minimal covering set. Math. Soc. Sci. 56(2), 254\u2013268 (2008)","journal-title":"Math. Soc. Sci."},{"key":"9298_CR5","first-page":"209","volume-title":"Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","author":"F. Brandt","year":"2009","unstructured":"Brandt, F., Brill, M., Fischer, F., Harrenstein, P.: Computational aspects of Shapley\u2019s saddles. In: Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 209\u2013216 (2009)"},{"key":"9298_CR6","author":"F. Brandt","year":"2010","unstructured":"Brandt, F., Brill, M., Fischer, F., Harrenstein, P.: On the complexity of iterated weak dominance in constant-sum games. Theory Comput. Syst. (2010). doi: 10.1007\/s00224-010-9282-7","journal-title":"Theory Comput. Syst."},{"key":"9298_CR7","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J.\u00a0ACM 56(3) (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"9298_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/1064009.1064019","volume-title":"Proceedings of the 6th ACM Conference on Electronic Commerce (ACM-EC)","author":"V. Conitzer","year":"2005","unstructured":"Conitzer, V., Sandholm, T.: Complexity of (iterated) dominance. In: Proceedings of the 6th ACM Conference on Electronic Commerce (ACM-EC), pp. 88\u201397. ACM Press, New York (2005)"},{"issue":"1","key":"9298_CR9","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":"9298_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jeth.1996.0085","volume":"70","author":"J. Duggan","year":"1996","unstructured":"Duggan, J., Le Breton, M.: Dutta\u2019s minimal covering set and Shapley\u2019s saddles. J. Econ. Theory 70, 257\u2013265 (1996)","journal-title":"J. Econ. Theory"},{"key":"9298_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0531(88)90096-8","volume":"44","author":"B. Dutta","year":"1988","unstructured":"Dutta, B.: Covering sets and a new Condorcet choice correspondence. J. Econ. Theory 44, 63\u201380 (1988)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"9298_CR12","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)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9298_CR13","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E. Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806\u2013825 (1997)","journal-title":"J. ACM"},{"key":"9298_CR14","volume-title":"Games and Decisions: Introduction and Critical Survey","author":"R.D. Luce","year":"1957","unstructured":"Luce, R.D., Raiffa, H.: Games and Decisions: Introduction and Critical Survey. Wiley, New York (1957)"},{"issue":"4","key":"9298_CR15","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.2307\/1959383","volume":"70","author":"R.D. McKelvey","year":"1976","unstructured":"McKelvey, R.D., Ordeshook, P.C.: Symmetric spatial games without majority rule equilibria. Am. Polit. Sci. Rev. 70(4), 1172\u20131184 (1976)","journal-title":"Am. Polit. Sci. Rev."},{"key":"9298_CR16","volume-title":"Game Theory: Analysis of Conflict","author":"R.B. Myerson","year":"1991","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press, Harvard (1991)"},{"issue":"2","key":"9298_CR17","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"9298_CR18","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"4","key":"9298_CR19","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(4), 1029\u20131050 (1984)","journal-title":"Econometrica"},{"key":"9298_CR20","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0899-8256(92)90020-S","volume":"4","author":"L. Samuelson","year":"1992","unstructured":"Samuelson, L.: Dominated strategies and common knowledge. Games Econ. Behav. 4, 284\u2013313 (1992)","journal-title":"Games Econ. Behav."},{"key":"9298_CR21","unstructured":"Shapley, L.: Order matrices, I. Technical Report RM-1142, The RAND Corporation (1953a)"},{"key":"9298_CR22","unstructured":"Shapley, L.: Order matrices, II. Technical Report RM-1145, The RAND Corporation (1953b)"},{"key":"9298_CR23","series-title":"Annals of Mathematics Studies","first-page":"1","volume-title":"Advances in Game Theory","author":"L. Shapley","year":"1964","unstructured":"Shapley, L.: Some topics in two-person games. In: Dresher, M., Shapley, L.S., Tucker, A.W. (eds.) Advances in Game Theory. Annals of Mathematics Studies, vol.\u00a052, pp. 1\u201329. Princeton University Press, Princeton (1964)"},{"key":"9298_CR24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann, J.: Zur Theorie der Gesellschaftspiele. Math. Ann. 100, 295\u2013320 (1928)","journal-title":"Math. Ann."},{"key":"9298_CR25","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"9298_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K. Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theor. Comput. Sci. 51, 53\u201380 (1987)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9298-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9298-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9298-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T04:23:17Z","timestamp":1559794997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9298-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9298"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9298-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,10]]}}}