Shneidman, JeffreyParkes, David2010-05-182003Shneidman, 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.1-58113-679-X9781581136791http://nrs.harvard.edu/urn-3:HUL.InstRepos:4101236This 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.en-UStheory of computationcomputer applicationsMonograph or Book2010-05-1810.1145/779928.779997