Sciweavers

1283 search results - page 104 / 257
» Science: the rules of the game
Sort
View
LICS
2007
IEEE
15 years 4 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
NETGAMES
2006
ACM
15 years 3 months ago
Network game design: hints and implications of player interaction
While psychologists analyze network game-playing behavior in terms of players’ social interaction and experience, understanding user behavior is equally important to network res...
Kuan-Ta Chen, Chin-Laung Lei
AAAI
2008
15 years 7 days ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
ATAL
2010
Springer
14 years 11 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
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...
Albert Xin Jiang, MohammadAli Safari
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 10 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...