2 search results - page 1 / 1 » Robust Policy Computation in Reward-Uncertain MDPs Using Non... |
AAAI
2010
13 years 6 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...