Sciweavers

1653 search results - page 57 / 331
» Computer science and game theory
Sort
View
ICALP
2005
Springer
14 years 2 months ago
The Complexity of Stochastic Rabin and Streett Games'
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
DIGRA
2005
Springer
14 years 2 months ago
Growing Complex Games
Do computer simulation games display emergent behavior? Are they models of complex systems or ‘life’ systems? This paper aims to explore and investigate how games studies can ...
Nicholas Glean
ATAL
2009
Springer
14 years 3 months ago
Multiagent learning in large anonymous games
In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to ï...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
DIMACS
1996
13 years 10 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin