Perfect and General Virtual Implementation For Perfectly Informed Players
Author(s)Micali, Silvio; Chen, Jing
Theory of Computation
MetadataShow full item record
We show that, when the players are perfectly informed about each other, essentially all social-choice functions can be rationally robustly implemented via an extensive-form public-action mechanism that (1) is perfectly robust against collusion, (2) requires only a linear number of computation steps and communication bits, and (3) preserves the privacy of the players' types to a very high extent.
rationally robust implementation, Virtual implementation, perfectly informed players