101 citations · 491 across the 53 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.GT2012★ 1 cited
Efficient Decomposition of Bimatrix Games
Xiang Jiang, Arno Pauly
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable…
math.LO2012★ 21 cited
Connected Choice and the Brouwer Fixed Point Theorem
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller +1
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed…
math.LO2012★ 8 cited
On the topological aspects of the theory of represented spaces
Arno Pauly
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analy…