Sciweavers

90 search results - page 1 / 18
» On the hardness of finding symmetries in Markov decision pro...
Sort
View
53
Voted
ICML
2008
IEEE
15 years 10 months ago
On the hardness of finding symmetries in Markov decision processes
Shravan Matthur Narayanamurthy, Balaraman Ravindra...
ICML
2001
IEEE
15 years 10 months ago
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning
This paper examines the notion of symmetry in Markov decision processes (MDPs). We define symmetry for an MDP and show how it can be exploited for more effective learning in singl...
Martin Zinkevich, Tucker R. Balch
95
Voted
UAI
2000
14 years 11 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
AAAI
2006
14 years 11 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
75
Voted
ECAI
2010
Springer
14 years 10 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng