27 citations · 28 across the 2 of their papers we have counts for
2 papers
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…
cs.LO2010★ 27 cited
Computation with Advice
Vasco Brattka, Arno Pauly
Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed,…