37 search results - page 2 / 8 » Optimal Stopping Games for Markov Processes |
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
ICML
1994
IEEE
13 years 9 months ago
1994
IEEE
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
PAMI
2007
13 years 5 months ago
2007
—This paper presents a method for learning decision theoretic models of human behaviors from video data. Our system learns relationships between the movements of a person, the co...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...