Publication: Using Redundancy to Improve Robustness of Distributed Mechanism Implementations
Loading...
Open/View Files
Date
2003
Authors
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
Association for Computing Machinery
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Shneidman, Jeffrey, and David C. Parkes. 2003. Using redundancy to improve robustness of distributed mechanism implementations. In EC '03: Proceedings of the 4th ACM Conference on Electronic Commerce: June 9-12, 2003, San Diego, C.A., 276-277. New York: ACM Press.
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.
Description
Other Available Sources
Research Data
Keywords
theory of computation, computer applications
Terms of Use
This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service