| dc.contributor.advisor | Silvio Micali | |
| dc.contributor.author | Izmalkov, Sergei | |
| dc.contributor.author | Lepinski, Matt | |
| dc.contributor.author | Micali, Silvio | |
| dc.contributor.other | Theory of Computation | |
| dc.date.accessioned | 2007-07-30T16:01:48Z | |
| dc.date.available | 2007-07-30T16:01:48Z | |
| dc.date.issued | 2005 | |
| dc.identifier.other | MIT-CSAIL-TR-2007-040 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/38208 | |
| dc.description.abstract | Privacy 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.extent | 51 p. | |
| dc.relation.ispartofseries | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | |
| dc.subject | Mechanism Design | |
| dc.subject | Privacy | |
| dc.subject | Privacy Equivalence | |
| dc.subject | Strategic Equivalence | |
| dc.subject | Perfect Implementation | |
| dc.title | Perfect Implementation of Normal-Form Mechanisms | |
| dc.identifier.citation | Ealier Version in 46th Foundation of Computer Science Conference | |