268 search results - page 8 / 54 » Solving multiagent assignment Markov decision processes |
118
Voted
NIPS
2003
15 years 4 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
118
Voted
MOR
2007
15 years 2 months ago
2007
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
128
Voted
AAAI
1997
15 years 4 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
142
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast informati...
167
Voted
AIPS
2011
14 years 6 months ago
2011
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...