Using Redundancy to Improve Robustness of Distributed Mechanism Implementations

DSpace/Manakin Repository

Using Redundancy to Improve Robustness of Distributed Mechanism Implementations

Citable link to this page

. . . . . .

Title: Using Redundancy to Improve Robustness of Distributed Mechanism Implementations
Author: Shneidman, Jeffrey; Parkes, David C.

Note: Order does not necessarily reflect citation order of authors.

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.
Full Text & Related Files:
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.
Published Version: doi:10.1145/779928.779997
Other Sources: http://www.eecs.harvard.edu/econcs/pubs/pp068-shneidman.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4101236

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7588]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters