Perfectly secure message transmission
Journal of the ACM (JACM)
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
SIAM Journal on Computing
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
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
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
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
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
MDPOP: faithful distributed implementation of efficient social choice problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fault-Tolerant Distributed Computing in Full-Information Networks
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Weakly-acyclic (internet) routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Rationality in the full-information model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Weakly-Acyclic (Internet) Routing Games
Theory of Computing Systems
| Hi-index | 0.00 |
We argue that in distributed mechanism design frameworks it is important to consider not only rational manipulation by players, but also malicious, faulty behavior. To this end, we show that in some instances it is possible to take a centralized mechanism and implement it in a distributed setting in a fault tolerant manner. More specifically, we examine two distinct models of distributed mechanism design --- a Nash implementation with the planner as a node on the network, and an ex post Nash implementation with the planner only acting as a "bank". For each model we show that the implementation can be made resilient to faults.