The following pages link to Arno Pauly (Q315526):
Displayed 50 items.
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- Surfaces consisting of umbilic points (Q942854) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- Extending finite-memory determinacy to multi-player games (Q1641036) (← links)
- Enumeration degrees and topology (Q1670759) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q2011671) (← links)
- A semi-potential for finite and infinite games in extensive form (Q2175356) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- Equilibria in multi-player multi-outcome infinite sequential games (Q2225601) (← links)
- Continuous team semantics (Q2327476) (← links)
- Finite choice, convex choice and sorting (Q2327489) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- On the Computational Content of the Brouwer Fixed Point Theorem (Q2904393) (← links)
- Multi-valued Functions in Computability Theory (Q2904453) (← links)
- (Q2917346) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) (Q2946357) (← links)
- The Vitali Covering Theorem in the Weihrauch Lattice (Q2970958) (← links)
- Many-one reductions and the category of multivalued functions (Q2973252) (← links)
- How constructive is constructing measures? (Q2987777) (← links)
- On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
- On the (semi)lattices induced by continuous reducibilities (Q3053230) (← links)
- (Q3075220) (← links)
- The Brouwer Fixed Point Theorem Revisited (Q3188240) (← links)
- Weihrauch Degrees of Finding Equilibria in Sequential Games (Q3195703) (← links)
- (Q3384876) (← links)
- Finite choice, convex choice and finding roots (Q3460409) (← links)
- (Q3575368) (← links)
- (Q3639065) (← links)
- On the algebraic structure of Weihrauch degrees (Q4553287) (← links)
- A comparison of concepts from computable analysis and effective descriptive set theory (Q4593238) (← links)
- (Q4608621) (← links)
- Infinite sequential games with real-valued payoffs (Q4635647) (← links)
- Descriptive Set Theory in the Category of Represented Spaces (Q4635825) (← links)
- (Q4636651) (← links)
- (Q4643953) (← links)
- Minkowski Games (Q4691739) (← links)
- The degree structure of Weihrauch-reducibility (Q4927424) (← links)
- Non-deterministic computation and the Jayne-Rogers Theorem (Q4994845) (← links)
- (Q4994893) (← links)
- (Q5015282) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- (Q5079732) (← links)
- LUZIN’S (N) AND RANDOMNESS REFLECTION (Q5082065) (← links)
- (Q5090979) (← links)
- Noetherian Quasi-Polish Spaces (Q5111183) (← links)
- Ramsey’s theorem and products in the Weihrauch degrees (Q5131643) (← links)
- Overt choice (Q5131649) (← links)