350 search results - page 3 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
AAAI
2012
11 years 8 months ago
2012
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
IJCAI
2001
13 years 7 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
LICS
2009
IEEE
14 years 13 days ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...