1503 search results - page 73 / 301 » Generalized Parity Games |
SIGECOM
2010
ACM
14 years 2 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
CHI
2004
ACM
14 years 9 months ago
2004
ACM
The term immersion is widely used to describe games but it is not clear what immersion is or indeed if people are using the same word consistently. This paper describes work done ...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
CIG
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— Many games require opponent modelling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to d...
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...