Sciweavers

371 search results - page 2 / 75
» The Complexity of Decentralized Control of Markov Decision P...
Sort
View
ATAL
2004
Springer
13 years 10 months ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
AAAI
2006
13 years 6 months ago
An Iterative Algorithm for Solving Constrained Decentralized Markov Decision Processes
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
Aurélie Beynier, Abdel-Illah Mouaddib
JAIR
2008
145views more  JAIR 2008»
13 years 5 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
ICC
2007
IEEE
137views Communications» more  ICC 2007»
13 years 11 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
IJCAI
2007
13 years 6 months ago
Average-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. Wh...
Marek Petrik, Shlomo Zilberstein