1 citations · 2 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2014★ 1 cited
Efficient Decomposition of Bimatrix Games (Extended Abstract)
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.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…