This paper considers dynamic implementation problems with evolving private information (according to Markov processes). A social choice function is approximately implementable if there exists a dynamic mechanism such that the social choice function is implemented by an arbitrary large number of...

This paper studies a mechanism design model where the players and the designer are nodes in a communication network. The authors characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is...