20 search results - page 3 / 4 » Strategy Iteration using Non-Deterministic Strategies for So... |
COGSCI
2004
13 years 5 months ago
2004
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
AAAI
2004
13 years 7 months 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...
ICALP
2007
Springer
13 years 12 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...
IPCO
2010
13 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...