How Discontinuous is Computing Nash Equilibria? (Extended Abstract). - Arno Pauly (CCA, 2009)

How discontinuous is Computing Nash Equilibria? - Arno Pauly (CoRR, 2009)

Infinite Oracle Queries in Type-2 Machines (Extended Abstract) - Arno Pauly (CoRR, 2009)

The Complexity of Iterated Strategy Elimination - Arno Pauly (CoRR, 2009)

Representing Measurement Results. - Arno Pauly (J. Univers. Comput. Sci., 2009)

Computation with Advice - Vasco Brattka; Arno Pauly (CCA, 2010)

How Incomputable is Finding Nash Equilibria? - Arno Pauly (J. Univers. Comput. Sci., 2010)

On the (semi)lattices induced by continuous reducibilities. - Arno Pauly (Math. Log. Q., 2010)

The degree structure of Weihrauch-reducibility - Kojiro Higuchi; Arno Pauly (Log. Methods Comput. Sci., 2011)

Many-one reductions between search problems - Arno Pauly (CoRR, 2011)

On the Computational Content of the Brouwer Fixed Point Theorem. - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CiE, 2012)

Multi-valued Functions in Computability Theory. - Arno Pauly (CiE, 2012)

Closed choice and a Uniform Low Basis Theorem. - Vasco Brattka; Matthew de Brecht; Arno Pauly (Ann. Pure Appl. Log., 2012)

Non-deterministic computation and the Jayne-Rogers Theorem. - Arno Pauly; Matthew de Brecht (DCM, 2012)

Connected Choice and the Brouwer Fixed Point Theorem - Vasco Brattka; Stéphane Le Roux 001; Arno Pauly (CoRR, 2012)

Efficient Decomposition of Bimatrix Games - Xiang Jiang 002; Arno Pauly (CoRR, 2012)

Computable metamathematics and its application to game theory. - Arno Pauly (2012)

Closed Choice for Finite and for Convex Sets. - Stéphane Le Roux 001; Arno Pauly (CiE, 2013)

Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces. - Arno Pauly; Matthew de Brecht (CoRR, 2013)

Relative computability and uniform continuity of relations. - Arno Pauly; Martin Ziegler 001 (J. Log. Anal., 2013)

Function Spaces for Second-Order Polynomial Time. - Akitoshi Kawamura; Arno Pauly (CiE, 2014)

Infinite sequential games with real-valued payoffs. - Stéphane Le Roux 001; Arno Pauly (CSL-LICS, 2014)

Efficient Decomposition of Bimatrix Games (Extended Abstract). - Xiang Jiang 002; Arno Pauly (SR, 2014)

On function spaces and polynomial-time computability. - Akitoshi Kawamura; Arno Pauly (CoRR, 2014)

Point degree spectra of represented spaces. - Takayuki Kihara; Arno Pauly (CoRR, 2014)

The descriptive theory of represented spaces. - Arno Pauly (CoRR, 2014)

Weihrauch Degrees of Finding Equilibria in Sequential Games. - Stéphane Le Roux 001; Arno Pauly (CiE, 2015)

Descriptive Set Theory in the Category of Represented Spaces. - Arno Pauly; Matthew de Brecht (LICS, 2015)

Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract). - Arno Pauly (MFCS (1), 2015)

Computability on the countable ordinals and the Hausdorff-Kuratowski theorem. - Arno Pauly (CoRR, 2015)

Closed choice: Cardinality vs convex dimension - Stéphane Le Roux 001; Arno Pauly (Log. Methods Comput. Sci., 2015)

Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392). - Vasco Brattka; Akitoshi Kawamura; Alberto Marcone; Arno Pauly (Dagstuhl Reports, 2015)

The Brouwer Fixed Point Theorem Revisited. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (CiE, 2016)

Representations of Analytic Functions and Weihrauch Degrees. - Arno Pauly; Florian Steinberg 001 (CSR, 2016)

Dividing by Zero - How Bad Is It, Really?. - Takayuki Kihara; Arno Pauly (MFCS, 2016)

On the topological aspects of the theory of represented spaces. - Arno Pauly (Comput., 2016)

Extending finite memory determinacy: General techniques and an application to energy parity games. - Stéphane Le Roux 001; Arno Pauly (CoRR, 2016)

Extending Finite Memory Determinacy to Multiplayer Games. - Stéphane Le Roux 001; Arno Pauly (SR, 2016)

A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). - Stéphane Le Roux 001; Arno Pauly (GandALF, 2016)

Tω-representations of compact sets. - Arno Pauly; Hideki Tsuiki (CoRR, 2016)

The Computational Complexity of Iterated Elimination of Dominated Strategies. - Arno Pauly (Theory Comput. Syst., 2016)

The Vitali Covering Theorem in the Weihrauch Lattice. - Vasco Brattka; Guido Gherardi; Rupert Hölzl 001; Arno Pauly (Computability and Complexity, 2017)

Admissibility in Games with Imperfect Information (Invited Talk). - Romain Brenguier; Arno Pauly; Jean-François Raskin; Ocan Sankur (CONCUR, 2017)

Noetherian Quasi-Polish spaces. - Matthew de Brecht; Arno Pauly (CSL, 2017)

Weihrauch Complexity in Computable Analysis. - Vasco Brattka; Guido Gherardi; Arno Pauly (CoRR, 2017)

How constructive is constructing measures? - Arno Pauly; Willem L. Fouché (J. Log. Anal., 2017)

A comparison of concepts from computable analysis and effective descriptive set theory. - Vassilios Gregoriades; Tamás Kispéter; Arno Pauly (Math. Struct. Comput. Sci., 2017)

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013. - Hajime Ishihara; Margarita V. Korovina; Arno Pauly; Monika Seisenberger; Dieter Spreen (Math. Struct. Comput. Sci., 2017)

Many-one reductions and the category of multivalued functions. - Arno Pauly (Math. Struct. Comput. Sci., 2017)

Enumeration Degrees and Topology. - Arno Pauly (CiE, 2018)

Beyond Admissibility: Dominance Between Chains of Strategies. - Nicolas Basset; Ismaël Jecker; Arno Pauly; Jean-François Raskin; Marie van den Bogaard (CSL, 2018)

Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. - Stéphane Le Roux 001; Arno Pauly; Mickael Randour (FSTTCS, 2018)

Parameterized Games and Parameterized Automata. - Arno Pauly (GandALF, 2018)

Searching for an analogue of ATR in the Weihrauch lattice. - Takayuki Kihara; Alberto Marcone; Arno Pauly (CoRR, 2018)

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). - Vasco Brattka; Damir D. Dzhafarov; Alberto Marcone; Arno Pauly (Dagstuhl Reports, 2018)

Extending finite-memory determinacy to multi-player games. - Stéphane Le Roux 001; Arno Pauly (Inf. Comput., 2018)

A topological view on algebraic computation models. - Eike Neumann; Arno Pauly (J. Complex., 2018)

On the algebraic structure of Weihrauch degrees. - Vasco Brattka; Arno Pauly (Log. Methods Comput. Sci., 2018)

Weihrauch-completeness for layerwise computability. - Arno Pauly; Willem L. Fouché; George Davie (Log. Methods Comput. Sci., 2018)

Comparing Representations for Function Spaces in Computable Analysis. - Arno Pauly; Florian Steinberg 001 (Theory Comput. Syst., 2018)

Mean-payoff games with partial observation. - Paul Hunter 001; Arno Pauly; Guillermo A. Pérez 001; Jean-François Raskin (Theor. Comput. Sci., 2018)

Minkowski Games. - Stéphane Le Roux 001; Arno Pauly; Jean-François Raskin (ACM Trans. Comput. Log., 2018)

Continuous Team Semantics. - Åsa Hirvonen; Juha Kontinen; Arno Pauly (TAMC, 2019)

Finite Choice, Convex Choice and Sorting. - Takayuki Kihara; Arno Pauly (TAMC, 2019)

Projection operators in the Weihrauch lattice. - Guido Gherardi; Alberto Marcone; Arno Pauly (Comput., 2019)

Computability Aspects of Differential Games in Euclidian Spaces. - Gafurjan I. Ibragimov; Bakh Khoussainov; Arno Pauly (CoRR, 2019)

Effective local compactness and the hyperspace of located sets. - Arno Pauly (CoRR, 2019)

Enumeration degrees and non-metrizable topology. - Takayuki Kihara; Keng Meng Ng; Arno Pauly (CoRR, 2019)

Convex choice, finite choice and sorting. - Takayuki Kihara; Arno Pauly (CoRR, 2019)

Connected choice and the Brouwer fixed point theorem. - Vasco Brattka; Stéphane Le Roux 001; Joseph S. Miller; Arno Pauly (J. Math. Log., 2019)

Game characterizations and lower cones in the Weihrauch degrees. - Hugo Nobrega; Arno Pauly (Log. Methods Comput. Sci., 2019)

Computing Haar Measures. - Arno Pauly; Dongseong Seon; Martin Ziegler 001 (CSL, 2020)

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. - Vasco Brattka; Damir D. Dzhafarov; Alberto Marcone; Arno Pauly (Comput., 2020)

Overt choice. - Matthew de Brecht; Arno Pauly; Matthias Schröder 001 (Comput., 2020)

Combinatorial principles equivalent to weak induction. - Caleb Davis; Denis R. Hirschfeldt; Jeffry L. Hirst; Jake Pardo; Arno Pauly; Keita Yokoyama (Comput., 2020)

Ramsey's theorem and products in the Weihrauch degrees. - Damir D. Dzhafarov; Jun Le Goh; Denis R. Hirschfeldt; Ludovic Patey; Arno Pauly (Comput., 2020)

An update on Weihrauch complexity, and some open questions. - Arno Pauly (CoRR, 2020)

A Semi-Potential for Finite and Infinite Games in Extensive Form. - Stéphane Le Roux 001; Arno Pauly (Dyn. Games Appl., 2020)

Searching for an analogue of Atr0 in the Weihrauch Lattice. - Takayuki Kihara; Alberto Marcone; Arno Pauly (J. Symb. Log., 2020)

Computing Measure as a Primitive Operation in Real Number Computation. - Christine Gaßner; Arno Pauly; Florian Steinberg 001 (CSL, 2021)

Adaptive Neighbourhoods for the Discovery of Adversarial Examples. - Jay Paul Morgan; Adeline Paiement; Arno Pauly; Monika Seisenberger (CoRR, 2021)

The Weihrauch degree of finding Nash equilibria in multiplayer games. - Tonicha Crook; Arno Pauly (CoRR, 2021)

Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461). - Mathieu Hoyrup; Arno Pauly; Victor L. Selivanov; Mariya Ivanova Soskova (Dagstuhl Reports, 2021)

On the existence of weak subgame perfect equilibria. - Véronique Bruyère; Stéphane Le Roux 001; Arno Pauly; Jean-François Raskin (Inf. Comput., 2021)

Equilibria in multi-player multi-outcome infinite sequential games. - Stéphane Le Roux 001; Arno Pauly (Inf. Comput., 2021)

Finding descending sequences through ill-Founded linear Orders. - Jun Le Goh; Arno Pauly; Manlio Valenti (J. Symb. Log., 2021)

A Computability Perspective on (Verified) Machine Learning. - Tonicha Crook; Jay Paul Morgan; Arno Pauly; Markus Roggenbach (WADT, 2022)

Luzin's (n) and Randomness Reflection. - Arno Pauly; Linda Westrick; Liang Yu 004 (J. Symb. Log., 2022)

The Complexity of Finding Supergraphs. - Vittorio Cipriani; Arno Pauly (CiE, 2023)

De Groot Duality for Represented Spaces. - Takayuki Kihara; Arno Pauly (CiE, 2023)

Embeddability of graphs and Weihrauch degrees. - Vittorio Cipriani; Arno Pauly (CoRR, 2023)

Minimal covers in the Weihrauch degrees. - Steffen Lempp; Joseph S. Miller; Arno Pauly; Mariya Ivanova Soskova; Manlio Valenti (CoRR, 2023)

The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. - Jun Le Goh; Arno Pauly; Manlio Valenti (CiE, 2024)

Sequential Discontinuity and First-Order Problems. - Arno Pauly; Giovanni Soldà (CiE, 2024)

On the Weihrauch degree of the additive Ramsey theorem. - Arno Pauly; Cécilia Pradic; Giovanni Soldà (Comput., 2024)

The equational theory of the Weihrauch lattice with multiplication. - Eike Neumann; Arno Pauly; Cécilia Pradic (CoRR, 2024)

More on the indivisibility of Q. - Arno Pauly (CoRR, 2024)

Represented Spaces of Represented Spaces. - Johanna Franklin; Eike Neumann; Arno Pauly; Cécilia Pradic; Manlio Valenti (CiE, 2025)

Computably Discrete Represented Spaces. - Eike Neumann; Arno Pauly; Cécilia Pradic; Manlio Valenti (CiE, 2025)