An Efficient Exact Algorithm for Singly Connected Graphical Games
We describe a new algorithm for computing a Nash equilibrium in graphical games , a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the rst to compute equilibria both eÆciently and exactly for a non-trivial class of graphical games.