The complexity of multiagent systems: the price of silence

Authors:
Zinovi Rabinovich;Claudia V. Goldman;Jeffrey S. Rosenschein
Affiliations:
Hebrew University of Jerusalem, Jerusalem, Israel;University of Massachusetts, Amherst, MA;Hebrew University of Jerusalem, Jerusalem, Israel
Venue:
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Year:
2003

Citing 3
Cited 18

Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The Complexity of Decentralized Control of Markov Decision Processes

Mathematics of Operations Research
The communicative multiagent team decision problem: analyzing teamwork theories and models

Journal of Artificial Intelligence Research

Exploiting locality of interaction in factored Dec-POMDPs

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Solving Large-Scale and Sparse-Reward DEC-POMDPs with Correlation-MDPs

RoboCup 2007: Robot Soccer World Cup XI
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Agent influence as a predictor of difficulty for decentralized problem-solving

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Interaction structure and dimensionality reduction in decentralized MDPs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Decentralized control of cooperative systems: categorization and complexity analysis

Journal of Artificial Intelligence Research
Memory-bounded dynamic programming for DEC-POMDPs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Agent Influence and Intelligent Approximation in Multiagent Problems

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Quasi deterministic POMDPs and DecPOMDPs

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Toward error-bounded algorithms for infinite-horizon DEC-POMDPs

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Q-Tree: automatic construction of hierarchical state representation for reinforcement learning

ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part III
Modeling information exchange opportunities for effective human-computer teamwork

Artificial Intelligence
Solving decentralized POMDP problems using genetic algorithms

Autonomous Agents and Multi-Agent Systems
Approximate solutions for factored Dec-POMDPs with many agents

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Decentralized multi-robot cooperation with auctioned POMDPs

International Journal of Robotics Research
Incremental clustering and expansion for faster optimal planning in decentralized POMDPs

Journal of Artificial Intelligence Research
Automated generation of interaction graphs for value-factored dec-POMDPs

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we suggest representing multiagent systems using computational models, choosing, specifically, Multi-Prover Interactive Protocols to represent agent systems and the interactions occurring within them. This approach enables us to analyze complexity issues related to multiagent systems. We focus here on the complexity of coordination and study the possible sources of this complexity. We show that there are complexity bounds that cannot be lowered even when approximation techniques are applied.