Login

Perfect Implementation of Normal-Form Mechanisms

Show full item record




Title: Perfect Implementation of Normal-Form Mechanisms
Author: Izmalkov, Sergei; Lepinski, Matt; Micali, Silvio
Other Contributors: Theory of Computation
Advisor: Silvio Micali
Issue Date: 2007-03
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.
URI: http://hdl.handle.net/1721.1/41527
Other Identifiers: MIT-CSAIL-TR-2008-028
Related To Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory

Files in this item

Files Size Format View
MIT-CSAIL-TR-2008-028.pdf 487.4Kb PDF View/Open
MIT-CSAIL-TR-2008-028.ps 73.87Kb Postscript View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links