|
DSpace at MIT >
Computer Science and Artificial Intelligence Lab (CSAIL) >
CSAIL Digital Archive >
CSAIL Technical Reports (July 1, 2003 - present) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1721.1/41527
|
| Title: | Perfect Implementation of Normal-Form Mechanisms |
| Authors: | Izmalkov, Sergei
Lepinski, Matt
Micali, Silvio |
| Advisor: | Silvio Micali |
| Other contributors: | Theory of Computation |
| Issue Date: | Mar-2007 |
| Related To: | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
|
| 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 |
| Appears in Collections: | CSAIL Technical Reports (July 1, 2003 - present)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| MIT-CSAIL-TR-2008-028.pdf | | 476Kb | Adobe PDF | View/Open | | MIT-CSAIL-TR-2008-028.ps | | 72Kb | PostScript | View/Open |
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
