Double implementation in Nash and strong Nash equilibria
We deal with the implementation problem where agents in some groups can cooperate (or form coalitions) and in some others cannot. We consider a situation where the planner does not know whether agents in a group can cooperate or not. We provide a necessary and sufficient condition for a correspondence to be implementable in such a situation.