1698 search results - page 13 / 340 » Growing Complex Games |
MST
2011
13 years 2 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
FPLAY
2008
13 years 8 months ago
2008
Tabletop games provide an intimate gaming experience where groups of friends can interact in a shared space using shared physical props. Digital tabletop games show great promise ...
LAMAS
2005
Springer
14 years 18 days ago
2005
Springer
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
JACM
2007
13 years 7 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...