A Truthful Mechanism Design for Distributed Optimisation Algorithms in Networks with Self-interested Agents
By: Tianyi Zhong, David Angeli
Potential Business Impact:
Stops selfish robots from cheating the system.
Enhancing resilience in multi-agent systems in the face of selfish agents is an important problem that requires further characterisation. This work develops a truthful mechanism that avoids self-interested and strategic agents maliciously manipulating the algorithm. We prove theoretically that the proposed mechanism incentivises self-interested agents to participate and follow the provided algorithm faithfully. Additionally, the mechanism is compatible with any distributed optimisation algorithm that can calculate at least one subgradient at a given point. Finally, we present an illustrative example that shows the effectiveness of the mechanism.
Similar Papers
Multi-agent Adaptive Mechanism Design
CS and Game Theory
Helps computers learn secrets without knowing them first.
Ensuring Truthfulness in Distributed Aggregative Optimization
Multiagent Systems
Makes groups work together honestly and efficiently.
Mechanism Design with Spiteful Agents
CS and Game Theory
Makes spiteful people fair in games.