Undominated Nash Implementation with Collusion and Renegotiation
This paper looks at implementation in economic environments when agents have perfect information about the state of the world, but cannot commit not to renegotiate bad outcomes or to collude against each other. If renegotiation satisfies a weak condition of disagreement point monotonicity, then any Pareto-efficient social choice function can be implemented if there are at least three agents who play undominated Nash equilibria. The mechanism does not use modulo or integer games, has no bad mixed strategy equilibria and is "bounded".
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:26:y:1999:i:2:p:337-352. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.