Encodings of non-binary constraint satisfaction problems
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Distributed Sensor Networks: A Multiagent Perspective
Distributed Sensor Networks: A Multiagent Perspective
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
Distributed Constraint Satisfaction and Optimization with Privacy Enforcement
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Assigning Tasks in a 24-Hour Software Development Model
APSEC '04 Proceedings of the 11th Asia-Pacific Software Engineering Conference
A distributed framework for solving the Multiagent Plan Coordination Problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Impact of problem centralization in distributed constraint optimization algorithms
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Solution sets for DCOPs and graphical games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Nogood based asynchronous distributed optimization (ADOPT ng)
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Multiply-constrained distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Experimental analysis of privacy loss in DCOP algorithms
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
No-commitment branch and bound search for distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Hierarchical variable ordering for distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Improving privacy in distributed constraint optimization
Improving privacy in distributed constraint optimization
CompAPO: A Complete Version of the APO Algorithm
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Resource constrained distributed constraint optimization using resource constraint free pseudo-tree
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Caching schemes for DCOP search algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Quality guarantees on k-optimal solutions for distributed constraint optimization problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
MB-DPOP: a new memory-bounded algorithm for distributed optimization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Hi-index | 0.00 |
Distributed constraint optimization (DCOP) is a useful framework for cooperative multiagent coordination. DCOP focuses on optimizing a single team objective. However, in many domains, agents must satisfy constraints on resources consumed locally while optimizing the team goal. Yet, these resource constraints may need to be kept private. Designing DCOP algorithms for these domains requires managing complex trade-offs in completeness, scalability, privacy and efficiency. This article defines the multiply-constrained DCOP (MC-DCOP) framework and provides complete (globally optimal) and incomplete (locally optimal) algorithms for solving MC-DCOP problems. Complete algorithms find the best allocation of scarce resources while optimizing the team objective, while incomplete algorithms are more scalable. The algorithms use four main techniques: (i) transforming constraints to maintain privacy; (ii) dynamically setting upper bounds on resource consumption; (iii) identifying the extent to which the local graph structure allows agents to compute exact bounds; and (iv) using a virtual assignment to flag problems rendered unsatisfiable by resource constraints. Proofs of correctness are presented for all algorithms. Experimental results illustrate the strengths and weaknesses of both the complete and incomplete algorithms.