Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
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
(M+1)st-Price Auction Protocol
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Faithfulness in internet algorithms
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Brief announcement: distributed algorithmic mechanism design for scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
A sufficient condition for truthfulness with single parameter agents
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Passive verification of the strategyproofness of mechanisms in open environments
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
Setting lower bounds on truthfulness: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
ACM Transactions on Information and System Security (TISSEC)
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Truthful Approximation Schemes for Single-Parameter Agents
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A Lower Bound for Scheduling Mechanisms
Algorithmica
Autonomous nodes and distributed mechanisms
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
A deterministic truthful PTAS for scheduling related machines
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A strategyproof mechanism for scheduling divisible loads in tree networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Truthful algorithms for scheduling selfish tasks on parallel machines
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic mechanism design for load balancing in distributed systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
In classical mechanism design the outcome of the mechanism is computed by a trusted central party. In this paper, we consider the design of distributed mechanisms in which the outcome is computed by the agents themselves. We propose Distributed MinWork (DMW), a mechanism for solving the problem of scheduling on unrelated machines. We show that DMW is a faithful implementation of the MinWork mechanism, which was proposed by Nisan and Ronen in their seminal work (Nisan and Ronen (2001) [30]). We show that in addition to being faithful, DMW protects the anonymity of the losing agents and the privacy of their bids. Furthermore, we show that DMW is efficient as it has polynomial communication and computation costs.