We characterize decision rules which are implementable in mechanism design settings when, after the play of a mechanism, the uninformed party can propose a new mechanism to the informed party. The necessary and sufficient conditions are, essentially, that the rule be implementable with commitment, that for each type the decision is at least as high as if there were no mechanism, and that the slope of the decision function is not too high. The direct mechanism which implements such a rule with commitment will also implement it in any equilibrium without commitment, so the standard mechanism is robust to renegotiation
It has been emphasized that when contracts are incomplete (e.g., because some relevant variables are...
The paper characterizes the choice rules that can be implemented when agents are unable to commit th...
We consider (two-person) bargaining games and we assume that the agents want to apply two possibly d...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
The paper characterises the choice rules that can be implemented when agents are unable to commit th...
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and ...
We study a contract design setting in which the contracting parties cannot commit not to renegotiate...
We study contracting and costly renegotiation in settings of complete, but unverifiable information,...
According to standard theory, the set of implementable outcome functions is reduced if the mechanism...
According to standard theory, the set of implementable efficient outcome functions is greatly reduce...
This paper develops a theoretical framework for studying contract and enforcement in setting of comp...
We study a mechanism design problem in which players can take part in a mechanism to coordinate thei...
In a mechanism design problem, participation constraints require that all types prefer the proposed ...
The paper studies the implementation problem, first analyzed by Maskin and Moore (1999), in which tw...
It has been emphasized that when contracts are incomplete (e.g., because some relevant variables are...
The paper characterizes the choice rules that can be implemented when agents are unable to commit th...
We consider (two-person) bargaining games and we assume that the agents want to apply two possibly d...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
A mechanism is said to be renegotiation-proof if it is robust against renegotation both before and a...
The paper characterises the choice rules that can be implemented when agents are unable to commit th...
A mechanism is said to be renegotiation-proof if it is robust against renegotiation both before and ...
We study a contract design setting in which the contracting parties cannot commit not to renegotiate...
We study contracting and costly renegotiation in settings of complete, but unverifiable information,...
According to standard theory, the set of implementable outcome functions is reduced if the mechanism...
According to standard theory, the set of implementable efficient outcome functions is greatly reduce...
This paper develops a theoretical framework for studying contract and enforcement in setting of comp...
We study a mechanism design problem in which players can take part in a mechanism to coordinate thei...
In a mechanism design problem, participation constraints require that all types prefer the proposed ...
The paper studies the implementation problem, first analyzed by Maskin and Moore (1999), in which tw...
It has been emphasized that when contracts are incomplete (e.g., because some relevant variables are...
The paper characterizes the choice rules that can be implemented when agents are unable to commit th...
We consider (two-person) bargaining games and we assume that the agents want to apply two possibly d...