Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Impact of problem centralization in distributed constraint optimization algorithms
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Solution sets for DCOPs and graphical games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Predictability & criticality metrics for coordination in complex environments
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Group planning with time constraints
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
In multi-agent systems, agents need to share information in order to make good decisions. Who does what in order to achieve this matters a lot. The assignment of responsibility influences delay and consequently affects agents' abilities to make timely decisions. It is often unclear which approaches are best. We develop a model where one can easily test the impact of different assignments and information sharing protocols by focusing only on the delays caused by computation and communication. Using the model, we obtain interesting results that provide insight about the types of assignments that perform well in various domains and how slight variations in protocols can make great differences in feasibility.