Non-approximability of Centralized Control
作者： Jeffrey S. Rosenschein , Zinovi Rabinovich , Claudia V. Goldman
DOI:
关键词:
摘要:
参考文章(16)
Michael L. Littman, Markov games as a framework for multi-agent reinforcement learning Machine Learning Proceedings 1994. pp. 157- 163 ,(1994) , 10.1016/B978-1-55860-335-6.50027-1
Anne Condon, Omid Madani, Steve Hanks, On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems national conference on artificial intelligence. pp. 541- 548 ,(1999)
J. Goldsmith, M. Mundhenk, Complexity issues in Markov decision processes conference on computational complexity. pp. 272- 280 ,(1998) , 10.1109/CCC.1998.694621
Michael L. Littman, Value-function reinforcement learning in Markov games Cognitive Systems Research. ,vol. 2, pp. 55- 66 ,(2001) , 10.1016/S1389-0417(01)00015-8
Lance Fortnow, John Rompel, Michael Sipser, On the power of multi-prover interactive protocols Theoretical Computer Science. ,vol. 134, pp. 545- 557 ,(1994) , 10.1016/0304-3975(94)90251-8
Ronald A. Howard, Dynamic Programming and Markov Processes ,(1960)
Christos H. Papadimitriou, John N. Tsitsiklis, The Complexity of Markov Decision Processes Mathematics of Operations Research. ,vol. 12, pp. 441- 450 ,(1987) , 10.1287/MOOR.12.3.441
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Widgerson, Multi-prover interactive proofs: how to remove intractability assumptions symposium on the theory of computing. pp. 113- 131 ,(1988) , 10.1145/62212.62223
Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan, Algebraic methods for interactive proof systems Journal of the ACM. ,vol. 39, pp. 859- 868 ,(1992) , 10.1145/146585.146605
Vincent D. Blondel, John N. Tsitsiklis, Survey A survey of computational complexity results in systems and control Automatica. ,vol. 36, pp. 1249- 1274 ,(2000) , 10.1016/S0005-1098(00)00050-9