178 search results - page 1 / 36 » Efficient Approximation of Optimal Control for Markov Games |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
SIAMCO
2002
13 years 4 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-...
AAAI
2008
13 years 7 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
MIA
2010
12 years 11 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...