Abstract

We treat PNE-GG, the problem of deciding the existence of a Pure Nash Equilibrium in a graphical game, and the role of treewidth in this problem. PNE-GG is known to be (Formula presented.)-complete in general, but polynomially solvable for graphical games of bounded treewidth. We prove that PNE-GG is (Formula
... read more