350 search results - page 18 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg a...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
AAAI
1996
14 years 10 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
ECCC
2006
14 years 9 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
101
click to vote
SAT
2010
Springer
14 years 7 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...