1503 search results - page 111 / 301 » Generalized Parity Games |
190
click to vote
NETGAMES
2006
ACM
16 years 7 days ago
2006
ACM
While psychologists analyze network game-playing behavior in terms of players’ social interaction and experience, understanding user behavior is equally important to network res...
223
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
195
click to vote
ATAL
2010
Springer
15 years 7 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...
160
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...
132
Voted
WINE
2009
Springer
16 years 26 days ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...