Show simple item record

dc.contributor.advisorSilvio Micalien_US
dc.contributor.authorIzmalkov, Sergeien_US
dc.contributor.authorLepinski, Matten_US
dc.contributor.authorMicali, Silvioen_US
dc.contributor.otherTheory of Computationen_US
dc.date.accessioned2008-05-08T16:30:24Z
dc.date.available2008-05-08T16:30:24Z
dc.date.issued2007-03en_US
dc.identifier.otherMIT-CSAIL-TR-2008-028en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/41527
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 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.format.extent42 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.titlePerfect Implementation of Normal-Form Mechanismsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record