75 search results - page 5 / 15 » Reinforcement Learning for MDPs with Constraints |
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...
138
Voted
PRICAI
2000
Springer
15 years 5 months ago
2000
Springer
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
128
Voted
ICANN
2001
Springer
15 years 6 months ago
2001
Springer
Unlike traditional reinforcement learning (RL), market-based RL is in principle applicable to worlds described by partially observable Markov Decision Processes (POMDPs), where an ...
107
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
104
Voted
AAMAS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...