Abstract
We provide a necessary and sufficient condition for a strong (Nash) implementation. This condition is a simpler version of that which originally appeared in Dutta and Sen (1991a); we show that a part of their condition (a version of Maskin monotonicity) is not necessary. This simplification enables us to construct an algorithm that helps us to check the implementability of a correspondence.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
