101 citations · 491 across the 53 of their papers we have counts for
4 papers · 1 filter
The Complexity of Iterated Strategy Elimination
Arno Pauly
We consider the computational complexity of the question whether a certain strategy can be removed from a game by means of iterated elimination of dominated strategies. In particul…
Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
Arno Pauly
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the dis…
How discontinuous is Computing Nash Equilibria?
Arno Pauly
We investigate the degree of discontinuity of several solution concepts from non-cooperative game theory. While the consideration of Nash equilibria forms the core of our work, als…
On the (semi)lattices induced by continuous reducibilities
Arno Pauly
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the orde…