Sciweavers

Share
JAIR
2008

M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems

9 years 10 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
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 informationrevelation, ...
Adrian Petcu, Boi Faltings, David C. Parkes
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where JAIR
Authors Adrian Petcu, Boi Faltings, David C. Parkes
Comments (0)
books