Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...