101 citations · 491 across the 53 of their papers we have counts for
7 papers · 1 filter
Combinatorial principles equivalent to weak induction
Caleb Davis, Denis R. Hirschfeldt, Jeffry L. Hirst +3
We consider two combinatorial principles, and . Both are easily proved in plus induction. We give two proofs of in ${…
Searching for an analogue of ATR in the Weihrauch lattice
Takayuki Kihara, Alberto Marcone, Arno Pauly
There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to transl…
Parameterized Games and Parameterized Automata
Arno Pauly
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter va…
Extending finite-memory determinacy by Boolean combination of winning conditions
Stéphane Le Roux, Arno Pauly, Mickael Randour
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable control…
Beyond admissibility: Dominance between chains of strategies
Nicolas Basset, Ismaël Jecker, Arno Pauly +2
Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by resul…
Projection operators in the Weihrauch lattice
Guido Gherardi, Alberto Marcone, Arno Pauly
In this paper we study the Weihrauch complexity of projection operators onto closed subsets of the Euclidean space. We show that some fundamental degrees of the Weihrauch lattice c…