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
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
Agent-Based Approach to Dynamic Meeting Scheduling Problems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Bumping strategies for the multiagent agreement problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
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
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Autonomous Agents and Multi-Agent Systems
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SSDPOP: improving the privacy of DCOP with secret sharing
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Adaptive price update in distributed Lagrangian relaxation protocol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
An overview of privacy improvements to k-optimal DCOP algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Finding Nash bargaining solutions for multi-issue negotiations: a preliminary result
HuCom '08 Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
Local search for distributed asymmetric optimization
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Collaborative Planning with Confidentiality
Journal of Automated Reasoning
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multi agent coordination. However, despite agent privacy being a key motivation for applying DCOPs in many applications, rigorous quantitative evaluations of privacy loss in DCOP algorithms have been lacking. Recently, [Maheswaran et al. 2005] introduced a framework for quantitative evaluations of privacy in DCOP algorithms, showing that some DCOP algorithms lose more privacy than purely centralized approaches and questioning the motivation for applying DCOPs. This paper addresses the question of whether state-of-the art DCOP algorithms suffer from a similar shortcoming by investigating several of the most efficient DCOP algorithms, including both DPOP and ADOPT. Furthermore, while previous work investigated the impact on efficiency of distributed contraint reasoning design decisions (e.g. constraint-graph topology, asynchrony, message-contents), this paper examines the privacy aspect of such decisions, providing an improved understanding of privacy-efficiency tradeoffs.