The renegotiation-proofness principle and costly renegotiation

2Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

We study contracting and costly renegotiation in settings of complete, but unverifiable information, using the mechanism-design approach. We show how renegotiation activity is best modeled in the fundamentals of the mechanism-design framework, so that noncontractibility of renegotiation amounts to a constraint on the problem. We formalize and clarify the Renegotiation-Proofness Principle (RPP), which states that any state-contingent payoff vector that is implementable in an environment with renegotiation can also be implemented by a mechanism in which renegotiation does not occur in equilibrium. We observe that the RPP is not valid in some settings. However, we prove a general monotonicity result that confirms the RPP's message about renegotiation opportunities having negative consequences. Our monotonicity theorem states that, as the costs of renegotiation increase, the set of implementable state-contingent payoffs becomes larger. © 2013 by the author; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Brennan, J. R., & Watson, J. (2013). The renegotiation-proofness principle and costly renegotiation. Games, 4(3), 347–366. https://doi.org/10.3390/g4030347

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free