Behavioral Constraints on the Design of Subgame-Perfect Implementation Mechanisms

نویسندگان

  • Ernst Fehr
  • Michael Powell
  • Tom Wilkening
چکیده

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 legitimate uses of arbitration. This, in term makes parties reluctant to trigger arbitration and leads to costly disagreements. Incentive-compatible redesigns of the mechanism mitigate some of these problems but generate new ones such that the overall performance of the redesigned mechanisms remains low.

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

ثبت نام

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

منابع مشابه

Complexity and repeated implementation

This paper examines the problem of repeatedly implementing an efficient social choice function when the agents' preferences evolve randomly. We show that the freedom to set different mechanisms at different histories can give the planner an additional leverage to deter undesirable behavior even if the mechanisms are restricted to be simple and finite. Specifically, we construct a (history-depen...

متن کامل

Subgame Perfect Implementation under Approximate Common Knowledge: Evidence from a Laboratory Experiment∗

A remarkable result, due to Moore & Repullo (1988) is that any social choice function can be implemented as the unique equilibrium of a suitably constructed dynamic game (subgame perfect implementation). Yet such mechanisms are never observed in practice, which raises the question: why not? In this paper we test such mechanisms experimentally and find that even small deviations from perfect inf...

متن کامل

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 s...

متن کامل

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...

متن کامل

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...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2017