The Complexity of Multiagent Systems: The Price of Silence

Proceedings of the International Conference on Autonomous Agents

Volumn 2, Issue , 2003, Pages 1102-1103

  Rabinovich, Zinovi ^a   Goldman, Claudia V ^b   Rosenschein, Jeffrey S ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Computational complexity and agent systems; Markov Decision Processes

Indexed keywords

AGENT SYSTEMS; MARKOV DECISION PROCESSES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECENTRALIZED CONTROL; DECISION MAKING; INTERACTIVE COMPUTER SYSTEMS; MARKOV PROCESSES; THEOREM PROVING;

MULTI AGENT SYSTEMS;

EID: 1142292487     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity. 1(1):3-40, 1991.
2. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of STOC-88, pages 113-131, 1988.
3. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov Decision Processes. Mathematics of Operations Research, 27(4):819-840, 2002.
4. U. Feige. Alternative models for zero knowledge interactive proofs. PhD thesis, The Weizmann Institute of Sience, Rehovot, Israel, 1990.
5. D. V. Pynadath and M. Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. JAIR, 16:389-423, 2002.
6. Z. Rabinovich, C. V. Goldman, and J. S. Rosenschein. Non-approximability of decentralized control. Technical Report 2002-29, Leibniz Center for Computer Science, Hebrew University, Jerusalem, 2002.
7. A. Shamir. IP=PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Sciences, pages 11-15, 1990.