Sciweavers

Share
CDC
2010
IEEE

A dynamic programming algorithm for decentralized Markov decision processes with a broadcast structure

8 years 3 months ago
A dynamic programming algorithm for decentralized Markov decision processes with a broadcast structure
We give an optimal dynamic programming algorithm to solve a class of finite-horizon decentralized Markov decision processes (MDPs). We consider problems with a broadcast information structure that consists of a central node that only has access to its own state but can affect several outer nodes, while each outer node has access to both its own state and the central node's state, but cannot affect the other nodes. The solution to this problem involves a dynamic program similar to that of a centralized partially-observed Markov decision process.
Jeff Wu, Sanjay Lall
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2010
Where CDC
Authors Jeff Wu, Sanjay Lall
Comments (0)
books