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
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
Constraint Processing
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
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
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
Superstabilizing, fault-containing distributed combinatorial optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A budget-balanced, incentive-compatible scheme for social choice
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
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
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
ODPOP: an algorithm for open/distributed constraint optimization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
PC-DPOP: a new partial centralization algorithm for distributed optimization
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
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Autonomous Agents and Multi-Agent Systems
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal is to implement the efficient solution, maximizing the total utility across all agents. Existing techniques for this problem fall into two groups. Distributed constraint optimization algorithms can find the solution without any central authority but are vulnerable to manipulation. Incentive compatible mechanisms can ensure that agents report truthful information about their utilities and prevent manipulation of the outcome but require centralized computation.Following the agenda of distributed implementation [16], we integrate these methods and introduce MDPOP, the first distributed optimization protocol that faithfully implements the VCG mechanism for this problem of efficient social choice. No agent can benefit by unilaterally deviating from any aspect of the protocol, neither information-revelation, computation, nor communication. The only central authority required is a bank that can extract payments from agents. In addition, we exploit structure in the problem and develop a faithful method to redistribute some of the VCG payments back to agents. Agents need only communicate with other agents that have an interest in the same variable, and provided that the distributed optimization itself scales the entire method scales to problems of unbounded size.