Show simple item record

dc.contributor.advisorSilvio Micali
dc.contributor.authorIzmalkov, Sergei
dc.contributor.authorLepinski, Matt
dc.contributor.authorMicali, Silvio
dc.contributor.otherTheory of Computation
dc.date.accessioned2007-07-30T16:01:48Z
dc.date.available2007-07-30T16:01:48Z
dc.date.issued2005
dc.identifier.otherMIT-CSAIL-TR-2007-040
dc.identifier.urihttp://hdl.handle.net/1721.1/38208
dc.description.abstractPrivacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding the players' privacy, or assuming trust in a mediator--- may not be realistic and fail to reach the mechanism's objectives. We thus investigate implementations of a new type.We put forward the notion of a perfect implementation of a normal-form mechanism M: in essence, an extensive-form mechanism exactly preserving all strategic properties of M, without relying on a trusted party or violating the privacy of the players.We prove that ANY normal-form mechanism can be perfectly implemented via envelopes and an envelope-randomizing device (i.e., the same tools used for running fair lotteries or tallying secret votes).
dc.format.extent51 p.
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.subjectMechanism Design
dc.subjectPrivacy
dc.subjectPrivacy Equivalence
dc.subjectStrategic Equivalence
dc.subjectPerfect Implementation
dc.titlePerfect Implementation of Normal-Form Mechanisms
dc.identifier.citationEalier Version in 46th Foundation of Computer Science Conference


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record