1698 search results - page 50 / 340 » Growing Complex Games |
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
103
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...