We introduce generalized Wadge games and show that each lower cone in the Weihrauch degrees is characterized by such a game. These generalized Wadge games subsume (a variant of) the original Wadge game, the eraser and backtrack games as well as Semmes’s tree games. In particular, we propose that the lower cones in the Weihrauch degrees are the answer to Andretta’s question on which classes of functions admit game characterizations. We then discuss some applications of such generalized Wadge games.
CITATION STYLE
Nobrega, H., & Pauly, A. (2017). Game characterizations and lower cones in the Weihrauch degrees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10307 LNCS, pp. 327–337). Springer Verlag. https://doi.org/10.1007/978-3-319-58741-7_31
Mendeley helps you to discover research relevant for your work.