16 search results - page 2 / 4 » On the Complexity of Succinct Zero-Sum Games |
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
AI
2006
Springer
13 years 5 months ago
2006
Springer
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...