Subgame Perfect Implementation with Almost Perfect Information and the Hold-Up Problem
The foundations of incomplete contracts have been questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of subgame perfect implementation to the introduction of small amounts of asymmetric information. We show that Moore- Repullo mechanisms may not yield (even approximately) truthful revelation in pure or totally mixed strategies as the amount of asymmetric information goes to zero. Moreover, we argue that a wide class of extensive-form mechanisms are subject to this fragility.
|Date of creation:||Jul 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.nber.org
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jonathan Weinstein & Muhamet Yildiz, 2007. "A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements," Econometrica, Econometric Society, vol. 75(2), pages 365-400, 03.
- Kim-Sau Chung & Jeffrey C. Ely, 2001.
"Implementation with Near-Complete Information,"
1332, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:15167. 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: ()
If references are entirely missing, you can add them using this form.