Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Yet another distributed depth-first-search algorithm
Information Processing Letters
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Self-stabilizing depth-first search
Information Processing Letters
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Designing conventions for automated negotiation
AI Magazine
Market-oriented programming: some early lessons
Market-based control
An introduction to distributed algorithms
An introduction to distributed algorithms
Distributed games: from mechanisms to protocols
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
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Distributed breakout algorithm for distributed constraint optimization problems -- DBArelax
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Constraint Processing
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
On decentralized incentive compatible mechanisms
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
The complexity of contract negotiation
Artificial Intelligence
Impact of problem centralization in distributed constraint optimization algorithms
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Rational Secure Computation and Ideal Mechanism Design
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Network-Aware Operator Placement for Stream-Processing Systems
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
AND/OR search spaces for graphical models
Artificial Intelligence
Worst-case optimal redistribution of VCG payments
Proceedings of the 8th ACM conference on Electronic commerce
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
IEEE Transactions on Software Engineering
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Analysis of privacy loss in distributed constraint optimization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extremal behaviour in multiagent contract negotiation
Journal of Artificial Intelligence Research
Negotiating socially optimal allocations of resources
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Mechanisms for automated negotiation in state oriented domains
Journal of Artificial Intelligence Research
MB-DPOP: a new memory-bounded algorithm for distributed optimization
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Achieving budget-balance with Vickrey-based payment schemes in exchanges
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Rational secret sharing, revisited
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Analyzing the performance of distributed algorithms
PerMIS '07 Proceedings of the 2007 Workshop on Performance Metrics for Intelligent Systems
Inter-domain pricing: challenges and possible approaches
International Journal of Network Management
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
Dynamic multiagent load balancing using distributed constraint optimization techniques
Web Intelligence and Agent Systems
Hi-index | 0.00 |
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agents, where each agent has private information about its utility function. In this paper we model the social choice problem as a distributed constraint optimization problem (DCOP), in which each agent can communicate with other agents that share an interest in one or more variables. Whereas existing DCOP algorithms can be easily manipulated by an agent, either by misreporting private information or deviating from the algorithm, we introduce M-DPOP, the first DCOP algorithm that provides a faithful distributed implementation for efficient social choice. This provides a concrete example of how the methods of mechanism design can be unified with those of distributed optimization. Faithfulness ensures that no agent can benefit by unilaterally deviating from any aspect of the protocol, neither information-revelation, computation, nor communication, and whatever the private information of other agents. We allow for payments by agents to a central bank, which is the only central authority that we require. To achieve faithfulness, we carefully integrate the Vickrey-Clarke-Groves (VCG) mechanism with the DPOP algorithm, such that each agent is only asked to perform computation, report information, and send messages that is in its own best interest. Determining agent i's payment requires solving the social choice problem without agent i. Here, we present a method to reuse computation performed in solving the main problem in a way that is robust against manipulation by the excluded agent. Experimental results on structured problems show that as much as 87% of the computation required for solving the marginal problems can be avoided by re-use, providing very good scalability in the number of agents. On unstructured problems, we observe a sensitivity of M-DPOP to the density of the problem, and we show that reusability decreases from almost 100% for very sparse problems to around 20% for highly connected problems. We close with a discussion of the features of DCOP that enable faithful implementations in this problem, the challenge of reusing computation from the main problem to marginal problems in other algorithms such as ADOPT and OptAPO, and the prospect of methods to avoid the welfare loss that can occur because of the transfer of payments to the bank.