Sciweavers

268 search results - page 12 / 54
» Solving multiagent assignment Markov decision processes
Sort
View
ICTAI
2000
IEEE
14 years 1 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
ICML
1994
IEEE
14 years 1 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
CDC
2009
IEEE
169views Control Systems» more  CDC 2009»
14 years 2 months ago
Parametric regret in uncertain Markov decision processes
— We consider decision making in a Markovian setup where the reward parameters are not known in advance. Our performance criterion is the gap between the performance of the best ...
Huan Xu, Shie Mannor
JAIR
2006
122views more  JAIR 2006»
13 years 9 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
AAAI
2008
13 years 12 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein