11 citations · 16 across the 3 of their papers we have counts for
3 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.LO2009★ 11 cited
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…
cs.GT2009★ 4 cited
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…