101 citations · 491 across the 53 of their papers we have counts for
6 papers · 2 filters
How constructive is constructing measures?
Arno Pauly, Willem L. Fouché
Given some set, how hard is it to construct a measure supported by it? We classify some variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman m…
The descriptive theory of represented spaces
Arno Pauly
This is a survey on the ongoing development of a descriptive theory of represented spaces, which is intended as an extension of both classical and effective descriptive set theory…
Weihrauch degrees of finding equilibria in sequential games
Stephane Le Roux, Arno Pauly
We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winnin…
Non-deterministic computation and the Jayne-Rogers Theorem
Arno Pauly, Matthew de Brecht
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaini…
A comparison of concepts from computable analysis and effective descriptive set theory
Vassilios Gregoriades, Tamás Kispéter, Arno Pauly
Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The pre…
Equilibria in multi-player multi-outcome infinite sequential games
Stéphane Le Roux, Arno Pauly
We investigate the existence of certain types of equilibria (Nash, -Nash, subgame perfect, -subgame perfect, Pareto-optimal) in multi-player multi-outcome…