350 search results - page 2 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
CSL
2003
Springer
15 years 2 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
AIIDE
2008
14 years 11 months ago
2008
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
IPCO
2010
14 years 11 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...
89
Voted
CAV
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consi...