371 search results - page 3 / 75 » The Complexity of Decentralized Control of Markov Decision P... |
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Decentralized reinforcement learning (DRL) has been applied to a number of distributed applications. However, one of the main challenges faced by DRL is its convergence. Previous ...
AAAI
1997
13 years 6 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
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...