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.
Volume (Year): 14 (1997)
Issue (Month): 3 ()
|Note:||Received: 28 February 1995/Accepted: 13 March 1996|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:14:y:1997:i:3:p:439-447. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.