Subgame Perfect Implementation with Almost Perfect Information and the Hold-Up Problem

نویسندگان

  • Philippe Aghion
  • Richard T. Holden
چکیده

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. Aghion: Harvard University, Department of Economics. email: [email protected]. Fudenberg: Harvard University, Department of Economics. email: [email protected]. Holden: University of Chicago, Booth School of Business. email: [email protected]. We owe special thanks to Oliver Hart for numerous discussions, and to Johannes Horner and Andy Skrzypacz for pointing out an error in a previous version. We are also grateful to Mathias Dewatripont, Bob Gibbons, Philippe Jehiel, John Moore, Roger Myerson, Andrew Postlewaite, Olivier Tercieux, Jean Tirole, Ivan Werning and Muhamet Yildiz for helpful discussions and comments. Michael Powell provided excellent research assistance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgame Perfect Implementation: A Necessary and Almost Sufficient Condition*

We present a necessary and almost sufftcient condition for subgame perfect implementation of social choice correspondences. In societies with at least three individuals, any social choice correspondence which satisfies no veto power and our necessary Condition a is subgame perfect implementable. Thus Condition GL is analogous to monotonicity which, by Maskin’s celebrated characterization, is ne...

متن کامل

Behavioral Constraints on the Design of Subgame-Perfect Implementation Mechanisms

We study subgame-perfect implementation (SPI) mechanisms that have been proposed in the literature as a solution to the hold-up problem. We show that SPI mechanism – which are based on off-equilibrium arbitration clauses that impose fines for lying and the inappropriate use of arbitration — have severe behavioral constraints. The fines imposed in the SPI mechanism induce retaliation against leg...

متن کامل

Subgame perfect implementation: A full characterization

Moore and Repullo [Subgame perfect implementation, Econometrica 56 (1988) 1191–1220], and Abreu and Sen [Subgame perfect implementation: a necessary and almost sufficient condition, J. Econ. Theory 50 (1990) 285–299] introduce distinct necessary and sufficient conditions for SPE implementation, when the number of players is at least three. This paper closes the gap between the conditions—a comp...

متن کامل

Subgame Perfect Implementation under Perfect and Almost Perfect Information: An Empirical Test

In this paper we conduct a laboratory experiment to test the extent to which Moore and Repullo’s subgame perfect implementation mechanism induces truth-telling in practice, both in a setting with perfect information and in a setting where buyers and sellers face a small amount of uncertainty regarding the good’s value. We find that Moore-Repullo mechanisms fail to implement truth-telling in a s...

متن کامل

Does backwards induction imply subgame perfection?

In finite games subgame perfect equilibria are precisely those that are obtained by a backwards induction procedure. In large extensive form games with perfect information this equivalence does not hold: Strategy combinations fulfilling the backwards induction criterion may not be subgame perfect in general. The full equivalence is restored only under additional (topological) assumptions. This ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006