{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:14Z","timestamp":1760202674126,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_25","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"246-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Weihrauch Degrees of Finding Equilibria in Sequential Games"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Le Roux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arno","family":"Pauly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An arithmetical hierarchy of the law of excluded middle and related principles. In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 192\u2013201 (2004)","DOI":"10.1109\/LICS.2004.1319613"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/malq.200310125","volume":"51","author":"V Brattka","year":"2005","unstructured":"Brattka, V.: Effective Borel measurability and reducibility of functions. Math. Logic Q. 51(1), 19\u201344 (2005)","journal-title":"Math. Logic Q."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2178\/bsl\/1294186663","volume":"1","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bull. Symbolic Logic 1, 73\u2013117 (2011). arXiv:0905.4685","journal-title":"Bull. Symbolic Logic"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2178\/jsl\/1294170993","volume":"76","author":"V Brattka","year":"2011","unstructured":"Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symbolic Logic 76, 143\u2013176 (2011). arXiv:0905.4679","journal-title":"J. Symbolic Logic"},{"key":"25_CR5","unstructured":"Brattka, V., Gherardi, G., H\u00f6lzl, R.: Probabilistic computability and choice. arXiv\u00a01312.7305 (2013). http:\/\/arxiv.org\/abs\/1312.7305"},{"issue":"6","key":"25_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.apal.2011.10.006","volume":"163","author":"V Brattka","year":"2012","unstructured":"Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstrass theorem is the jump of weak K\u00f6nig\u2019s Lemma. Ann. Pure Appl. Logic 163(6), 623\u2013625 (2012). arXiv:1101.0792","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2\u20133","key":"25_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0165-4896(92)90059-E","volume":"24","author":"D Cenzer","year":"1992","unstructured":"Cenzer, D., Remmel, J.: Recursively presented games and strategies. Math. Soc. Sci. 24(2\u20133), 117\u2013139 (1992)","journal-title":"Math. Soc. Sci."},{"key":"25_CR8","unstructured":"Eguchi, N.: Infinite games in the cantor space over admissible set theories. In: Higuchi, K. (ed.) Proceedings of Computability Theory and Foundations of Mathematics (2014)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0003-4843(71)90018-0","volume":"2","author":"H Friedman","year":"1971","unstructured":"Friedman, H.: Higher set theory and mathematical practice. Ann. Math. Logic 2(3), 325\u2013357 (1971)","journal-title":"Ann. Math. Logic"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gale, D., Stewart, F.: Infinite games with perfect information. In: Contributions to the Theory of Games, Annals of Mathematical Studies, vol. 28, pp. 245\u2013266. Princeton University Press (1953)","DOI":"10.1515\/9781400881970-014"},{"issue":"5","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1016\/j.apal.2014.01.003","volume":"165","author":"K Higuchi","year":"2014","unstructured":"Higuchi, K., Kihara, T.: Inside the muchnik degrees I: discontinuity, learnability and constructivism. Ann. Pure Appl. Logic 165(5), 1058\u20131114 (2014)","journal-title":"Ann. Pure Appl. Logic"},{"key":"25_CR12","series-title":"Graduate Texts in Mathematic","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A Kechris","year":"1995","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Graduate Texts in Mathematic, vol. 156. Springer, New York (1995)"},{"issue":"2","key":"25_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.2168\/LMCS-9(2:3)2013","volume":"9","author":"S Le Roux","year":"2013","unstructured":"Le Roux, S.: Infinite sequential Nash equilibria. Logical Methods Comput. Sci. 9(2), 14 (2013)","journal-title":"Logical Methods Comput. Sci."},{"issue":"4\u20135","key":"25_CR14","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1002\/malq.201300034","volume":"60","author":"S Le Roux","year":"2014","unstructured":"Le Roux, S.: From winning strategy to Nash equilibrium. Math. Logic Q. 60(4\u20135), 354\u2013371 (2014). http:\/\/dx.doi.org\/10.1002\/malq.201300034, arXiv\u00a01203.1866","journal-title":"Math. Logic Q."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Le Roux, S., Pauly, A.: Infinite sequential games with real-valued payoffs. In: CSL-LICS 2014, pp. 62:1\u201362:10. ACM (2014). http:\/\/doi.acm.org\/10.1145\/2603088.2603120","DOI":"10.1145\/2603088.2603120"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Le Roux, S., Pauly, A.: Weihrauch degrees of finding equilibria in sequential games. arXiv:1407.5587 (2014)","DOI":"10.1007\/978-3-319-20028-6_25"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363\u2013371 (1975). http:\/\/www.jstor.org\/stable\/1971035","journal-title":"Ann. Math."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1112\/plms\/pdr022","volume":"104","author":"A Montalb\u00e1n","year":"2012","unstructured":"Montalb\u00e1n, A., Shore, R.A.: The limits of determinacy in second-order arithmetic. Proc. London Math. Soc. 104(2), 223\u2013252 (2012). http:\/\/plms.oxfordjournals.org\/content\/104\/2\/223.abstract","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/malq.200710081","volume":"55","author":"T Nemoto","year":"2009","unstructured":"Nemoto, T.: Determinacy of wadge classes and subsystems of second order arithmetic. Math. Logic Q. 55(2), 154\u2013176 (2009). http:\/\/dx.doi.org\/10.1002\/malq.200710081","journal-title":"Math. Logic Q."},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/malq.200610041","volume":"53","author":"T Nemoto","year":"2007","unstructured":"Nemoto, T., MedSalem, M.O., Tanaka, K.: Infinite games in the Cantor space and subsystems of second order arithmetic. Math. Logic Q. 53(3), 226\u2013236 (2007)","journal-title":"Math. Logic Q."},{"issue":"18","key":"25_CR21","first-page":"2686","volume":"16","author":"A Pauly","year":"2010","unstructured":"Pauly, A.: How incomputable is finding Nash equilibria? J. Univ. Comput. Sci. 16(18), 2686\u20132710 (2010)","journal-title":"J. Univ. Comput. Sci."},{"key":"25_CR22","unstructured":"Pauly, A.: Computable Metamathematics and its Application to Game Theory. Ph.D. thesis, University of Cambridge (2012)"},{"key":"25_CR23","unstructured":"Pauly, A., de Brecht, M.: Towards synthetic descriptive set theory: an instantiation with represented spaces. arXiv 1307.1850"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:36:02Z","timestamp":1676943362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}