Using redundancy to improve robustness of distributed mechanism implementations

Authors:
Jeffrey Shneidman;David C. Parkes
Affiliations:
Harvard University, Cambridge, MA;Harvard University, Cambridge, MA
Venue:
Proceedings of the 4th ACM conference on Electronic commerce
Year:
2003

Citing 4
Cited 10

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
Using redundancy to improve robustness of distributed mechanism implementations

Proceedings of the 4th ACM conference on Electronic commerce

Using redundancy to improve robustness of distributed mechanism implementations

Proceedings of the 4th ACM conference on Electronic commerce
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
Efficient learning equilibrium

Artificial Intelligence
Decentralized voting with unconditional privacy

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the cost-ineffectiveness of redundancy in commercial P2P computing

Proceedings of the 12th ACM conference on Computer and communications security
Computational-Mechanism Design: A Call to Arms

IEEE Intelligent Systems
A BGP-based mechanism for lowest-cost routing

Distributed Computing - Special issue: PODC 02
FairPeers: Efficient Profit Sharing in Fair Peer-to-Peer Market Places

Journal of Network and Systems Management
PeerMint: decentralized and secure accounting for peer-to-peer applications

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces computation compatibility and communication compatibility as requirements for a distributed mechanism implementation. Just as payments are used to create incentive compatible mechanisms, some technique must be used to create computation/communication compatible mechanisms. This paper explores computation redundancy and communication redundancy as two such techniques. This paper uses interdomain routing as an example domain, and considers where redundancy can succeed and fail in addressing cheating with respect to computation and communication.