656 search results - page 28 / 132 » Complexity of finite-horizon Markov decision process problem... |
112
Voted
AIPS
2008
15 years 4 months ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
136
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
132
Voted
IJCAI
2007
15 years 3 months ago
2007
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
97
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
120
Voted
AMAI
2006
Springer
15 years 1 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...