204 search results - page 7 / 41 » Stochastic Games |
FSTTCS
2010
Springer
13 years 8 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
AAAI
2004
14 years 7 days ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
SIAMCO
2010
13 years 5 months ago
2010
Abstract. This paper studies a class of non-Markovian and nonhomogeneous stochastic processes on a finite state space. Relying on a recent paper by Bena
SODA
2004
ACM
14 years 6 days ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...