Abstract
This paper considers dynamic implementation problems in environments with changing private information (according to Markov processes). A social choice function is approximately implementable if it is correctly implemented an arbitrary large number of times with arbitrary high probability in all (communication) equilibria. We show that if a social choice function is strictly efficient in the set of social choice functions that satisfy an undetectability condition, then it is approximately implementable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.