102 search results - page 8 / 21 » MDPs with Non-Deterministic Policies |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
AIPS
2009
13 years 8 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we address the reliability of policies derived by Reinforcement Learning on a limited amount of observations. This can be done in a principled manner by taking in...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
RAS
2010
13 years 5 months ago
2010
Policy Reuse is a reinforcement learning technique that efficiently learns a new policy by using past similar learned policies. The Policy Reuse learner improves its exploration b...