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.
| Original language | English |
|---|---|
| Pages | 1102-1103 |
| Number of pages | 2 |
| State | Published - 2003 |
| Event | Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 - Melbourne, Vic., Australia Duration: 14 Jul 2003 → 18 Jul 2003 |
Conference
| Conference | Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 |
|---|---|
| Country/Territory | Australia |
| City | Melbourne, Vic. |
| Period | 14/07/03 → 18/07/03 |
Keywords
- Computational complexity and agent systems
- Markov Decision Processes