2014/04/03 by Xiang Jiang, Arno Pauly
Computer Science · #cs.GT #cs.CC
paper · pdf · doi:10.4204/eptcs.146.10
published as EPTCS 146, 2014, pp. 75-81 · In Proceedings SR 2014, arXiv:1404.0414
arxiv created 2014/04/03 · arxiv updated 2014/04/04
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 with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters.