| dc.contributor.advisor |
Silvio Micali |
en_US |
| dc.contributor.author |
Izmalkov, Sergei |
en_US |
| dc.contributor.author |
Lepinski, Matt |
en_US |
| dc.contributor.author |
Micali, Silvio |
en_US |
| dc.contributor.other |
Theory of Computation |
en_US |
| dc.date.accessioned |
2008-05-08T16:30:24Z |
|
| dc.date.available |
2008-05-08T16:30:24Z |
|
| dc.date.issued |
2007-03 |
en_US |
| dc.identifier.other |
MIT-CSAIL-TR-2008-028 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/41527 |
|
| 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 mediator or violating the privacy of the players. We prove that ANY normal-form mechanism can be perfectly implemented by a PUBLIC mediator using envelopes and an envelope-randomizing device (i.e., the same tools used for running fair lotteries or tallying secret votes). Differently from a trusted mediator, a public one only performs prescribed public actions, so that everyone can verify that he is acting properly, and never learns any information that should remain private. |
en_US |
| dc.description.provenance |
Submitted by CSAIL Importer (publications-dspace@csail.mit.edu) on 2008-05-08T16:30:22Z
No. of bitstreams: 2
MIT-CSAIL-TR-2008-028.pdf: 487432 bytes, checksum: f7bc232775ae91d381b56bb8a9cce4c0 (MD5)
MIT-CSAIL-TR-2008-028.ps: 73870 bytes, checksum: 67c67001b2e1901098311c5da266c3c0 (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2008-05-08T16:30:24Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2008-028.pdf: 487432 bytes, checksum: f7bc232775ae91d381b56bb8a9cce4c0 (MD5)
MIT-CSAIL-TR-2008-028.ps: 73870 bytes, checksum: 67c67001b2e1901098311c5da266c3c0 (MD5)
Previous issue date: 2007-03 |
en |
| dc.format.extent |
42 p. |
en_US |
| dc.relation |
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
en_US |
| dc.relation |
|
en_US |
| dc.title |
Perfect Implementation of Normal-Form Mechanisms |
en_US |
