1599 search results - page 27 / 320 » Algorithms for Parity Games |
AIM
2005
14 years 9 months ago
2005
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
IJCAI
2003
14 years 11 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...
WCE
2007
14 years 10 months ago
2007
—In this paper we used genetic algorithms to1 find the solution of game theory. We proposed new method foe solving game theory and find the optimal strategy for player A or playe...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...