Abstract
This paper is concerned with the amount of communication that must be provided to implement a performance standard by a mechanism whose stationary messages have the Nash property. We study the question whether a given message space is large enough to implement a given performance standard. In general, an implementing mechanism with the Nash property in messages requires a larger message space than suffices for decentralized realization without regard to individual incentives. In particular, we study implementation of Walrasian allocations in exchange environments. We show that the smallest message space that implements Walrasian allocations is one of dimension, roughly, n (1 - 1) + I/(n - 1), where I is the number of commodities and n the number of agents. We exhibit an implementing mechanism whose message space has that dimension.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
