Efficient Decomposition of Bimatrix Games (Extended Abstract)
Computer Science and Game Theory
2014-04-04 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.1404.0842,
title = {Efficient Decomposition of Bimatrix Games (Extended Abstract)},
author = {Xiang Jiang and Arno Pauly},
journal= {arXiv preprint arXiv:1404.0842},
year = {2014}
}
Comments
In Proceedings SR 2014, arXiv:1404.0414