The Complexity of Decentralized Control of Markov Decision Processes

The Complexity of Decentralized Control of Markov Decision Processes (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Daniel S. Bernstein , Robert Givan , Neil Immerman , Shlomo Zilberstein

Venue:	Mathematics of Operations Research
Citations:	198 - 37 self

BibTeX

@INPROCEEDINGS{Bernstein00thecomplexity,
    author = {Daniel S. Bernstein and Robert Givan and Neil Immerman and Shlomo Zilberstein},
    title = {The Complexity of Decentralized Control of Markov Decision Processes},
    booktitle = {Mathematics of Operations Research},
    year = {2000},
    pages = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalizations of both the fullyobservable case and the partially-observable case that allow for decentralized control are described. For even two agents, the finite-horizon problems corresponding to both of these models are hard for nondeterministic exponential time. These complexity results illustrate a fundamental difference between centralized and decentralized control of Markov decision processes. In contrast to the problems involving centralized control, the problems we consider provably do not admit polynomial-time algorithms. Furthermore, assuming EXP NEXP, the problems require super-exponential time to solve in the worst case.

Citations

1950	Computational Complexity - Papadimitriou - 1995
629	Planning and acting in partially observable stochastic domains - Kaelbling, Littman, et al. - 1998
498	Markov Decision Processes - Puterman - 1994
356	Nondeterministic exponential time has two-prover interactive protocols - Babai, Fortnow, et al. - 1990
253	The complexity of Markov decision processes - Papadimitriou, Tsisiklis - 1987
144	Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes - Cassandra, Littman, et al. - 1997
137	Reinforcement learning algorithm for partially observable Markov decision problems - Jaakkola, Singh, et al. - 1994
114	Learning to cooperate via policy search - Peshkin, Kim, et al. - 2000
87	Solving POMDPs by search in policy space - Hansen - 1998
82	A survey of computational complexity results in systems and control - Blondel, Tsitsiklis
70	On the undecidability of probabilistic planning and infinite-horizon partially observable markov decision problems - Madani, Hanks, et al. - 1999
49	Solving POMDPs by searching the space of finite policies - Meuleau, Kim, et al. - 1999
40	Distributed value functions - Schneider, Wong, et al. - 1999
33	Multiple-person alternation - Reif - 1979
32	Complexity of finite-horizon Markov decision process problems - Mundhenk, Goldsmith, et al.
31	Intractable problems in control theory - Papadimitriou, Tsitsiklis - 1986
22	Complexity of solvable cases of the decision problem for predicate calculus - Lewis - 1978
19	Decentralized control of finite state Markov processes - Hsu, Marcus - 1982
16	Wornell, “Decentralized control of a multiple access broadcast channel: Performance bounds - Ooi, W - 1996
16	On the complexity of designing distributed protocols - Papadimitriou, Tsitsiklis - 1982
8	My brain is full: When more memory helps - Lusena, Li, et al. - 1999
6	Applications of Markov Decision Processes in Telecommunications: A Survey - Altman - 2001