63 search results - page 10 / 13 » The computational complexity of nash equilibria in concisely... |
AAAI
2006
13 years 10 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
SIGECOM
2006
ACM
14 years 2 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...
ECAI
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...