@inproceedings{983a05b13d384aa185503f769ab2e555,
title = "Approximating nash equilibria in tree polymatrix games",
abstract = "We develop a quasi-polynomial time Las Vegas algorithm for approximating Nash equilibria in polymatrix games over trees, under a mild renormalizing assumption. Our result, in particular, leads to an expected polynomial-time algorithm for computing approximate Nash equilibria of tree polymatrix games in which the number of actions per player is a fixed constant. Further, for trees with constant degree, the running time of the algorithm matches the best known upper bound for approximating Nash equilibria in bimatrix games (Lipton, Markakis, and Mehta 2003). Notably, this work closely complements the hardness result of Rubinstein (2015), which establishes the inapproximability of Nash equilibria in polymatrix games over constant-degree bipartite graphs with two actions per player.",
author = "Siddharth Barman and Katrina Ligett and Georgios Piliouras",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 8th International Symposium on Algorithmic Game Theory, SAGT 2015 ; Conference date: 28-09-2015 Through 30-09-2015",
year = "2015",
doi = "https://doi.org/10.1007/978-3-662-48433-3_22",
language = "الإنجليزيّة",
isbn = "9783662484326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "285--296",
editor = "Martin Hoefer",
booktitle = "Algorithmic Game Theory - 8th International Symposium, SAGT 2015",
address = "ألمانيا",
}